GraphRewriting.Graph

Most of the functions for graph scrutinisation (GraphRewriting.Graph.Read) and modification (GraphRewriting.Graph.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, as no check for changed edge references is performed

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

unsafe map that supplies an additional unique key to the mapping function

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