topograph: Directed acyclic graphs.
Directed acyclic graphs can be sorted topographically. Existence of topographic ordering allows writing many graph algorithms efficiently. And many graphs, e.g. most dependency graphs are acyclic!
There are some algorithms built-in: dfs, transpose, transitive closure, transitive reduction... Some algorithms even become not-so-hard to implement, like a longest path!
|Versions [faq]||1, 22.214.171.124|
|Dependencies||base (>=4.6 && <4.16), base-compat (>=0.10.5 && <0.11 || >=0.11.0 && <0.12), base-orphans (==0.8.*), containers (>=0.5.0.0 && <0.6 || >=0.6.0.1 && <0.7), vector (==0.12.*) [details]|
|Copyright||(c) 2018-2019 Oleg Grenrus|
|Author||Oleg Grenrus <firstname.lastname@example.org>|
|Revised||Revision 1 made by phadej at 2021-02-20T21:38:23Z|
|Source repo||head: git clone https://github.com/phadej/topograph.git|
|Uploaded||by phadej at 2020-03-27T07:00:53Z|
|Distributions||Arch:126.96.36.199, Fedora:188.8.131.52, NixOS:184.108.40.206, Stackage:220.127.116.11, openSUSE:18.104.22.168|
|Downloads||2145 total (113 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs available [build log]
Last success reported on 2020-03-27 [all 1 reports]
- topograph-22.214.171.124.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
For package maintainers and hackage trustees