degrees(B, nodes, weight=None)
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 <networkx.algorithms.bipartite>
for further details on how bipartite graphs are handled in NetworkX.
Nodes in one node set of the bipartite graph.
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.
The degrees of the two bipartite sets as dictionaries keyed by node.
Returns the degrees of the two node sets in the bipartite graph B.
>>> from networkx.algorithms import bipartiteSee :
... 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 following pages refer to to this document either explicitly or contain code examples using this.
networkx.algorithms.bipartite.basic.degrees
Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.
Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)
SVG is more flexible but power hungry; and does not scale well to 50 + nodes.
All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them