GraphRewriting.Graph

Most of the functions for graph scrutinisation (Read) and modification (Write) are defined monadically. This module defines functions for extracting these monadic values and a few non-monadic graph scrutinisation/modification functions.

Documentation

emptyGraph :: Graph n

nodes :: Graph n -> [n]

edges :: Graph n -> [(Edge, [n])]

Each edge corresponds to the set of nodes it connects

unsafeMapNodes :: (n -> n') -> Graph n -> Graph n'

unsafe, since no checks are performed to ensure that the invariants from GraphRewriting.Graph.Write are preserved

unsafeMapNodesUnique :: (Int -> n -> n') -> Graph n -> Graph n'

map that supplies an additional unique key to the mapping function; unsafe in the same way as unsafeMapNodes

runGraph :: Rewrite n a -> Graph n -> (a, Graph n)

apply a monadic graph modification to a graph

evalGraph :: Rewrite n a -> Graph n -> a

execGraph :: Rewrite n a -> Graph n -> Graph n

module GraphRewriting.Graph.Types

data Graph n

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

Fields

nodeMap :: IntMap n

edgeMap :: IntMap IntSet

nextKey :: Int

Instances

MonadReader (Graph n) (Rewrite n)

MonadState (Graph n) (Rewrite n)