Evaluate geodesic distance (shortest path) between all pairs of nodes in the network.
dst(M)
M
Input adjacency matrix
Matrix containing all the pairwise geodesic distances
dst(example_adjacency_matrix)