This example shows how to use Gelly's Gather-Sum-Apply iterations.
It is an implementation of the Single-Source-Shortest-Paths algorithm.
For a scatter-gather implementation of the same algorithm, please refer to
SingleSourceShortestPaths
and for a vertex-centric implementation, see
PregelSSSP.
The input file is a plain text file and must be formatted as follows:
Edges are represented by tuples of srcVertexId, trgVertexId, distance which are
separated by tabs. Edges themselves are separated by newlines.
For example:
1\t2\t0.1\n1\t3\t1.4\n defines two edges,
edge 1-2 with distance 0.1, and edge 1-3 with distance 1.4.
If no parameters are provided, the program is run with default data from
SingleSourceShortestPathsData