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. --sebastian 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 >
