Hi, Suppose, I want to compress a linear graph. That is, all vertices will be collapsed to a single one. Eg. If the input graph is like A-->B-->C-->D (4 vertices) then the output will be ABCD (Just one vertex merging the vertices in order).
On Tue, Dec 30, 2014 at 8:08 PM, Khaled Ammar <khaled.am...@gmail.com> wrote: > I don't think Giraph is suitable for this task because in this case you > probably want to visit graph vertices in order which leaves no chance for > parallelization. In fact, even running a shortest path query on such graph > will not perform as good as it would in web or social network graphs. > > These are my two cents. Happy new year :) > -Khaled > > On Tue, Dec 30, 2014 at 8:20 PM, Claudio Martella < > claudio.marte...@gmail.com> wrote: > >> i guess it depends on the traversal :) >> >> On Tue, Dec 30, 2014 at 11:11 PM, Arghya Kusum Das < >> arghyakusumdas2...@gmail.com> wrote: >> >>> Hi, >>> >>> I am trying to traverse a long list (a linear graph with millions of >>> nodes). Is it possible to take advantage of Giraph's parallel processing >>> for this issue? >>> >>> -- >>> Thanks and regards, >>> Arghya Kusum Das >>> (225-270-6163) >>> >> >> >> >> -- >> Claudio Martella >> >> > > > > -- > Thanks, > -Khaled > -- Thanks and regards, Arghya Kusum Das (225-270-6163)
