| Safe Haskell | None |
|---|---|
| Language | Haskell98 |
Graphs.GetAncestors
Synopsis
- getAncestors :: Graph graph => Bool -> graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> (nodeLabel -> IO Bool) -> Node -> IO [Node]
- getDescendants :: Graph graph => Bool -> graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> (nodeLabel -> IO Bool) -> Node -> IO [Node]
- getAncestorsGeneric :: Ord node => Bool -> (node -> IO [node]) -> (node -> IO Bool) -> node -> IO [node]
- isAncestorPure :: Ord node => (node -> [node]) -> node -> node -> Bool
- isAncestor :: (Monad m, Ord node) => (node -> m [node]) -> node -> node -> m Bool
- getAncestorsPure :: Ord node => (node -> [node]) -> node -> [node]
Documentation
getAncestors :: Graph graph => Bool -> graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> (nodeLabel -> IO Bool) -> Node -> IO [Node] Source #
getDescendants :: Graph graph => Bool -> graph nodeLabel nodeTypeLabel arcLabel arcTypeLabel -> (nodeLabel -> IO Bool) -> Node -> IO [Node] Source #
getAncestorsGeneric :: Ord node => Bool -> (node -> IO [node]) -> (node -> IO Bool) -> node -> IO [node] Source #
isAncestorPure :: Ord node => (node -> [node]) -> node -> node -> Bool Source #
Returns True if first node is ancestor or equal to the second.
isAncestor :: (Monad m, Ord node) => (node -> m [node]) -> node -> node -> m Bool Source #
Returns True if first node is ancestor or equal to the second.
getAncestorsPure :: Ord node => (node -> [node]) -> node -> [node] Source #