networkx 2.8.2 Pypi GitHub Homepage
Other Docs
ParametersRaisesBackRef
predecessors(self, n)

A predecessor of n is a node m such that there exists a directed edge from m to n.

Parameters

n : node

A node in the graph

Raises

NetworkXError

If n is not in the graph.

Returns an iterator over predecessor nodes of n.

See Also

successors

Examples

See :

Back References

The following pages refer to to this document either explicitly or contain code examples using this.

networkx.algorithms.flow.mincost.max_flow_min_cost networkx.classes.digraph.DiGraph.successors

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them


GitHub : /networkx/classes/digraph.py#822
type: <class 'function'>
Commit: