NetworkX
1.11rc1
Overview
Download
Installing
Tutorial
Reference
Introduction
Graph types
Algorithms
Approximation
Assortativity
Bipartite
Blockmodeling
Boundary
Centrality
Chordal
Clique
Clustering
Coloring
Communities
Components
Connectivity
Cores
Cycles
Directed Acyclic Graphs
Distance Measures
Distance-Regular Graphs
Dominance
Dominating Sets
Eulerian
Flows
Graphical degree sequence
Hierarchy
Hybrid
Isolates
Isomorphism
Link Analysis
Link Prediction
Matching
Minors
Maximal independent set
Minimum Spanning Tree
Operators
complement
reverse
compose
union
disjoint_union
intersection
difference
symmetric_difference
compose_all
union_all
disjoint_union_all
intersection_all
cartesian_product
lexicographic_product
strong_product
tensor_product
power
Rich Club
Shortest Paths
Simple Paths
Swap
Traversal
Tree
Triads
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
Coloring
Communities
Components
Connectivity
Cores
Cycles
Directed Acyclic Graphs
Distance Measures
Distance-Regular Graphs
Dominance
Dominating Sets
Eulerian
Flows
Graphical degree sequence
Hierarchy
Hybrid
Isolates
Isomorphism
Link Analysis
Link Prediction
Matching
Minors
Maximal independent set
Minimum Spanning Tree
Operators
Rich Club
Shortest Paths
Simple Paths
Swap
Traversal
Tree
Triads
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
»
Algorithms
»
Operators
»
reverse
reverse
¶
reverse
(
G
,
copy=True
)
[source]
¶
Return the reverse directed graph of G.
Parameters:
G
(
directed graph
) – A NetworkX directed graph
copy
(
bool
) – If True, then a new graph is returned. If False, then the graph is reversed in place.
Returns:
H
– The reversed G.
Return type:
directed graph