Example Graphs
- genUNodes :: Int -> [UNode]
- genLNodes :: Enum a => a -> Int -> [LNode a]
- labUEdges :: [Edge] -> [UEdge]
- noEdges :: [UEdge]
- 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
- 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)
- ucycle :: Graph gr => Int -> gr () ()
- star :: Graph gr => Int -> gr () ()
- ucycleM :: GraphM m gr => Int -> m (gr () ())
- starM :: GraphM m gr => Int -> m (gr () ())
- clr479, clr489 :: Gr Char ()
- clr486 :: Gr String ()
- clr508, clr528 :: Gr Char Int
- clr595, gr1 :: Gr Int Int
- kin248 :: Gr Int ()
- vor :: Gr String Int
- clr479', clr489' :: IO (SGr Char ())
- clr486' :: IO (SGr String ())
- clr508', clr528' :: IO (SGr Char Int)
- kin248' :: IO (SGr Int ())
- vor' :: IO (SGr String Int)
Auxiliary Functions
Small Dynamic Graphs
Small Static Graphs
Functions to Create (Regular) Graphs
More Graphs
clr : Cormen/Leiserson/Rivest
kin : Kingston