org.apache.flink.graph.library

Class SingleSourceShortestPaths<K,VV>

java.lang.Object

org.apache.flink.graph.library.SingleSourceShortestPaths<K,VV>

All Implemented Interfaces:

GraphAlgorithm<K,VV,Double,DataSet<Vertex<K,Double>>>

public class SingleSourceShortestPaths<K,VV>
extends Object
implements GraphAlgorithm<K,VV,Double,DataSet<Vertex<K,Double>>>

This is an implementation of the Single-Source-Shortest Paths algorithm, using a scatter-gather iteration.

Nested Class Summary

Nested Classes

Modifier and Type	Class and Description
static class	SingleSourceShortestPaths.MinDistanceMessenger<K> Distributes the minimum distance associated with a given vertex among all the target vertices summed up with the edge's value.
static class	SingleSourceShortestPaths.VertexDistanceUpdater<K> Function that updates the value of a vertex by picking the minimum distance from all incoming messages.

Constructor Summary

Constructors

Constructor and Description
SingleSourceShortestPaths(K srcVertexId, Integer maxIterations) Creates an instance of the SingleSourceShortestPaths algorithm.

Method Summary

Modifier and Type	Method and Description
DataSet<Vertex<K,Double>>	run(Graph<K,VV,Double> input)

Methods inherited from class java.lang.Object

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

Constructor Detail

SingleSourceShortestPaths

public SingleSourceShortestPaths(K srcVertexId,
                                 Integer maxIterations)

Creates an instance of the SingleSourceShortestPaths algorithm.

Parameters:

srcVertexId - The ID of the source vertex.

maxIterations - The maximum number of iterations to run.

Method Detail

run

public DataSet<Vertex<K,Double>> run(Graph<K,VV,Double> input)

Specified by:

run in interface GraphAlgorithm<K,VV,Double,DataSet<Vertex<K,Double>>>