Note

This documents the development version of NetworkX. Documentation for the current release can be found here.

networkx.algorithms.isomorphism.DiGraphMatcher.match

DiGraphMatcher.match()

Extends the isomorphism mapping.

This function is called recursively to determine if a complete isomorphism can be found between G1 and G2. It cleans up the class variables after each recursive call. If an isomorphism is found, we yield the mapping.