NetworkX
2.1
Install
Tutorial
Reference
Introduction
Graph types
Which graph class should I use?
Basic graph types
Graph—Undirected graphs with self loops
DiGraph—Directed graphs with self loops
MultiGraph—Undirected graphs with self loops and parallel edges
MultiDiGraph—Directed graphs with self loops and parallel edges
Ordered Graphs—Consistently ordered graphs
Algorithms
Functions
Graph generators
Linear algebra
Converting to and from other data formats
Relabeling nodes
Reading and writing graphs
Drawing
Exceptions
Utilities
Glossary
Developer Guide
Release Log
License
Credits
Citing
Bibliography
Examples
NetworkX
Docs
»
Reference
»
Graph types
»
DiGraph—Directed graphs with self loops
»
networkx.DiGraph.predecessors
networkx.DiGraph.predecessors
¶
DiGraph.
predecessors
(
n
)
[source]
¶
Return an iterator over predecessor nodes of n.