additional functions for the graph structure defined in fgl library

- module Data.Graph.Inductive
- setVLabel :: (Node, a) -> a -> Gr a b -> Gr a b
- setVLabel' :: Node -> a -> Gr a b -> Gr a b
- getVLabel :: Node -> Gr a b -> a
- setELabel :: (Node, Node, a) -> a -> Gr b a -> Gr b a
- getELabel :: (Node, Node) -> Gr a b -> b
- isEdge :: (Node, Node) -> Gr a b -> Bool
- mergeTwoGraphs :: Gr a b -> Gr a b -> Gr a b
- findPaths :: Node -> Node -> Gr a b -> [Path]

# Documentation

module Data.Graph.Inductive

the function updates a label of v node in the graph g

setVLabel' :: Node -> a -> Gr a b -> Gr a bSource

the function updates a label of v node in the graph g

getELabel :: (Node, Node) -> Gr a b -> bSource

the function version of setELabel for an undirected graph

mergeTwoGraphs :: Gr a b -> Gr a b -> Gr a bSource

the function merges two graphs. E.i. if first graph hasn't got vertex v but second one has got it then the node is inserted into first graph with same label. Edges are processed too.