| Safe Haskell | Safe |
|---|---|
| Language | Haskell98 |
Data.Graph.Inductive.Monad
Contents
Description
Monadic Graphs
- class Monad m => GraphM m gr where
- ufoldM :: GraphM m gr => (Context a b -> c -> c) -> c -> m (gr a b) -> m c
- 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]
- 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 () ())
- 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)
Classes
class Monad m => GraphM m gr where Source #
Methods
isEmptyM :: m (gr a b) -> m Bool Source #
matchM :: Node -> m (gr a b) -> m (Decomp gr a b) Source #
mkGraphM :: [LNode a] -> [LEdge b] -> m (gr a b) Source #
labNodesM :: m (gr a b) -> m [LNode a] Source #
matchAnyM :: m (gr a b) -> m (GDecomp gr a b) Source #
noNodesM :: m (gr a b) -> m Int Source #
nodeRangeM :: m (gr a b) -> m (Node, Node) Source #