Modulefgl-5.8.3.1Haskell98

Data.Graph.Inductive.Example

Example Graphs

Contents

Auxiliary Functions
Small Dynamic Graphs
Small Static Graphs
Functions to Create (Regular) Graphs
More Graphs
Dynamic Versions
Static Versions

Synopsis

value genUNodes
value genLNodes
value labUEdges
value noEdges
value a
value b
value c
value e
value loop
value ab
value abb
value dag3
value e3
value cyc3
value g3
value g3b
value dag4
value d1
value d3
value a'
value b'
value c'
value e'
value loop'
value ab'
value abb'
value dag3'
value e3'
value dag4'
value d1'
value d3'
value ucycle
value star
value ucycleM
value starM
value clr479
value clr489
value clr486
value clr508
value clr528
value clr595
value gr1
value kin248
value vor
value clr479'
value clr489'
value clr486'
value clr508'
value clr528'
value kin248'
value vor'

Packagefgl-5.8.3.1
Exports51
LanguageHaskell98
LicenceBSD-3-Clause
SourceExample.hs

Auxiliary Functions

valuegenUNodes :: Int -> [UNode]

Source#

generate list of unlabeled nodes

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

Source#

generate list of labeled nodes

valuelabUEdges :: [Edge] -> [UEdge]

Source#

denote unlabeled edges

valuenoEdges :: [UEdge]

Source#

empty (unlabeled) edge list

Small Dynamic Graphs

valuea :: Gr Char ()

valueb :: Gr Char ()

valuec :: Gr Char ()

valuee :: Gr Char ()

valueloop :: Gr Char ()

valueab :: Gr Char ()

valueabb :: Gr Char ()

valuedag3 :: Gr Char ()

valuee3 :: Gr () String

valuecyc3 :: Gr Char String

valueg3 :: Gr Char String

valueg3b :: Gr Char String

valuedag4 :: Gr Int ()

valued1 :: Gr Int Int

valued3 :: Gr Int Int

Small Static Graphs

valuea' :: IO (SGr Char ())

valueb' :: IO (SGr Char ())

valuec' :: IO (SGr Char ())

valuee' :: IO (SGr Char ())

valueloop' :: IO (SGr Char ())

valueab' :: IO (SGr Char ())

valueabb' :: IO (SGr Char ())

valuedag3' :: IO (SGr Char ())

valuee3' :: IO (SGr () String)

valuedag4' :: IO (SGr Int ())

valued1' :: IO (SGr Int Int)

valued3' :: IO (SGr Int Int)

Functions to Create (Regular) Graphs

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

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

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

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

More Graphs

clr : Cormen/Leiserson/Rivest

kin : Kingston

Dynamic Versions

valueclr479 :: Gr Char ()

valueclr489 :: Gr Char ()

valueclr486 :: Gr String ()

valueclr508 :: Gr Char Int

valueclr528 :: Gr Char Int

valueclr595 :: Gr Int Int

valuegr1 :: Gr Int Int

valuekin248 :: Gr Int ()

valuevor :: Gr String Int

Static Versions

valueclr479' :: IO (SGr Char ())

valueclr489' :: IO (SGr Char ())

valueclr486' :: IO (SGr String ())

valueclr508' :: IO (SGr Char Int)

valueclr528' :: IO (SGr Char Int)

valuekin248' :: IO (SGr Int ())

valuevor' :: IO (SGr String Int)