giraph-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Sebastian Schelter <>
Subject Re: About Giraph Design
Date Mon, 28 Oct 2013 12:40:52 GMT
Hi Jyoti,

All-Pairs-Shortest-Path is a problem with a solution quadratic in the
number of vertices of the input graph. For a reasonably large graph, you
cannot even store the result.

For most algorithms that map well to systems like Giraph the amount of
messages per iteration is linear in the number of edges of the graph and
the number of iterations necessary is small by default or bound by the
diameter of the graph.


On 28.10.2013 05:09, Jyoti Yadav wrote:
> Hi..
> one doubt is disturbing me..Would anyone suggest an idea?
> Is GIRAPH is designed for solving problems like AllPairShortestPath ?
> Thanks in advance.
> Jyoti

View raw message