Package org.apache.spark.graphx.lib

Class ConnectedComponents

Object
org.apache.spark.graphx.lib.ConnectedComponents
public class ConnectedComponents extends Object
Connected components algorithm.

  • Constructor Summary

    Constructors
    Constructor
    Description
    ConnectedComponents()
     

  • Method Summary

    Modifier and Type
    Method
    Description
    static <VD, ED> Graph<Object,ED>
    run(Graph<VD,ED> graph, int maxIterations, scala.reflect.ClassTag<VD> evidence$1, scala.reflect.ClassTag<ED> evidence$2)
    Compute the connected component membership of each vertex and return a graph with the vertex value containing the lowest vertex id in the connected component containing that vertex.
    static <VD, ED> Graph<Object,ED>
    run(Graph<VD,ED> graph, scala.reflect.ClassTag<VD> evidence$3, scala.reflect.ClassTag<ED> evidence$4)
    Compute the connected component membership of each vertex and return a graph with the vertex value containing the lowest vertex id in the connected component containing that vertex.

    Methods inherited from class java.lang.Object

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

  • Constructor Details

    • ConnectedComponents

      public ConnectedComponents()

  • Method Details

    • run

      public static <VD, ED> Graph<Object,ED> run(Graph<VD,ED> graph, int maxIterations, scala.reflect.ClassTag<VD> evidence$1, scala.reflect.ClassTag<ED> evidence$2)
      Compute the connected component membership of each vertex and return a graph with the vertex value containing the lowest vertex id in the connected component containing that vertex.

      Parameters:
      graph - the graph for which to compute the connected components
      maxIterations - the maximum number of iterations to run for
      evidence$1 - (undocumented)
      evidence$2 - (undocumented)
      Returns:
      a graph with vertex attributes containing the smallest vertex in each connected component

    • run

      public static <VD, ED> Graph<Object,ED> run(Graph<VD,ED> graph, scala.reflect.ClassTag<VD> evidence$3, scala.reflect.ClassTag<ED> evidence$4)
      Compute the connected component membership of each vertex and return a graph with the vertex value containing the lowest vertex id in the connected component containing that vertex.

      Parameters:
      graph - the graph for which to compute the connected components
      evidence$3 - (undocumented)
      evidence$4 - (undocumented)
      Returns:
      a graph with vertex attributes containing the smallest vertex in each connected component