graph-rewriting-0.6.0: Monadic graph rewriting of hypergraphs with ports and multiedges

Safe HaskellNone

GraphRewriting.Graph.Internal

Synopsis

Documentation

data Graph n Source

Hypergraph that holds nodes of type n. Nodes can be referenced by type Node, edges by type Edge, see GraphRewriting.Graph.Read and GraphRewriting.Graph.Write

Constructors

Graph 

newtype Node Source

Constructors

Node 

Fields

nKey :: Int
 

Instances

newtype Port Source

Constructors

Edge 

Fields

eKey :: Int
 

Instances

type EdgeSource

Arguments

 = Port

a hyperedge really, connecting a non-empty subset of the graph's nodes (see attachedNodes)

readRef :: Monad m => Int -> IntMap a -> m aSource