...

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

Wiki MarkupThis 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:

- Wiki Markup_
*degree(edge*\*[s,**t*\*])*_ = _*degree(node*\*[s*\*])*_ \ * _*degree(node*\*[t*\*])*_ - Wiki Markup_
*degree(node*\*[s*\*])*_ = total degree of _*node*\*[s*\*]*_ = number of edges _*node*\*[s*\*]*_ is connected to Wiki Markup_ *degree(node*\*[t*\*])*_ = total degree of _*node*\*[t*\*]*_ = number of edges _*node*\*[t*\*]*_ is connected to

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*.

...