You know, SSSP = SINGLE source shortest path. So either start a job for each vertex, or code an equivalent BSP.
2012/10/9 Francisco Sanches <[email protected]> > Hi, > > How to pass the program SSSP.java present in samples to calculate the > shortest path to all vertices. Thus calculate the shortest path starting > from all vertices, this calculation will be necessary because I want to > calculate the radius and diameter of the graph. > > -- > Francisco Sanches >
