NetworkX
1.9.1
Overview
Download
Installing
Tutorial
Reference
Introduction
Graph types
Algorithms
Approximation
Assortativity
Bipartite
Blockmodeling
Boundary
Centrality
Chordal
Clique
Clustering
Communities
Components
Connectivity
Cores
Cycles
Directed Acyclic Graphs
Distance Measures
Distance-Regular Graphs
Dominating Sets
Eulerian
Flows
Graphical degree sequence
Hierarchy
Isolates
Isomorphism
is_isomorphic
could_be_isomorphic
fast_could_be_isomorphic
faster_could_be_isomorphic
Advanced Interface to VF2 Algorithm
Link Analysis
Link Prediction
Matching
Maximal independent set
Minimum Spanning Tree
Operators
Rich Club
Shortest Paths
Simple Paths
Swap
Traversal
Tree
Vitality
Functions
Graph generators
Linear algebra
Converting to and from other data formats
Relabeling nodes
Reading and writing graphs
Drawing
Exceptions
Utilities
License
Citing
Credits
Glossary
Reference
Overview
Introduction
Graph types
Algorithms
Approximation
Assortativity
Bipartite
Blockmodeling
Boundary
Centrality
Chordal
Clique
Clustering
Communities
Components
Connectivity
Cores
Cycles
Directed Acyclic Graphs
Distance Measures
Distance-Regular Graphs
Dominating Sets
Eulerian
Flows
Graphical degree sequence
Hierarchy
Isolates
Isomorphism
Link Analysis
Link Prediction
Matching
Maximal independent set
Minimum Spanning Tree
Operators
Rich Club
Shortest Paths
Simple Paths
Swap
Traversal
Tree
Vitality
Functions
Graph generators
Linear algebra
Converting to and from other data formats
Reading and writing graphs
Drawing
Exceptions
Utilities
License
Citing
Credits
Glossary
Testing
Developer Guide
History
Bibliography
NetworkX Examples
NetworkX
Docs
»
Reference
»
Reference
»
Algorithms
»
Isomorphism
»
VF2 Algorithm
»
candidate_pairs_iter
candidate_pairs_iter
¶
GraphMatcher.
candidate_pairs_iter
(
)
¶
Iterator over candidate pairs of nodes in G1 and G2.