Object

ml.sparkling.graph.operators.partitioning

PropagationBasedPartitioning

Related Doc: package partitioning

Permalink

object PropagationBasedPartitioning

Created by Roman Bartusiak (roman.bartusiak@pwr.edu.pl http://riomus.github.io). First approach to community based graph partitioning. It is not efficient due to need of gathering vertex to component id on driver node.

Linear Supertypes
AnyRef, Any
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. PropagationBasedPartitioning
  2. AnyRef
  3. Any
  1. Hide All
  2. Show all
Visibility
  1. Public
  2. All

Type Members

  1. trait VertexOperator extends Serializable

    Permalink

Value Members

  1. final def !=(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  2. final def ##(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  3. final def ==(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  4. object DefaultPartitionOperator extends VertexOperator

    Permalink

  5. object DefaultVertexOperator extends VertexOperator

    Permalink

  6. final def asInstanceOf[T0]: T0

    Permalink
    Definition Classes
    Any

  7. def buildPartitioningStrategy[ED, VD](graph: Graph[VD, ED], numParts: Int, checkpointingFrequency: Int, vertexOperator: VertexOperator)(implicit arg0: ClassTag[ED], arg1: ClassTag[VD], sc: SparkContext): (Map[VertexId, Int], Int, ByComponentIdPartitionStrategy)

    Permalink

  8. def clone(): AnyRef

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  9. final def eq(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  10. def equals(arg0: Any): Boolean

    Permalink
    Definition Classes
    AnyRef → Any

  11. def finalize(): Unit

    Permalink
    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )

  12. final def getClass(): Class[_]

    Permalink
    Definition Classes
    AnyRef → Any

  13. def hashCode(): Int

    Permalink
    Definition Classes
    AnyRef → Any

  14. final def isInstanceOf[T0]: Boolean

    Permalink
    Definition Classes
    Any

  15. val logger: Logger

    Permalink

  16. final def ne(arg0: AnyRef): Boolean

    Permalink
    Definition Classes
    AnyRef

  17. final def notify(): Unit

    Permalink
    Definition Classes
    AnyRef

  18. final def notifyAll(): Unit

    Permalink
    Definition Classes
    AnyRef

  19. def partitionGraphBy[VD, ED](graph: Graph[VD, ED], numParts: Int = 1, checkpointingFrequency: Int = 50, vertexOperator: VertexOperator = DefaultVertexOperator, partitionOperator: VertexOperator = DefaultPartitionOperator)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], sc: SparkContext): Graph[VD, ED]

    Permalink

  20. def precomputePartitions[VD, ED](graph: Graph[VD, ED], numParts: Int, checkpointingFrequency: Int = 50, vertexOperator: VertexOperator)(implicit arg0: ClassTag[VD], arg1: ClassTag[ED], sc: SparkContext): (Map[VertexId, Int], Int)

    Permalink

  21. final def synchronized[T0](arg0: ⇒ T0): T0

    Permalink
    Definition Classes
    AnyRef

  22. def toString(): String

    Permalink
    Definition Classes
    AnyRef → Any

  23. final def wait(): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  24. final def wait(arg0: Long, arg1: Int): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

  25. final def wait(arg0: Long): Unit

    Permalink
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )

Inherited from AnyRef

Inherited from Any

Ungrouped