Data.Graph.Inductive.Example

Example Graphs

Auxiliary Functions

genUNodes :: Int -> [UNode]

generate list of unlabeled nodes

genLNodes :: Enum a => a -> Int -> [LNode a]

generate list of labeled nodes

labUEdges :: [Edge] -> [UEdge]

denote unlabeled edges

noEdges :: [UEdge]

empty (unlabeled) edge list

Small Dynamic Graphs

a, dag3, abb, ab, loop, e, c, b :: Gr Char ()

e3 :: Gr () String

cyc3, g3b, g3 :: Gr Char String

dag4 :: Gr Int ()

d1, d3 :: Gr Int Int

Small Static Graphs

a', dag3', abb', ab', loop', e', c', b' :: IO (SGr Char ())

e3' :: IO (SGr () String)

dag4' :: IO (SGr Int ())

d1', d3' :: IO (SGr Int Int)

Functions to Create (Regular) Graphs

ucycle :: Graph gr => Int -> gr () ()

star :: Graph gr => Int -> gr () ()

ucycleM :: GraphM m gr => Int -> m (gr () ())

starM :: GraphM m gr => Int -> m (gr () ())

More Graphs

clr : Cormen/Leiserson/Rivest

kin : Kingston

Dynamic Versions

clr479, clr489 :: Gr Char ()

clr486 :: Gr String ()

clr508, clr528 :: Gr Char Int

clr595, gr1 :: Gr Int Int

kin248 :: Gr Int ()

vor :: Gr String Int

Static Versions

clr479', clr489' :: IO (SGr Char ())

clr486' :: IO (SGr String ())

clr508', clr528' :: IO (SGr Char Int)

kin248' :: IO (SGr Int ())

vor' :: IO (SGr String Int)