dawg: Directed acyclic word graphs
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.
Downloads
- dawg-0.3.0.tar.gz [browse] (Cabal source package)
- Package description (revised from the package)
Note: This package has metadata revisions in the cabal description newer than included in the tarball. To unpack the package including the revisions, use 'cabal get'.
Maintainer's Corner
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), monad-codec (>=0.2 && <0.3), mtl, vector, vector-binary [details] |
| License | BSD-3-Clause |
| Copyright | Copyright (c) 2012 IPI PAN |
| Author | Jakub Waszczuk |
| Maintainer | waszczuk.kuba@gmail.com |
| Revised | Revision 2 made by HerbertValerioRiedel at 2019-01-12T23:57:46Z |
| 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 2012-11-14T18:38:08Z |
| Distributions | |
| Reverse Dependencies | 9 direct, 2 indirect [details] |
| Downloads | 11575 total (16 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] |