Warning
This documents an unmaintained version of NetworkX. Please upgrade to a maintained version and see the current NetworkX documentation.
degree¶
- Graph.degree(nbunch=None, weight=None)¶
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.
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 degree as values or a number if a single node is specified.
Examples
>>> G = nx.Graph() # or DiGraph, MultiGraph, MultiDiGraph, etc >>> G.add_path([0,1,2,3]) >>> G.degree(0) 1 >>> G.degree([0,1]) {0: 1, 1: 2} >>> list(G.degree([0,1]).values()) [1, 2]