Not without hacking through the graph module unfortunately. 2012/10/9 Francisco Sanches <[email protected]>
> Hi, > > Yes SSSP only source. But what I'm studying is about the centrality of > large graphs. Finding the shortest path and I walk graph and thus can find > the radius and eccentricity of the graph. > > In this graph > #1 2;3;4 1 --- 2 > #2 1;5 | \ \ > #3 1;4 | \ \ > #4 1;3;5;6 3---4----5 8 > #5 2;4;6 | / / > #6 4;5;7 | / / > #7 6;8 6----7 > #8 7 > > Considering only the vertex 1 we have: > > * V1 to v2 = 1 > * V1 to v3 = 1 > * V1 to v4 = 1 > * V1 to v5 = 2 > * V1 to v6 = 2 > * V7 to v1 = 3 > * V1 to v8 = 4 > > eccentricity = 4 > radius = 1 > > With the example SSSP.java can do that for a vertex. Now I need to > calculate this for all vertices. I've been thinking that there should be > some way to read the txt file with the graph only once and trigger the > program to all vertices using just a job. Is that possible? > > > > 2012/10/9 Thomas Jungblut <[email protected]> > > > 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 > > > > > > > > > -- > Francisco Sanches >
