class_docstr: Implementation of VF2 algorithm for matching undirected graphs.
  
  Suitable for Graph and MultiGraph instances.
class_docstr_tok: ["Implementation","of","VF2","algorithm","for","matching","undirected","graphs",".","Suitable","for","Graph","and","MultiGraph","instances","."]
docstr: Returns True if G1 and G2 are isomorphic graphs.
docstr_tok: ["Returns","True","if","G1","and","G2","are","isomorphic","graphs","."]
code: def is_isomorphic(self):
      """Returns True if G1 and G2 are isomorphic graphs."""
  
      # Let's do two very quick checks!
      # QUESTION: Should we call faster_graph_could_be_isomorphic(G1,G2)?
      # For now, I just copy the code.
  
      # Check global properties
      if self.G1.order() != self.G2.order():
          return False
  
      # Check local properties
      d1 = sorted(d for n, d in self.G1.degree())
      d2 = sorted(d for n, d in self.G2.degree())
      if d1 != d2:
          return False
  
      try:
          x = next(self.isomorphisms_iter())
          return True
      except StopIteration:
          return False
  
imports: import sys
label_desc: Use image node_id 5 for calling the GraphMatcher obj's underlying member method code with example usage: obj.is_isomorphic() and returns: False, False, True, False