spark-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Ankur Dave <>
Subject Re: Using graphx to calculate average distance of a big graph
Date Tue, 06 Jan 2015 18:18:56 GMT

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 and then take
the average distance (

Ankur <>

On Sun, Jan 4, 2015 at 6:28 PM, James <> 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.

View raw message