dawg: Directed acyclic word graphs
The library implements directed acyclic word graphs (DAWGs) internaly represented as minimal acyclic deterministic finite-state automata.
The Data.DAWG 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. Both automata versions work in combination with different implementations of transition maps provided by the Data.DAWG.Trans modules' hierarchy.
|Versions||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.9, 0.10, 0.11|
|Dependencies||base (==4.*), binary, containers (>=0.4.1 && <0.6), mtl, 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 Wed Nov 28 19:20:16 UTC 2012|
|Downloads||5066 total (30 in the last 30 days)|
|Rating||(no votes yet) [estimated by rule of succession]|
|Status||Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI
For package maintainers and hackage trustees