Modulefgl-5.8.3.1Haskell98

Data.Graph.Inductive.Monad

Monadic Graphs

Contents

Synopsis

Classes

classclass Monad m => GraphM (m :: Type -> Type) (gr :: Type -> Type -> Type) where

Instances2GraphM

GraphM IO SGrDefined in fgl-5.8.3.1 · Data.Graph.Inductive.Monad.IOArray
GraphM (ST s) (SGr s)Defined in fgl-5.8.3.1 · Data.Graph.Inductive.Monad.STArray

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

graph fold

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

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

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

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

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

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

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

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