org.apache.flink.graph.examples

Class PregelSSSP

java.lang.Object

org.apache.flink.graph.examples.PregelSSSP

All Implemented Interfaces:

org.apache.flink.api.common.ProgramDescription

public class PregelSSSP
extends Object
implements org.apache.flink.api.common.ProgramDescription

This example shows how to use Gelly's Vertex-Centric 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 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

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	PregelSSSP.SSSPCombiner The messages combiner.
static class	PregelSSSP.SSSPComputeFunction The compute function for SSSP

Constructor Summary

Constructors

Constructor and Description
PregelSSSP()

Method Summary

Modifier and Type	Method and Description
String	getDescription()
static void	main(String[] args)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Detail

PregelSSSP

public PregelSSSP()

Method Detail

main

public static void main(String[] args)
                 throws Exception

Throws:

Exception

getDescription

public String getDescription()

Specified by:

getDescription in interface org.apache.flink.api.common.ProgramDescription