Package org.apache.spark.graphx.lib
Class StronglyConnectedComponents
Object
org.apache.spark.graphx.lib.StronglyConnectedComponents
Strongly connected components algorithm implementation.
- 
Constructor SummaryConstructors
- 
Method SummaryModifier and TypeMethodDescriptionrun(Graph<VD, ED> graph, int numIter, scala.reflect.ClassTag<VD> evidence$1, scala.reflect.ClassTag<ED> evidence$2) Compute the strongly connected component (SCC) of each vertex and return a graph with the vertex value containing the lowest vertex id in the SCC containing that vertex.
- 
Constructor Details- 
StronglyConnectedComponentspublic StronglyConnectedComponents()
 
- 
- 
Method Details- 
runpublic static <VD,ED> Graph<Object,ED> run(Graph<VD, ED> graph, int numIter, scala.reflect.ClassTag<VD> evidence$1, scala.reflect.ClassTag<ED> evidence$2) Compute the strongly connected component (SCC) of each vertex and return a graph with the vertex value containing the lowest vertex id in the SCC containing that vertex.- Parameters:
- graph- the graph for which to compute the SCC
- numIter- (undocumented)
- evidence$1- (undocumented)
- evidence$2- (undocumented)
- Returns:
- a graph with vertex attributes containing the smallest vertex id in each SCC
 
 
-