@hackage dawg0.3.0

Directed acyclic word graphs

Categories
- Data Structures
License
BSD-3-Clause
Maintainer
waszczuk.kuba@gmail.com
Links
Versions
- 0.11 Mon, 22 Jul 2013
- 0.10 Tue, 11 Jun 2013
- 0.9 Wed, 9 Jan 2013
- 0.8.2 Sat, 30 Nov 2019
- 0.8.1 Wed, 28 Nov 2012
- 0.8 Sat, 12 Jan 2019

Installation
In your cabal file:
Dependencies (7)
- base >=4 && <5
- binary
- containers >=0.4.1 && <0.6
- mtl
- vector
- monad-codec >=0.2 && <0.3
Dependents (9)
@hackage/adict, @hackage/acme-everything, @hackage/polh-lexicon, @hackage/moan, @hackage/nerf, @hackage/hist-pl-fusion, Show all…

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.

@hackage dawg0.3.0

Categories

License

Maintainer

Links

Versions

Installation

Dependencies (7)

Dependents (9)