incubator-hama-dev mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From "Edward J. Yoon" <>
Subject Refactor o.a.hama.examples.graph package
Date Tue, 28 Jun 2011 08:58:05 GMT

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

View raw message