Efficient implementation of a greedy algorithm for computing small feedback arc sets in directed weighted multi-graphs.
Project description
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 article, with additional generalization to support weights and parallel edges.
Release history Release notifications | RSS feed
Download files
Download the file for your platform. If you're not sure which to choose, learn more about installing packages.
Source Distribution
sfas-0.0.1.tar.gz
(7.6 kB
view hashes)
Built Distribution
sfas-0.0.1-py3-none-any.whl
(5.2 kB
view hashes)
