Data.Graph.Inductive.PatriciaTree

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

type UGr = Gr () ()