Package org.apache.spark.graphx.lib
Class ShortestPaths
Object
org.apache.spark.graphx.lib.ShortestPaths
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
Constructors - 
Method Summary
 
- 
Constructor Details
- 
ShortestPaths
public ShortestPaths() 
 - 
 - 
Method Details
- 
run
public static <VD,ED> Graph<scala.collection.Map<Object,Object>, runED> (Graph<VD, ED> graph, scala.collection.immutable.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 pathslandmarks- 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.
 
 
 -