Skip to content

Commit

Permalink
Update README.md
Browse files Browse the repository at this point in the history
  • Loading branch information
arie-matsliah authored Jul 25, 2022
1 parent 87b2528 commit 34848e7
Showing 1 changed file with 6 additions and 1 deletion.
7 changes: 6 additions & 1 deletion README.md
Original file line number Diff line number Diff line change
@@ -1,3 +1,8 @@

[![PyPI version](https://img.shields.io/pypi/v/sfas.svg)](https://pypi.org/project/sfas/)
[![Downloads shield](https://pepy.tech/badge/sfas)](https://pepy.tech/project/sfas)
[![License: MIT](https://img.shields.io/badge/License-MIT-yellow.svg)](https://opensource.org/licenses/MIT)

# Small Feedback Arc Set (sfas)
Efficient implementation of a greedy algorithm for computing small feedback arc sets in directed weighted multi-graphs.
This implementation is an adaptation of the algorithm described in Section 2.3 of [this](http://www.vldb.org/pvldb/vol10/p133-simpson.pdf) article, with additional generalization to support weights and parallel edges.
Expand Down Expand Up @@ -33,4 +38,4 @@ ouput = greedy.compute_order(graph)
### Result:
1. `List` with all nodes, ordered so that the total weight of edges going backwards (w.r.t. this order) is small
## Questions / suggestions welcome
`[email protected]`
`[email protected]`

0 comments on commit 34848e7

Please sign in to comment.