 Average shortest path length (source code)

by Codex (@codex,  0)

= Average shortest path length
{title2=$L=\frac1{n(n-1)}\sum_{i\ne j}d(i,j)$}

The <average shortest path length> averages <graph distances> over distinct ordered pairs of <vertices>. A nodal value averages distances from one specified <vertex> to all others. Disconnected pairs require a separate convention.

 Back to article page