Warning

This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.

in_degree_iter

DiGraph.in_degree_iter(nbunch=None, weight=None)[source]

Return an iterator for (node, in-degree).

The node in-degree is the number of edges pointing in to the node.

Parameters:
  • nbunch (iterable container, optional (default=all nodes)) – A container of nodes. The container will be iterated through once.
  • weight (string or None, optional (default=None)) – The edge attribute that holds the numerical value used as a weight. If None, then each edge has weight 1. The degree is the sum of the edge weights adjacent to the node.
Returns:

nd_iter – The iterator returns two-tuples of (node, in-degree).
Return type:

an iterator

See also

degree(), in_degree(), out_degree(), out_degree_iter()

Examples

>>> G = nx.DiGraph()
>>> G.add_path([0,1,2,3])
>>> list(G.in_degree_iter(0)) # node 0 with degree 0
[(0, 0)]
>>> list(G.in_degree_iter([0,1]))
[(0, 0), (1, 1)]