Data.Graph.Inductive.Monad

Monadic Graphs

Classes

class Monad m => GraphM m gr where

Methods

emptyM :: m (gr a b)

isEmptyM :: m (gr a b) -> m Bool

matchM :: Node -> m (gr a b) -> m (Decomp gr a b)

mkGraphM :: [LNode a] -> [LEdge b] -> m (gr a b)

labNodesM :: m (gr a b) -> m [LNode a]

matchAnyM :: m (gr a b) -> m (GDecomp gr a b)

noNodesM :: m (gr a b) -> m Int

nodeRangeM :: m (gr a b) -> m (Node, Node)

labEdgesM :: m (gr a b) -> m [LEdge b]

Instances

GraphM IO SGr

Operations

Graph Folds and Maps

ufoldM :: GraphM m gr => (Context a b -> c -> c) -> c -> m (gr a b) -> m c

graph fold

Graph Projection

nodesM :: GraphM m gr => m (gr a b) -> m [Node]

edgesM :: GraphM m gr => m (gr a b) -> m [Edge]

newNodesM :: GraphM m gr => Int -> m (gr a b) -> m [Node]

Graph Construction and Destruction

delNodeM :: GraphM m gr => Node -> m (gr a b) -> m (gr a b)

delNodesM :: GraphM m gr => [Node] -> m (gr a b) -> m (gr a b)

mkUGraphM :: GraphM m gr => [Node] -> [Edge] -> m (gr () ())

Graph Inspection

contextM :: GraphM m gr => m (gr a b) -> Node -> m (Context a b)

labM :: GraphM m gr => m (gr a b) -> Node -> m (Maybe a)