dawg-ord

Directed acyclic word graphs https://github.com/kawu/dawg-ord

LTS Haskell 11.6:	0.5.1.0
Stackage Nightly 2018-04-21:	0.5.1.0
Latest on Hackage:	0.5.1.0

See all snapshots dawg-ord appears in

BSD3 licensed by Jakub Waszczuk

Maintained by waszczuk.kuba@gmail.com

Module documentation for 0.5.1.0

Data
- Data.DAWG
  - Data.DAWG.Int
  - Data.DAWG.Ord

The library implements directed acyclic word graphs (DAWGs) internally represented as minimal acyclic deterministic finite-state automata. The implemented version of DAWG can be seen as a map from sequences of alphabet symbols (keys) to values.

The library allows to build DAWGs over any symbols and values provided that they both have Ord instances (see the Data.DAWG.Ord module). It also provides a fast insert operation which can be used to construct DAWGs on-the-fly.

Depends on 5 packages:

base, containers, mtl, transformers, vector

Used by 1 package:

partage