This algorithm only accepts networks with undirected edges. It cannot work with directed edges.

This algorithm is mislabeled. It calculates the total edge degree degree(edge[s, t]) as a function of total node degree (degree(node[s]) * degree(node[t])), where:

Even though this algorithm calculates the total node degree internally, it does not annotate the output network with it. The output of this algorithm is the original network, but annotated with the calculated edge degree (edge) attribute, endpointdegree.

In addition to the annotated network, there are two other output files that this algorithm produces:


This algorithm was written by Duygu Balcan and integrated by Russell Duhon.