Networkx API

Table of Contents

1. Introduction
- 1.1. NetworkX Basics
  - 1.1.1. Graphs
- 1.2. Nodes and Edges
2. Tutorial
3. Graph types
4. Functions
5. Graph generators
6. Linear algebra
7. Algorithms (A-C)
8. Algorithms (D-L)
9. Algorithms (M-Z)
10. Converting to and from other data formats
11. Relabeling nodes
- 11.1. Relabeling
  - 11.1.1. networkx.relabel.convert_node_labels_to_integers
  - 11.1.2. networkx.relabel.relabel_nodes
12. Drawing
13. Utilities
14. Reading and writing graphs
15. Exceptions

Auto-generated API

networkx
- NetworkX
networkx.algorithms
- Functions
- Exceptions
  - networkx.algorithms.NetworkXTreewidthBoundExceeded
networkx.classes
- Functions
- Classes
networkx.drawing
- Functions
networkx.external
networkx.generators
- Functions
networkx.linalg
- Functions
networkx.readwrite
- Functions
- Classes
  - networkx.readwrite.GraphMLReader
    - Methods
    - Attributes
  - networkx.readwrite.GraphMLWriter
    - Methods
    - Attributes
networkx.testing
- Functions
networkx.tests
networkx.utils
- Functions
- Classes

Networkx API

Docs »
3. Graph types »
3.3. DiGraph - Directed graphs with self loops »
3.3.3.10. networkx.DiGraph.predecessors
View page source

3.3.3.10. networkx.DiGraph.predecessors¶

DiGraph.predecessors(n)[source]¶: Return an iterator over predecessor nodes of n.

Next Previous

© Copyright 2016.

Built with Sphinx using a theme provided by Read the Docs.