Hi Edward J. Yoon What I need is to calculate the shortest path to all vertices. In SSSP I have the shortest path starting from a vertex, I need the shortest path starting from all vertices. I thought in a breadth to calculate all the shortest paths. I've thought also in execuar the SSSP for each vertices but is not efficient.
2012/11/19 Edward J. Yoon <[email protected]> > I think you are searching for this: > > > https://svn.apache.org/repos/asf/hama/trunk/examples/src/main/java/org/apache/hama/examples/SSSP.java > > On Mon, Nov 19, 2012 at 11:02 PM, Francisco Sanches > <[email protected]> wrote: > > Hi, > > > > I wonder if anyone here on the list have already implemented the BFS in > > hama? and became, as it did? If you used the api Graphs of hama? where > > implemented within the compute? > > > > > > > > > > -- > > Francisco Sanches > > > > -- > Best Regards, Edward J. Yoon > @eddieyoon > -- Francisco Sanches
