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

Version on this page:
Stackage Nightly 2017-08-20:
LTS Haskell 9.1:
Stackage Nightly 2017-08-20:
Latest on Hackage:
BSD3 licensed by Jakub Waszczuk
Maintained by waszczuk.kuba@gmail.com

Module documentation for

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.

Used by 1 package:
comments powered byDisqus