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)
with_labels : bool, optional (default=False)
weighted : bool, optional (default=False)
|
---|---|
Returns: | nd : list, or dictionary
|
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}