dawg-ord: Directed acyclic word graphs

[ bsd3, data, data-structures, library ] [ Propose Tags ]

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.

Downloads

Maintainer's Corner

Package maintainers

For package maintainers and hackage trustees

Candidates

  • No Candidates
Versions [RSS] 0.2, 0.3, 0.3.1, 0.4, 0.4.0.1, 0.4.0.2, 0.5.0.0, 0.5.0.1, 0.5.0.2, 0.5.1.0, 0.5.1.1, 0.5.1.2
Dependencies base (>=4 && <5), containers (>=0.5 && <0.7), mtl (>=2.1 && <2.3), transformers (>=0.3 && <0.6), vector (>=0.10 && <0.13) [details]
License BSD-3-Clause
Copyright Copyright (c) 2015 Jakub Waszczuk
Author Jakub Waszczuk
Maintainer waszczuk.kuba@gmail.com
Category Data, Data Structures
Home page https://github.com/kawu/dawg-ord
Source repo head: git clone https://github.com/kawu/dawg-ord.git
Uploaded by JakubWaszczuk at 2020-09-24T08:17:19Z
Distributions
Reverse Dependencies 1 direct, 1 indirect [details]
Downloads 8464 total (31 in the last 30 days)
Rating 2.0 (votes: 1) [estimated by Bayesian average]
Your Rating
  • λ
  • λ
  • λ
Status Docs available [build log]
Last success reported on 2020-09-24 [all 1 reports]