Re: Breadth First Search (BFS)

2014-04-13 Thread ghufran malik
Hi, I have managed to implement it correctly after re-thinking my approach. The video described it in an asynchronous algorithm which, as you pointed out is not a distributed. I followed the BFS algorithm written in this paper: http://www.cc.gatech.edu/~bader/papers/GraphBSPonXMT-MTAAP2013.pdf. an

Re: Breadth First Search (BFS)

2014-04-07 Thread Lukas Nalezenec
Hi, I dont know what problem do you exactly solve and I have never written distributed BFS but I think that sharing queue using agreggator wont scale for larger graphs. The algorithm in video is basic its not distributed version. Lukas On 3.4.2014 15:13, ghufran malik wrote: Hi, Lukas, I be

Re: Breadth First Search (BFS)

2014-04-03 Thread ghufran malik
Also as to my original question I understand that I need to register an agg to a master class to store a persistent list. On Thu, Apr 3, 2014 at 2:13 PM, ghufran malik wrote: > Hi, > > Lukas, I believe the queue list is essential to the BFS algorithm I am > trying? I am following this explanatio

Re: Breadth First Search (BFS)

2014-04-03 Thread ghufran malik
Hi, Lukas, I believe the queue list is essential to the BFS algorithm I am trying? I am following this explanation given here: https://www.youtube.com/watch?v=zLZhSSXAwxI So for my output I want to have the vertex id followed by the number representing the order in which it was visited so vertex

Re: Breadth First Search (BFS)

2014-04-03 Thread nishant gandhi
Check this out for BFS.. http://stackoverflow.com/questions/12253794/breadth-first-implentation-in-giraph-graphchi-or-pregel Nishant Gandhi M.Tech CSE IIT Patna On Thu, Apr 3, 2014 at 3:18 PM, Lukas Nalezenec < lukas.naleze...@firma.seznam.cz> wrote: > Hi, > It looks like you are using wrong

Re: Breadth First Search (BFS)

2014-04-03 Thread Lukas Nalezenec
Hi, It looks like you are using wrong algorithm. If you are doing simple BFS you should not need to remember vertex ids. Lukas Lukas On 2.4.2014 20:30, ghufran malik wrote: Hi I am trying to implement the BFS algorithm using Giraph 1.1.0. I have partly implemented it and am stuck on just o

Breadth First Search (BFS)

2014-04-02 Thread ghufran malik
Hi I am trying to implement the BFS algorithm using Giraph 1.1.0. I have partly implemented it and am stuck on just one part. I have a list of vertex ids and I want these ids to be seen in the next superstep. Is it possible for me to just have the list in my BasicComputations class or do I need t