Hey, the vertex-centric paradigm is implicitly doing a breadth first search in parallel (when you're iterating the neighbours and then message them). So it is actually implicitly traversing all the vertices in your graph. You can't break it down to the groom level, because you don't know what task is scheduled to what server. Or are you confusing a groom with a task/peer?
And just for future queries, please use the mailing list since this is an open source project and people with the same question will be likely less helped in my inbox ;) 2012/11/9 Du Zhengjun <[email protected]> > Dear Thomas, > Recently, I am plan to develop some algorithms on hama, in some of its > steps, I want to traverse all the vertexes of the graph and traverse all > the vertexes in a groom server, is there a way to do this in hama? > > Thanks a lot~ > > Best wishes for you, enjoy your life~ > >
