| Safe Haskell | None |
|---|---|
| Language | Haskell2010 |
Data.Graph.Haggle.PatriciaTree
Description
This graph is based on the implementation in fgl (using big-endian patricia-tries -- IntMap).
This formulation does not support parallel edges.
Synopsis
- data PatriciaTree nl el
Documentation
data PatriciaTree nl el Source #
The PatriciaTree is a graph implementing the InductiveGraph
interface (as well as the other immutable graph interfaces). It is
based on the graph type provided by fgl.
Inductive graphs support more interesting decompositions than the
other graph interfaces in this library, at the cost of less compact
representations and some additional overhead on some operations, as
most must go through the match operator.
This graph type is most useful for incremental construction in pure code. It also supports node removal from pure code.