Data.Graph.Morphisms

Documentation

areIsomorphic :: Graph g => g v e -> g v' e' -> Bool

Tell if two graphs are isomorphic TODO: check first: same number of vertices, same number of edges

isomorphism :: Graph g => g v e -> g v' e' -> v -> v'

isURegular :: UGraph v e -> Bool

Tell if a UGraph is regular | An undirected graph is regular if each vertex has the same degree

isDRegular :: DGraph v e -> Bool

Tell if a DGraph is regular | A directed graph is regular if each vertex has the same indigree and | | outdegree