3.4.4.7. networkx.MultiGraph.degree¶

MultiGraph.degree(nbunch=None, weight=None)[source]¶

Return an iterator for (node, degree) or degree for single node.

The node degree is the number of edges adjacent to the node. This function returns the degree for a single node or an iterator for a bunch of nodes or if nothing is passed as argument.

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:	If a single node is requested deg : int Degree of the node, if a single node is passed as argument. OR if multiple nodes are requested nd_iter : iterator The iterator returns two-tuples of (node, degree).

Examples

>>> G = nx.Graph()   # or DiGraph, MultiGraph, MultiDiGraph, etc
>>> nx.add_path(G, [0, 1, 2, 3])
>>> G.degree(0) # node 0 with degree 1
1
>>> list(G.degree([0,1]))
[(0, 1), (1, 2)]