in_degree¶

DiGraph.in_degree(nbunch=None, weight=None)¶

Return the in-degree of a node or nodes.

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 : dictionary, or number A dictionary with nodes as keys and in-degree as values or a number if a single node is specified.

See also

degree, out_degree, in_degree_iter

Examples

>>> G = nx.DiGraph()   # or MultiDiGraph
>>> G.add_path([0,1,2,3])
>>> G.in_degree(0)
0
>>> G.in_degree([0,1])
{0: 0, 1: 1}
>>> list(G.in_degree([0,1]).values())
[0, 1]