Packages

o

org.apache.spark.graphx.PartitionStrategy

CanonicalRandomVertexCut

case object CanonicalRandomVertexCut extends PartitionStrategy with Product with Serializable

Assigns edges to partitions by hashing the source and destination vertex IDs in a canonical direction, resulting in a random vertex cut that colocates all edges between two vertices, regardless of direction.

Source
PartitionStrategy.scala
Linear Supertypes
Product, Equals, PartitionStrategy, Serializable, AnyRef, Any
Ordering
  1. Alphabetic
  2. By Inheritance
Inherited
  1. CanonicalRandomVertexCut
  2. Product
  3. Equals
  4. PartitionStrategy
  5. Serializable
  6. AnyRef
  7. Any
  1. Hide All
  2. Show All
Visibility
  1. Public
  2. Protected

Value Members

  1. def getPartition(src: VertexId, dst: VertexId, numParts: PartitionID): PartitionID

    Returns the partition number for a given edge.

    Returns the partition number for a given edge.

    Definition Classes
    CanonicalRandomVertexCutPartitionStrategy
  2. def productElementName(n: Int): String
    Definition Classes
    Product
  3. def productElementNames: Iterator[String]
    Definition Classes
    Product