Project Homepage
|
Source Code
2.5
Install
Tutorial
Gallery
Reference
Introduction
Graph types
Algorithms
Approximations and Heuristics
Assortativity
Asteroidal
Bipartite
Boundary
Bridges
Centrality
Chains
Chordal
Clique
Clustering
Coloring
Communicability
Communities
Components
Connectivity
Cores
Covering
Cycles
Cuts
D-Separation
Directed Acyclic Graphs
Distance Measures
Distance-Regular Graphs
Dominance
Dominating Sets
Efficiency
Eulerian
Flows
Graph Hashing
Graphical degree sequence
Hierarchy
Hybrid
Isolates
Isomorphism
Link Analysis
Link Prediction
Lowest Common Ancestor
Matching
Minors
Maximal independent set
non-randomness
Moral
Node Classification
Operators
Planarity
Planar Drawing
Reciprocity
Regular
Rich Club
Shortest Paths
Similarity Measures
Simple Paths
Small-world
s metric
Sparsifiers
Structural holes
Swap
Threshold Graphs
Tournament
Traversal
Tree
Triads
Vitality
Voronoi cells
Wiener index
Functions
Graph generators
Linear algebra
Converting to and from other data formats
Relabeling nodes
Reading and writing graphs
Drawing
Randomness
Exceptions
Utilities
Glossary
Developer Guide
Release Log
License
About Us
Citing
Bibliography
NetworkX
»
Reference
»
Algorithms
»
Isomorphism
»
VF2 Algorithm
»
networkx.algorithms.isomorphism.DiGraphMatcher.candidate_pairs_iter
networkx.algorithms.isomorphism.DiGraphMatcher.candidate_pairs_iter
¶
DiGraphMatcher.
candidate_pairs_iter
(
)
[source]
¶
Iterator over candidate pairs of nodes in G1 and G2.