dawg: Directed acyclic word graphs

[ bsd3, data, data-structures, library ] [ Propose Tags ]

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.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
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]
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 2013-07-22T13:41:58Z
Distributions
Reverse Dependencies 9 direct, 2 indirect [details]
Downloads 11246 total (33 in the last 30 days)
Rating (no votes yet) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs uploaded by user
Build status unknown [no reports yet]