Module isomorph

Fast checking to see if graphs are not isomorphic.

This isn't a graph isomorphism checker.

Date: $Date: 2005-05-31 17:00:13 -0600 (Tue, 31 May 2005) $

Author: Pieter Swart (swart@lanl.gov) Dan Schult (dschult@colgate.edu)

Functions

graph_could_be_isomorphic(G1, G2)
Returns False if graphs G1 and G2 are definitely not isomorphic.

source code

fast_graph_could_be_isomorphic(G1, G2)
Returns False if graphs G1 and G2 are definitely not isomorphic.

source code

faster_graph_could_be_isomorphic(G1, G2)
Returns False if graphs G1 and G2 are definitely not isomorphic.

source code

is_isomorphic(G1, G2)
Returns True if the graphs G1 and G2 are isomorphic and False otherwise.

source code

_test_suite()

source code

Variables

__credits__ = ''

__revision__ = '$Revision: 1002 $'

Function Details

Returns False if graphs G1 and G2 are definitely not isomorphic. True does NOT garantee isomorphism.

Checks for matching degree, triangle, and number of cliques sequences.

Returns False if graphs G1 and G2 are definitely not isomorphic. True does NOT garantee isomorphism.

Checks for matching degree and triangle sequences.

Returns False if graphs G1 and G2 are definitely not isomorphic. True does NOT garantee isomorphism.

Checks for matching degree sequences in G1 and G2.

Returns True if the graphs G1 and G2 are isomorphic and False otherwise.

Uses the vf2 algorithm - see networkx.isomorphvf2