| Copyright | (c) Martin Erwig, Christian Maeder and Uni Bremen 1999-2006 |
|---|---|
| License | GPLv2 or higher, see LICENSE.txt |
| Maintainer | Christian.Maeder@dfki.de |
| Stability | provisional |
| Portability | portable |
| Safe Haskell | Safe-Inferred |
Common.Lib.Graph
Description
- newtype Gr a b = Gr {
- convertToMap :: IntMap (GrContext a b)
- data GrContext a b = GrContext {}
- unsafeConstructGr :: IntMap (GrContext a b) -> Gr a b
- decomposeGr :: Node -> Gr a b -> Maybe (GrContext a b, Gr a b)
- getPaths :: Node -> Gr a b -> [[LEdge b]]
- getAllPathsTo :: Node -> Gr a b -> [[LEdge b]]
- getPathsTo :: Node -> Node -> Gr a b -> [[LEdge b]]
- getLEdges :: Node -> Node -> Gr a b -> [b]
- delLEdge :: (b -> b -> Ordering) -> LEdge b -> Gr a b -> Gr a b
- insLEdge :: Bool -> (b -> b -> Ordering) -> LEdge b -> Gr a b -> (Gr a b, Bool)
- delLNode :: (a -> a -> Bool) -> LNode a -> Gr a b -> Gr a b
- labelNode :: LNode a -> Gr a b -> (Gr a b, a)
- getNewNode :: Gr a b -> Node
- rmIsolated :: Gr a b -> Gr a b
Documentation
data GrContext a b
Constructors
| GrContext | |
Instances
| (Data a, Data b) => Data (GrContext a b) | |
| (ShATermConvertible a, ShATermConvertible b) => ShATermConvertible (GrContext a b) | |
| (ShATermLG a, ShATermLG b) => ShATermLG (GrContext a b) | |
| Typeable (* -> * -> *) GrContext |
unsafeConstructGr :: IntMap (GrContext a b) -> Gr a b
getAllPathsTo :: Node -> Gr a b -> [[LEdge b]]
compute the possible cycle free reversed paths from a start node
getPathsTo :: Node -> Node -> Gr a b -> [[LEdge b]]
compute the possible cycle free paths from a start node to a target node.
insLEdge :: Bool -> (b -> b -> Ordering) -> LEdge b -> Gr a b -> (Gr a b, Bool)
insert a labeled edge into a graph, returns False if edge exists
labelNode :: LNode a -> Gr a b -> (Gr a b, a)
sets the node with new label and returns the new graph and the old label
getNewNode :: Gr a b -> Node
returns one new node id for the given graph
rmIsolated :: Gr a b -> Gr a b
remove isolated nodes without edges