| Safe Haskell | Safe-Inferred |
|---|---|
| Language | Haskell98 |
Data.Graph.Inductive.Monad
Description
Monadic Graphs
Synopsis
- class Monad m => GraphM m gr where
- 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]
- 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 #
Instances
| GraphM IO SGr Source # | |
Defined in Data.Graph.Inductive.Monad.IOArray Methods emptyM :: IO (SGr a b) Source # isEmptyM :: IO (SGr a b) -> IO Bool Source # matchM :: Node -> IO (SGr a b) -> IO (Decomp SGr a b) Source # mkGraphM :: [LNode a] -> [LEdge b] -> IO (SGr a b) Source # labNodesM :: IO (SGr a b) -> IO [LNode a] Source # matchAnyM :: IO (SGr a b) -> IO (GDecomp SGr a b) Source # noNodesM :: IO (SGr a b) -> IO Int Source # | |
| GraphM (ST s) (SGr s) Source # | |
Defined in Data.Graph.Inductive.Monad.STArray Methods emptyM :: ST s (SGr s a b) Source # isEmptyM :: ST s (SGr s a b) -> ST s Bool Source # matchM :: Node -> ST s (SGr s a b) -> ST s (Decomp (SGr s) a b) Source # mkGraphM :: [LNode a] -> [LEdge b] -> ST s (SGr s a b) Source # labNodesM :: ST s (SGr s a b) -> ST s [LNode a] Source # matchAnyM :: ST s (SGr s a b) -> ST s (GDecomp (SGr s) a b) Source # noNodesM :: ST s (SGr s a b) -> ST s Int Source # nodeRangeM :: ST s (SGr s a b) -> ST s (Node, Node) Source # | |