graph-generators-0.1.2.0: Functions for generating structured or random FGL graphs

Safe Haskell	Safe

Data.Graph.Generators.Regular

Documentation

completeGraph Source

Arguments

:: Int	The number of nodes in the graph
-> GraphInfo	The resulting complete graph

completeGraphWithSelfloops Source

Arguments

:: Int	The number of nodes in the graph
-> GraphInfo	The resulting complete graph

completeBipartiteGraph Source

Arguments

:: Int	The number of nodes in the first partition
-> Int	The number of nodes in the second partition
-> GraphInfo	The resulting graph

emptyGraph :: Int -> GraphInfo Source

barbellGraph Source

Arguments

:: Int	The number of nodes in the complete bells
-> Int	The number of nodes in the path, i.e the number of nodes outside the bells
-> GraphInfo	The resulting barbell graph

generalizedBarbellGraph Source

Arguments

:: Int	The number of nodes in the first bell
-> Int	The number of nodes in the path, i.e. the number of nodes outside the bells
-> Int	The number of nodes in the second bell
-> GraphInfo	The resulting barbell graph

cycleGraph Source

Arguments

:: Int	n: Number of nodes in the circle
-> GraphInfo	The circular graph with n nodes.

pathGraph Source

Arguments

:: Int	n: Number of nodes
-> GraphInfo

starGraph Source

Arguments

:: Int	n: Number of overall nodes
-> GraphInfo

wheelGraph Source

Arguments

:: Int	n: Number of overall nodes
-> GraphInfo

grid2DGraph Source

Arguments

:: Int	m: Number of rows in the grid
-> Int	n: Number of columns in the grid
-> GraphInfo