NETWORKX Study Notes

When writing a program that examines the matching characteristics of a network, it involves the concept of the strength of the node (the weight and the edge of the node) before it is clear that nx.degree () has such a powerful function.

Directly on the example:

Import Networkx as NX
G=nx. Graph ()
G.add_edge (Weight=1)
G.add_edge (1,3, weight=2)
G.add_edge (1,4, weight=3)
G.add_edge (1,5, weight=4)

To construct such a network,

G.degree (1) Gets the degree of Node 1, which is 4

G.degree (1,weight= ' weight ') is able to obtain the strength of Node 1.

NETWORKX Study Notes