Hi Prandeep,
unfortunately giraph is probably not the right tool to compute all pairs
shortest paths. Giraph is a good tool if you want to compute single source
shortest paths, following BFS. I do not know a good way to solve the all
pairs problem without a memory explosion (where every vertex keeps a map
with all the other N1 vertices). I hope I'm shortseeing, and there's a
solution to your problem.
On Tue, Feb 5, 2013 at 8:23 PM, pradeep kumar <pradeep0802@gmail.com> wrote:
> Hi all,
>
> Actually we are working on finding centrality for nodes in a graph
> (betweenness , closeness and inout) so far we have just implemented for
> inout and currently working on implementation of brandes alg for finding
> betweenness centrality which requires finding shortest path for each node
> to every node.
>
> Actually right now problem we are facing is passing allnodes list at
> beginning for computation of shortest paths.
>
> 1) Is their a method availabe to achieve this. we are using giraph
> 1.0..(we couldnt find method for support in file library)
>
> 2) Is it possible compute shortest path for node to every other in single
> superstep
>
> 3) or can we use master compute for such computation
>
> And is there any other way we can compute betweeness for nodes efficiently
> in giraph..
>
> Any suggestion..and..Thanks for help in advance..
>
> 
> Pradeep
>

Claudio Martella
claudio.martella@gmail.com
