networkx.Graph.degree

Graph.degree(nbunch=None, with_labels=False, weighted=False)

Return the degree of a node or nodes.

The node degree is the number of edges adjacent to that node.

Parameters:

nbunch : iterable container, optional (default=all nodes)

A container of nodes. The container will be iterated through once.

with_labels : bool, optional (default=False)

If True return a dictionary of degrees keyed by node.

weighted : bool, optional (default=False)

If True return the sum of edge weights adjacent to the node.

Returns:

nd : list, or dictionary

A list of node degrees or a dictionary with nodes as keys and degree as values if with_labels=True).

Examples

>>> G = nx.Graph()   # or DiGraph, MultiGraph, MultiDiGraph, etc
>>> G.add_path([0,1,2,3])
>>> G.degree(0)
1
>>> G.degree([0,1])
[1, 2]
>>> G.degree([0,1],with_labels=True)
{0: 1, 1: 2}