https://github.com/nishantgandhi99/giraph/blob/master/Giraph/src/Success/VL.java
use this code.
Nishant Gandhi
M.Tech. CSE
IIT Patna
On Mon, Apr 21, 2014 at 12:48 AM, Schweiger, Tom wrote:
> That sounds like a breadth-first search.
>
> Start with all vertexes with a distance of MAX_INTEGER
>
That sounds like a breadth-first search.
Start with all vertexes with a distance of MAX_INTEGER
>From the starting vertex, set its distance to zero and send one to all
>neighbors. As vertexes get messages, if the message distance is less than the
>current distance, set the current distance to t
