[-dev] What size of graph are you hoping to run this on? For small graphs where materializing the all-pairs shortest path is an option, you could simply find the APSP using https://github.com/apache/spark/pull/3619 and then take the average distance (apsp.map(_._2.toDouble).mean).
Ankur <http://www.ankurdave.com/> On Sun, Jan 4, 2015 at 6:28 PM, James <[email protected]> wrote: > 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. >
