packed-dawg: Generation and traversal of highly compressed directed acyclic word graphs.
[ bsd3, data, library ] [ Propose Tags ]
Generation and traversal of highly compressed directed acyclic word graphs.
- packed-dawg-0.2.0.5.tar.gz [browse] (Cabal source package)
- Package description (as included in the package)
For package maintainers and hackage trustees
- No Candidates
|Versions [RSS]||0.1.0.0, 0.2.0.0, 0.2.0.1, 0.2.0.2, 0.2.0.3, 0.2.0.4, 0.2.0.5, 0.2.0.6, 0.2.0.7, 0.2.0.8|
|Dependencies||base (>=4.6.0 && <=4.9), binary (>=0.7 && <0.8), deepseq (>=1.3), mtl (>=2.1), unordered-containers (>=0.2), vector (>=0.10 && <0.11), vector-binary-instances (>=0.2.1 && <0.2.2) [details]|
|Source repo||head: git clone https://github.com/AndrasKovacs/dawg|
|Uploaded||by AndrasKovacs at 2015-04-11T06:05:20Z|
|Reverse Dependencies||1 direct, 0 indirect [details]|
|Downloads||6543 total (17 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs available [build log]
Last success reported on 2015-04-11 [all 1 reports]