fgl-5.4.2.4: Martin Erwig's Functional Graph Library

Safe HaskellNone

Data.Graph.Inductive.Example

Contents

Description

Example Graphs

Synopsis

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 :: Gr Char ()

b :: Gr Char ()

c :: Gr Char ()

e :: Gr Char ()

loop :: Gr Char ()

ab :: Gr Char ()

abb :: Gr Char ()

dag3 :: Gr Char ()

e3 :: Gr () String

dag4 :: Gr Int ()

Small Static Graphs

a' :: IO (SGr Char ())

b' :: IO (SGr Char ())

c' :: IO (SGr Char ())

e' :: IO (SGr Char ())

loop' :: IO (SGr Char ())

ab' :: IO (SGr Char ())

abb' :: IO (SGr Char ())

dag3' :: IO (SGr Char ())

e3' :: IO (SGr () String)

dag4' :: IO (SGr 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 :: Gr Char ()

clr489 :: Gr Char ()

kin248 :: Gr Int ()

Static Versions

clr479' :: IO (SGr Char ())

clr489' :: IO (SGr Char ())

kin248' :: IO (SGr Int ())