Average shortest path length ($L=\frac{1}{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.