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

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

BNetworkX graph
nodes: list or container

Nodes in one node set of the bipartite graph.

weightstring 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)tuple of dictionaries

The degrees of the two bipartite sets as dictionaries keyed by node.

See also

color, density


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.


>>> 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}