hama-user mailing list archives

Site index · List index
Message view « Date » · « Thread »
Top « Date » · « Thread »
From Thomas Jungblut <thomas.jungb...@gmail.com>
Subject Re: SSSP all vertices
Date Tue, 09 Oct 2012 13:29:12 GMT
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 <sanchesbanhos@gmail.com>

> 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
>

Mime
  • Unnamed multipart/alternative (inline, None, 0 bytes)
View raw message