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

Safe HaskellNone

GraphRewriting.Graph.Types

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

Instances

data Rewrite n a Source

Instances

Monad (Rewrite n) 
Functor (Rewrite n) 
MonadFix (Rewrite n) 
MonadReader (Graph n) (Rewrite n) 
MonadState (Graph n) (Rewrite n) 

data Node Source

Instances

Eq Node 
Ord Node 
Show Node 

data Port Source

Instances

Eq Port 
Ord Port 
Show Edge 

type EdgeSource

Arguments

 = Port

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