@hackage / dawg

Directed acyclic word graphs

Latest0.11

About

Metadata

  • Last updated , by JakubWaszczuk
  • License BSD-3-Clause
  • Categories Data Structures

  • Maintained by: waszczuk.kuba@gmail.com

  • Lottery factor: 0

Links

Installation

Readme

The library implements directed acyclic word graphs (DAWGs) internally represented as minimal acyclic deterministic finite-state automata.

The Data.DAWG.Dynamic module provides fast insert and delete operations which can be used to build the automaton on-the-fly. The automaton from the Data.DAWG.Static module has lower memory footprint and provides static hashing functionality.