haggle-0.2: A graph library offering mutable, immutable, and inductive graphs
Safe HaskellNone
LanguageHaskell2010

Data.Graph.Haggle.SimpleBiDigraph

Description

This is a simple graph (it does not allow parallel edges). To support this efficiently, it is less compact than Digraph or BiDigraph. As a consequence, edge existence tests are efficient (logarithmic in the number of edges leaving the source vertex).

Documentation

data MSimpleBiDigraph m Source #

Instances

Instances details
MBidirectional MSimpleBiDigraph Source # 
Instance details

Defined in Data.Graph.Haggle.SimpleBiDigraph

MAddEdge MSimpleBiDigraph Source # 
Instance details

Defined in Data.Graph.Haggle.SimpleBiDigraph

MAddVertex MSimpleBiDigraph Source # 
Instance details

Defined in Data.Graph.Haggle.SimpleBiDigraph

MGraph MSimpleBiDigraph Source # 
Instance details

Defined in Data.Graph.Haggle.SimpleBiDigraph

type ImmutableGraph MSimpleBiDigraph Source # 
Instance details

Defined in Data.Graph.Haggle.SimpleBiDigraph