org.apache.spark.graphx.lib
Class ShortestPaths

Object
  org.apache.spark.graphx.lib.ShortestPaths

public class ShortestPaths
extends Object

Computes shortest paths to the given set of landmark vertices, returning a graph where each vertex attribute is a map containing the shortest-path distance to each reachable landmark.

Constructor Summary

ShortestPaths()

Method Summary

static <VD,ED> Graph<scala.collection.immutable.Map<Object,Object>,ED>

run(Graph<VD,ED> graph, scala.collection.Seq<Object> landmarks, scala.reflect.ClassTag<ED> evidence$1) Computes shortest paths to the given set of landmark vertices.

Methods inherited from class Object

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

Constructor Detail

ShortestPaths

public ShortestPaths()

Method Detail

run

public static <VD,ED> Graph<scala.collection.immutable.Map<Object,Object>,ED> run(Graph<VD,ED> graph,
                                                                                  scala.collection.Seq<Object> landmarks,
                                                                                  scala.reflect.ClassTag<ED> evidence$1)

Computes shortest paths to the given set of landmark vertices.

Parameters:

graph - the graph for which to compute the shortest paths

landmarks - the list of landmark vertex ids. Shortest paths will be computed to each landmark.

evidence$1 - (undocumented)

Returns:

a graph where each vertex attribute is a map containing the shortest-path distance to each reachable landmark vertex.