dom-lt: The Lengauer-Tarjan graph dominators algorithm.
This version is deprecated.
The Lengauer-Tarjan graph dominators algorithm. Included are ways to compute domination and post-domination relationships.
Downloads
- dom-lt-0.2.0.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'.
Maintainer's Corner
For package maintainers and hackage trustees
Candidates
| Versions [RSS] | 0.1.0, 0.1.1, 0.1.2, 0.1.3, 0.2.0, 0.2.1, 0.2.2, 0.2.2.1, 0.2.3, 0.2.4 (info) |
|---|---|
| Change log | Changelog.md |
| Dependencies | array, base (>=4.9 && <5), containers (>=0.5 && <0.7) [details] |
| License | BSD-3-Clause |
| Copyright | (c) Matt Morrow, 2009 |
| Author | Matt Morrow |
| Maintainer | Andreas Klebinger <klebinger.andreas@gmx.at> |
| Uploaded | by AndreasK at 2019-03-19T18:56:14Z |
| Revised | Revision 1 made by AndreasK at 2019-03-21T19:46:18Z |
| Category | Algorithms, Graphs |
| Bug tracker | https://github.com/AndreasPK/dom-lt/issues |
| Source repo | head: git clone https://github.com/AndreasPK/dom-lt |
| Reverse Dependencies | 4 direct, 1 indirect [details] |
| Downloads | 14663 total (30 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2019-03-19 [all 1 reports] |