NetworkX
latest
Overview
Download
Installing
Tutorial
Reference
Introduction
Graph types
Algorithms
Approximation
Assortativity
Bipartite
Boundary
Centrality
Chains
Chordal
Clique
Clustering
Coloring
Communicability
Communities
Components
Connectivity
Cores
Covering
Cycles
Cuts
Directed Acyclic Graphs
Dispersion
Distance Measures
Distance-Regular Graphs
Dominance
Dominating Sets
Efficiency
Eulerian
Flows
Graphical degree sequence
Hierarchy
Hybrid
Isolates
Isomorphism
Link Analysis
Link Prediction
Matching
Minors
Maximal independent set
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
Reciprocity
Rich Club
Shortest Paths
Simple Paths
Swap
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
Exceptions
Utilities
License
Citing
Credits
Glossary
Reference
Overview
Introduction
Graph types
Algorithms
Approximation
Assortativity
Bipartite
Boundary
Centrality
Chains
Chordal
Clique
Clustering
Coloring
Communicability
Communities
Components
Connectivity
Cores
Covering
Cycles
Cuts
Directed Acyclic Graphs
Dispersion
Distance Measures
Distance-Regular Graphs
Dominance
Dominating Sets
Efficiency
Eulerian
Flows
Graphical degree sequence
Hierarchy
Hybrid
Isolates
Isomorphism
Link Analysis
Link Prediction
Matching
Minors
Maximal independent set
Operators
Reciprocity
Rich Club
Shortest Paths
Simple Paths
Swap
Tournament
Traversal
Tree
Triads
Vitality
Voronoi cells
Wiener index
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
Edit on GitHub
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
Read the Docs
v: latest
Versions
latest
stable
Downloads
pdf
htmlzip
epub
On Read the Docs
Project Home
Builds
Free document hosting provided by
Read the Docs
.