fgl-5.4.1.1: Martin Erwig's Functional Graph LibrarySource codeContentsIndex
Data.Graph.Inductive.Example
Contents
Auxiliary Functions
Small Dynamic Graphs
Small Static Graphs
Functions to Create (Regular) Graphs
More Graphs
Dynamic Versions
Static Versions
Description
Example Graphs
Synopsis
genUNodes :: Int -> [UNode]
genLNodes :: Enum a => a -> Int -> [LNode a]
labUEdges :: [Edge] -> [UEdge]
noEdges :: [UEdge]
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
cyc3 :: Gr Char String
g3 :: Gr Char String
g3b :: Gr Char String
dag4 :: Gr Int ()
d1 :: Gr Int Int
d3 :: Gr Int Int
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 ())
d1' :: IO (SGr Int Int)
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 :: Gr Char ()
clr489 :: Gr Char ()
clr486 :: Gr String ()
clr508 :: Gr Char Int
clr528 :: Gr Char Int
clr595 :: Gr Int Int
gr1 :: Gr Int Int
kin248 :: Gr Int ()
vor :: Gr String Int
clr479' :: IO (SGr Char ())
clr489' :: IO (SGr Char ())
clr486' :: IO (SGr String ())
clr508' :: IO (SGr Char Int)
clr528' :: IO (SGr Char Int)
kin248' :: IO (SGr Int ())
vor' :: IO (SGr String Int)
Auxiliary Functions
genUNodes :: Int -> [UNode]Source
generate list of unlabeled nodes
genLNodes :: Enum a => a -> Int -> [LNode a]Source
generate list of labeled nodes
labUEdges :: [Edge] -> [UEdge]Source
denote unlabeled edges
noEdges :: [UEdge]Source
empty (unlabeled) edge list
Small Dynamic Graphs
a :: Gr Char ()Source
b :: Gr Char ()Source
c :: Gr Char ()Source
e :: Gr Char ()Source
loop :: Gr Char ()Source
ab :: Gr Char ()Source
abb :: Gr Char ()Source
dag3 :: Gr Char ()Source
e3 :: Gr () StringSource
cyc3 :: Gr Char StringSource
g3 :: Gr Char StringSource
g3b :: Gr Char StringSource
dag4 :: Gr Int ()Source
d1 :: Gr Int IntSource
d3 :: Gr Int IntSource
Small Static Graphs
a' :: IO (SGr Char ())Source
b' :: IO (SGr Char ())Source
c' :: IO (SGr Char ())Source
e' :: IO (SGr Char ())Source
loop' :: IO (SGr Char ())Source
ab' :: IO (SGr Char ())Source
abb' :: IO (SGr Char ())Source
dag3' :: IO (SGr Char ())Source
e3' :: IO (SGr () String)Source
dag4' :: IO (SGr Int ())Source
d1' :: IO (SGr Int Int)Source
d3' :: IO (SGr Int Int)Source
Functions to Create (Regular) Graphs
ucycle :: Graph gr => Int -> gr () ()Source
star :: Graph gr => Int -> gr () ()Source
ucycleM :: GraphM m gr => Int -> m (gr () ())Source
starM :: GraphM m gr => Int -> m (gr () ())Source
More Graphs
clr : Cormen/Leiserson/Rivest
kin : Kingston
Dynamic Versions
clr479 :: Gr Char ()Source
clr489 :: Gr Char ()Source
clr486 :: Gr String ()Source
clr508 :: Gr Char IntSource
clr528 :: Gr Char IntSource
clr595 :: Gr Int IntSource
gr1 :: Gr Int IntSource
kin248 :: Gr Int ()Source
vor :: Gr String IntSource
Static Versions
clr479' :: IO (SGr Char ())Source
clr489' :: IO (SGr Char ())Source
clr486' :: IO (SGr String ())Source
clr508' :: IO (SGr Char Int)Source
clr528' :: IO (SGr Char Int)Source
kin248' :: IO (SGr Int ())Source
vor' :: IO (SGr String Int)Source
Produced by Haddock version 0.8