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 <[email protected]>wrote: > 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 the message distance and > send current distance +1 to all the vertexes neighbors. > > That will give you the shortest path of every vertex to the source. You > can stop early if your computation knows the target distance. > > Sent from my phone using large fingers and a small keypad. > > > -----Original Message----- > *From:* yeshwanth kumar [[email protected]] > *Received:* Sunday, 20 Apr 2014, 10:57AM > *To:* [email protected] [[email protected]] > *Subject:* finding vertex at certain distance > > hi i am trying to find out vertices which are at equal distance from a > vertex. using giraph, > can someone suggest a good way to do it. > > Thanks. >
