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!
|Dependencies||base (>=4.6 && <4.13), base-compat (>=0.10.5 && <0.11), 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>|
|Source repo||head: git clone https://github.com/phadej/topograph.git|
|Uploaded||by phadej at Mon Mar 11 19:35:03 UTC 2019|
|Downloads||61 total (28 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
Docs uploaded by user
Build status unknown [no reports yet]
For package maintainers and hackage trustees