haskell-igraph-0.5.0: Haskell interface of the igraph library.

Safe Haskell	None
Language	Haskell2010

IGraph.Isomorphism

Synopsis

getSubisomorphisms :: Graph d => LGraph d v1 e1 -> LGraph d v2 e2 -> [[Int]]
isomorphic :: Graph d => LGraph d v1 e1 -> LGraph d v2 e2 -> Bool
isoclassCreate :: Graph d => Int -> Int -> d -> LGraph d () ()
isoclass3 :: Graph d => d -> [LGraph d () ()]
isoclass4 :: Graph d => d -> [LGraph d () ()]

Documentation

getSubisomorphisms Source #

Arguments

:: Graph d
=> LGraph d v1 e1	graph to be searched in
-> LGraph d v2 e2	smaller graph
-> [[Int]]

isomorphic :: Graph d => LGraph d v1 e1 -> LGraph d v2 e2 -> Bool Source #

Determine whether two graphs are isomorphic.

isoclassCreate Source #

Arguments

:: Graph d
=> Int	The number of vertices to add to the graph.
-> Int	The isomorphism class
-> d
-> LGraph d () ()

Creates a graph from the given isomorphism class. This function is implemented only for graphs with three or four vertices.

isoclass3 :: Graph d => d -> [LGraph d () ()] Source #

isoclass4 :: Graph d => d -> [LGraph d () ()] Source #