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!
Downloads
- topograph-1.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
Versions [RSS] | 1, 1.0.0.1, 1.0.0.2, 1.0.1 |
---|---|
Dependencies | base (>=4.12.0.0 && <4.21), base-orphans (>=0.9.2 && <0.10), containers (>=0.6.0.1 && <0.8), vector (>=0.13.1.0 && <0.14) [details] |
License | BSD-3-Clause |
Copyright | (c) 2018-2019 Oleg Grenrus |
Author | Oleg Grenrus <oleg.grenrus@iki.fi> |
Maintainer | Oleg.Grenrus <oleg.grenrus@iki.fi> |
Category | Data, Graph |
Home page | https://github.com/phadej/topograph |
Bug tracker | https://github.com/phadej/topograph/issues |
Source repo | head: git clone https://github.com/phadej/topograph.git |
Uploaded | by phadej at 2024-06-08T14:33:36Z |
Distributions | Arch:1.0.0.2, LTSHaskell:1.0.1, NixOS:1.0.1, Stackage:1.0.1, openSUSE:1.0.0.2 |
Reverse Dependencies | 1 direct, 0 indirect [details] |
Downloads | 5629 total (53 in the last 30 days) |
Rating | (no votes yet) [estimated by Bayesian average] |
Your Rating | |
Status | Docs available [build log] Last success reported on 2024-06-08 [all 1 reports] |