dawg: Directed acyclic word graphs
The library implements directed acyclic word graphs (DAWGs) internally represented as minimal acyclic deterministic finite-state automata.
The Data.DAWG.Dynamic module provides fast insert and delete operations which can be used to build the automaton on-the-fly. The automaton from the Data.DAWG.Static module has lower memory footprint and provides static hashing functionality.
|Versions [RSS]||0.1.0, 0.2.0, 0.3.0, 0.4.0, 0.5.0, 0.6.0, 0.7.0, 0.7.1, 0.8, 0.8.1, 0.8.2, 0.9, 0.10, 0.11|
|Dependencies||base (>=4 && <5), binary, containers (>=0.4.1 && <0.6), mtl, transformers, vector, vector-binary [details]|
|Copyright||Copyright (c) 2012 IPI PAN|
|Category||Data, Data Structures|
|Source repo||head: git clone https://github.com/kawu/dawg.git|
|Uploaded||by JakubWaszczuk at 2013-07-22T13:41:58Z|
|Downloads||10870 total (4 in the last 30 days)|
|Rating||(no votes yet) [estimated by Bayesian average]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]