This algorithm only accepts networks with undirected edges. It cannot wo= rk with directed edges. This algorithm also treats unweighted networks as n= etworks whose edge weights are all 1.

=20For each node *node[i]*, this algorithm calculates the total node=
degree (*degree(node[i])*) and the total node strength (*strengt=
h(node[i])*), where:

- =20
*degree(node[i])*=3D total degree of*node[i]*=3D numbe= r of edges*node[i]*is connected to =20
*strength(node[i])*=3D the sum of the weights of all of the edg= es*node[i]*is connected to =20

Given the nature of the node strength, if the input network is unweighte= d, the node degree will always equal the node strength for all nodes.

= =20This algorithm outputs a version of the input network, annotated with th=
e *degree* and *strength* node attributes.

- =20
- Node Degree =20
- Source Code =20

This algorithm was written by Duygu Balcan and integrated by Russell Duh= on.