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.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] | 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 (info) |
|---|---|
| Change log | Changelog.md |
| Dependencies | array, base (>=4.9 && <5), containers (>=0.5 && <0.7) [details] |
| Tested with | ghc ==8.10.1 || ==8.8.4 || ==8.0.1 |
| License | BSD-3-Clause |
| Copyright | (c) Matt Morrow, 2009 |
| Author | Matt Morrow |
| Maintainer | Andreas Klebinger <klebinger.andreas@gmx.at> |
| Category | Algorithms, Graphs |
| Bug tracker | https://github.com/AndreasPK/dom-lt/issues |
| Source repo | head: git clone https://github.com/AndreasPK/dom-lt |
| Uploaded | by AndreasK at 2020-07-29T16:31:30Z |
| Distributions | NixOS:0.2.3 |
| Reverse Dependencies | 4 direct, 0 indirect [details] |
| Downloads | 13962 total (154 in the last 30 days) |
| Rating | (no votes yet) [estimated by Bayesian average] |
| Your Rating | |
| Status | Docs available [build log] Last success reported on 2020-07-29 [all 1 reports] |