MultiDiGraph.predecessors#
- MultiDiGraph.predecessors(n)#
Returns an iterator over predecessor nodes of n.
A predecessor of n is a node m such that there exists a directed edge from m to n.
- Parameters:
- nnode
A node in the graph
- Raises:
- NetworkXError
If n is not in the graph.
See also