Data.Graph.InductivePlus

additional functions for the graph structure defined in fgl library

Documentation

module Data.Graph.Inductive

setVLabel

Arguments

:: (Node, a)

node number paired with old node's label value

-> a

new label value

-> Gr a b

-> Gr a b

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

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

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

getVLabel :: Node -> Gr a b -> a

the function extracts a label of v node from the graph g

setELabel :: (Node, Node, a) -> a -> Gr b a -> Gr b a

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

the function version of setELabel for an undirected graph

isEdge :: (Node, Node) -> Gr a b -> Bool

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

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.

findPaths :: Node -> Node -> Gr a b -> [Path]

it finds and returns the path consiting of edges from first node to second one. If the path doesn't exist then the function returns the empty list.