class_docstr: Implementation of VF2 algorithm for matching directed graphs.
  
  Suitable for DiGraph and MultiDiGraph instances.
class_docstr_tok: ["Implementation","of","VF2","algorithm","for","matching","directed","graphs",".","Suitable","for","DiGraph","and","MultiDiGraph","instances","."]
docstr: Initialize DiGraphMatcher.
  
  G1 and G2 should be nx.Graph or nx.MultiGraph instances.
  
  Examples
  --------
  To create a GraphMatcher which checks for syntactic feasibility:
  
  >>> from networkx.algorithms import isomorphism
  >>> G1 = nx.DiGraph(nx.path_graph(4, create_using=nx.DiGraph()))
  >>> G2 = nx.DiGraph(nx.path_graph(4, create_using=nx.DiGraph()))
  >>> DiGM = isomorphism.DiGraphMatcher(G1, G2)
docstr_tok: ["Initialize","DiGraphMatcher",".","G1","and","G2","should","be","nx.Graph","or","nx.MultiGraph","instances",".","Examples","--","--","--","--","To","create","a","GraphMatcher","which","checks","for","syntactic","feasibility",":",">",">",">","from","networkx.algorithms","import","isomorphism",">",">",">","G1","=","nx.DiGraph","(","nx.path_graph","(","4",",","create_using=nx.DiGraph","(",")",")",")",">",">",">","G2","=","nx.DiGraph","(","nx.path_graph","(","4",",","create_using=nx.DiGraph","(",")",")",")",">",">",">","DiGM","=","isomorphism.DiGraphMatcher","(","G1",",","G2",")"]
code: def __init__(self, G1, G2):
      """Initialize DiGraphMatcher.
  
      G1 and G2 should be nx.Graph or nx.MultiGraph instances.
  
      Examples
      --------
      To create a GraphMatcher which checks for syntactic feasibility:
  
      >>> from networkx.algorithms import isomorphism
      >>> G1 = nx.DiGraph(nx.path_graph(4, create_using=nx.DiGraph()))
      >>> G2 = nx.DiGraph(nx.path_graph(4, create_using=nx.DiGraph()))
      >>> DiGM = isomorphism.DiGraphMatcher(G1, G2)
      """
      super().__init__(G1, G2)
  
imports: import sys
label_desc: Use image node_id 1 to create a new DiGraphMatcher object from inherited base classes: GraphMatcher with example: obj = DiGraphMatcher(G1, G2)