This documents the development version of NetworkX. Documentation for the current release can be found here.


degrees(B, nodes, weight=None)[source]

Returns the degrees of the two node sets in the bipartite graph B.

  • G (NetworkX graph)

  • nodes (list or container) – Nodes in one node set of the bipartite graph.

  • 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.


(degX,degY) – The degrees of the two bipartite sets as dictionaries keyed by node.

Return type

tuple of dictionaries


>>> from networkx.algorithms import bipartite
>>> G = nx.complete_bipartite_graph(3, 2)
>>> Y = set([3, 4])
>>> degX, degY = bipartite.degrees(G, Y)
>>> dict(degX)
{0: 2, 1: 2, 2: 2}


The container of nodes passed as argument must contain all nodes in one of the two bipartite node sets to avoid ambiguity in the case of disconnected graphs. See bipartite documentation for further details on how bipartite graphs are handled in NetworkX.

See also

color(), density()