Using graphx to calculate average distance of a big graph

[James]

Recently we want to use spark to calculate the average shortest path
distance between each reachable pair of nodes in a very big graph.

Is there any one ever try this? We hope to discuss about the problem.