Hi, I think, the code quantity of Dijkstra's shortest path and PageRank can be dramatically reduced by adding Google's Pregel APIs e.g., compute(List<BSPMessage> msgs), getVertexID(), .. and APIs can be moved in o.a.hama.graph package.
Does anyone volunteer here? -- Best Regards, Edward J. Yoon @eddieyoon
