public class PregelSSSP extends Object implements ProgramDescription
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
gather-sum-apply implementation see GSASingleSourceShortestPaths
.
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
Modifier and Type | Class and Description |
---|---|
static class |
PregelSSSP.SSSPCombiner
The messages combiner.
|
static class |
PregelSSSP.SSSPComputeFunction
The compute function for SSSP.
|
Constructor and Description |
---|
PregelSSSP() |
Modifier and Type | Method and Description |
---|---|
String |
getDescription()
Returns a description of the plan that is generated by the assembler and also of the
arguments if they are available.
|
static void |
main(String[] args) |
public String getDescription()
ProgramDescription
getDescription
in interface ProgramDescription
Copyright © 2014–2021 The Apache Software Foundation. All rights reserved.