dawg: Directed acyclic word graphs

[ bsd3, data, data-structures, library ] [ Propose Tags ]
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, mtl, vector, vector‑binary [details]
License BSD-3-Clause
Copyright Copyright (c) 2012 IPI PAN
Author Jakub Waszczuk
Maintainer waszczuk.kuba@gmail.com
Category Data, Data Structures
Home page https://github.com/kawu/dawg
Source repo head: git clone https://github.com/kawu/dawg.git
Uploaded by JakubWaszczuk at Fri Nov 23 01:47:04 UTC 2012
Distributions NixOS:0.11
Downloads 5036 total (41 in the last 30 days)
Rating (no votes yet) [estimated by rule of succession]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]
Hackage Matrix CI

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. Automaton from the Data.DAWG.Frozen module is ,,immutable'', but it has lower memory footprint and provides perfect hashing functionality.




Maintainer's Corner

For package maintainers and hackage trustees