Hi, that was a simple heuristic. It is now fixed in trunk by using two supersteps that exchange the number of vertices.
2012/9/21 wang fangfang <[email protected]> > hi > There is a guestion when I study the code of pagerank in hama > example.there is a line:" > *numberVertices = vertices.size() * peer.getNumPeers();"* in > GraphJobRunner.java file. > However it‘s impossible to averagely partition the vertex so beautifully. > I want to know what's the consideration when taking this decision. > Thank you very much. > Best wishes >
