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: Restores the recursion limit.
docstr_tok: ["Restores","the","recursion","limit","."]
code: def reset_recursion_limit(self):
      """Restores the recursion limit."""
      # TODO:
      # Currently, we use recursion and set the recursion level higher.
      # It would be nice to restore the level, but because the
      # (Di)GraphMatcher classes make use of cyclic references, garbage
      # collection will never happen when we define __del__() to
      # restore the recursion level. The result is a memory leak.
      # So for now, we do not automatically restore the recursion level,
      # and instead provide a method to do this manually. Eventually,
      # we should turn this into a non-recursive implementation.
      sys.setrecursionlimit(self.old_recursion_limit)
  
imports: import sys
label_desc: Use image node_id 2 for calling the GraphMatcher obj's underlying member method code with example usage: obj.reset_recursion_limit() without return types