dom-lt: The Lengauer-Tarjan graph dominators algorithm.
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.
Warnings:
- 'ghc-options: -O2' is rarely needed. Check that it is giving a real benefit and not just imposing longer compile times on your users.
The Lengauer-Tarjan graph dominators algorithm. Included are ways to compute domination and post-domination relationships.
Properties
| Versions | 0.1.0, 0.1.1, 0.1.2, 0.1.3, 0.2.0, 0.2.0, 0.2.1, 0.2.2, 0.2.2.1, 0.2.3 |
|---|---|
| Change log | Changelog.md |
| Dependencies | array, base (>=4.9 && <5), containers (>=0.5) [details] |
| 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 2019-03-19T18:54:53Z |
Modules
[Index] [Quick Jump]
- Data
- Graph
Downloads
- dom-lt-0.2.0.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
Maintainer's Corner
Package maintainers
For package maintainers and hackage trustees