fgl-5.5.0.1: Martin Erwig's Functional Graph Library

Safe HaskellNone

Data.Graph.Inductive.Example

Contents

Description

Example Graphs

Synopsis

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

Small Static Graphs

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

Static Versions