Data.Graph.Inductive.PatriciaTree

fgl-5.5.2.3: Martin Erwig's Functional Graph Library

Safe Haskell | None
Language | Haskell98

Data.Graph.Inductive.PatriciaTree

Description

An efficient implementation of `Graph` using big-endian patricia tree (i.e. Data.IntMap).

This module provides the following specialised functions to gain more performance, using GHC's RULES pragma:

- `insNode`
- `insEdge`
- `gmap`
- `nmap`
- `emap`

# Documentation

data Gr a b

Instances

DynGraph Gr |
Graph Gr |
(Eq a, Ord b) => Eq (Gr a b) |
(Read a, Read b) => Read (Gr a b) |
(Show a, Show b) => Show (Gr a b) |
Generic (Gr a b) |
(NFData a, NFData b) => NFData (Gr a b) |
type Rep (Gr a b) |

type UGr = Gr () ()