dawg: Directed acyclic word graphs

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

The library implements directed acyclic word graphs (DAWGs), which can be also interpreted as minimal acyclic finite-state automata.

In most cases you can use the Data.DAWG module which provides the basic implementation of DAWGs. If values have substantial memory footprint consider using the Data.DAWG.Wrapper module instead.

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, monad-codec (==0.2.*), 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 Wed Nov 14 18:38:08 UTC 2012
Distributions NixOS:0.11
Downloads 5066 total (30 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

Modules

[Index]

Downloads

Maintainer's Corner

For package maintainers and hackage trustees