Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

Isomorphism

is_isomorphic(G1, G2[, node_match, edge_match])	Returns True if the graphs G1 and G2 are isomorphic and False otherwise.
could_be_isomorphic(G1, G2)	Returns False if graphs are definitely not isomorphic.
fast_could_be_isomorphic(G1, G2)	Returns False if graphs are definitely not isomorphic.
faster_could_be_isomorphic(G1, G2)	Returns False if graphs are definitely not isomorphic.

Advanced Interface to VF2 Algorithm

• VF2 Algorithm
  • Introduction
  • Examples
  • Subgraph Isomorphism
  • References
  • See Also
  • Notes
  • Graph Matcher
  • DiGraph Matcher
  • Match helpers