topograph: Directed acyclic graphs.
This is a package candidate release! Here you can preview how this package release will appear once published to the main package index (which can be accomplished via the 'maintain' link below). Please note that once a package has been published to the main package index it cannot be undone! Please consult the package uploading documentation for more information.
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!
Properties
| Versions | 1, 1.0.0.1, 1.0.0.1, 1.0.0.2, 1.0.1 |
|---|---|
| Change log | None available |
| Dependencies | base (>=4.6 && <4.15), base-compat (>=0.10.5 && <0.11 || >=0.11.0 && <0.12), base-orphans (>=0.8 && <0.9), containers (>=0.5.0.0 && <0.6 || >=0.6.0.1 && <0.7), vector (>=0.12 && <0.13) [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 2020-03-27T07:00:35Z |
Modules
[Index] [Quick Jump]
Downloads
- topograph-1.0.0.1.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees