IGraph.Isomorphism

Documentation

getSubisomorphisms

Arguments

:: Graph d v1 e1

graph to be searched in

-> Graph d v2 e2

smaller graph

-> [[Int]]

isomorphic :: Graph d v1 e1 -> Graph d v2 e2 -> Bool

Determine whether two graphs are isomorphic.

isoclassCreate

Arguments

:: SingI d

=> Int

The number of vertices to add to the graph.

-> Int

The isomorphism class

-> Graph d () ()

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

isoclass3 :: forall d. SingI d => [Graph d () ()]

isoclass4 :: forall d. SingI d => [Graph d () ()]