NetworkX
latest
Overview
Download
Installing
Tutorial
Reference
Introduction
Graph types
Which graph class should I use?
Basic graph types
Graph – Undirected graphs with self loops
Methods
DiGraph - Directed graphs with self loops
Methods
MultiGraph - Undirected graphs with self loops and parallel edges
Methods
MultiDiGraph - Directed graphs with self loops and parallel edges
Methods
Algorithms
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
Which graph class should I use?
Basic graph types
Algorithms
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
»
Graph types
»
DiGraph - Directed graphs with self loops
»
predecessors
Edit on GitHub
predecessors
¶
DiGraph.
predecessors
(
n
)
[source]
¶
Return an iterator over predecessor nodes of n.
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
.