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 build-in: dfs, transpose, transitive closure, transitive reduction... Some algorithms even become not-so-hard to implement, like a longest path!
|Versions [faq]||1, 188.8.131.52|
|Dependencies||base (>=4.6 && <4.14), 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 2 made by phadej at 2019-09-10T06:17:29Z|
|Source repo||head: git clone https://github.com/phadej/topograph.git|
|Uploaded||by phadej at 2019-03-11T19:35:03Z|
|Distributions||Arch:184.108.40.206, Fedora:220.127.116.11, LTSHaskell:18.104.22.168, NixOS:22.214.171.124, Stackage:126.96.36.199, openSUSE:188.8.131.52|
|Downloads||2211 total (118 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
Docs uploaded by user
Build status unknown [no reports yet]
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