networkx.DiGraphMatcher.candidate_pairs_iter
networkx.DiGraphMatcher.semantic_feasibility
Enter search terms or a module, class or function name.
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.