org.apache.spark.graphx

VertexRDD

abstract class VertexRDD[VD] extends RDD[(VertexId, VD)]

Extends RDD[(VertexId, VD)] by ensuring that there is only one entry for each vertex and by pre-indexing the entries for fast, efficient joins. Two VertexRDDs with the same index can be joined efficiently. All operations except reindex preserve the index. To construct a VertexRDD, use the VertexRDD object.

Additionally, stores routing information to enable joining the vertex attributes with an EdgeRDD.

VD

the vertex attribute associated with each vertex in the set.

Example:
  1. Construct a VertexRDD from a plain RDD:

    // Construct an initial vertex set
    val someData: RDD[(VertexId, SomeType)] = loadData(someFile)
    val vset = VertexRDD(someData)
    // If there were redundant values in someData we would use a reduceFunc
    val vset2 = VertexRDD(someData, reduceFunc)
    // Finally we can use the VertexRDD to index another dataset
    val otherData: RDD[(VertexId, OtherType)] = loadData(otherFile)
    val vset3 = vset2.innerJoin(otherData) { (vid, a, b) => b }
    // Now we can construct very fast joins between the two sets
    val vset4: VertexRDD[(SomeType, OtherType)] = vset.leftJoin(vset3)
Linear Supertypes
RDD[(VertexId, VD)], Logging, Serializable, Serializable, AnyRef, Any
Known Subclasses
Ordering
  1. Alphabetic
  2. By inheritance
Inherited
  1. VertexRDD
  2. RDD
  3. Logging
  4. Serializable
  5. Serializable
  6. AnyRef
  7. Any
  1. Hide All
  2. Show all
Learn more about member selection
Visibility
  1. Public
  2. All

Instance Constructors

  1. new VertexRDD(sc: SparkContext, deps: Seq[Dependency[_]])

Abstract Value Members

  1. abstract def aggregateUsingIndex[VD2](messages: RDD[(VertexId, VD2)], reduceFunc: (VD2, VD2) ⇒ VD2)(implicit arg0: ClassTag[VD2]): VertexRDD[VD2]

    Aggregates vertices in messages that have the same ids using reduceFunc, returning a VertexRDD co-indexed with this.

    Aggregates vertices in messages that have the same ids using reduceFunc, returning a VertexRDD co-indexed with this.

    messages

    an RDD containing messages to aggregate, where each message is a pair of its target vertex ID and the message data

    reduceFunc

    the associative aggregation function for merging messages to the same vertex

    returns

    a VertexRDD co-indexed with this, containing only vertices that received messages. For those vertices, their values are the result of applying reduceFunc to all received messages.

  2. abstract def diff(other: VertexRDD[VD]): VertexRDD[VD]

    For each vertex present in both this and other, diff returns only those vertices with differing values; for values that are different, keeps the values from other.

    For each vertex present in both this and other, diff returns only those vertices with differing values; for values that are different, keeps the values from other. This is only guaranteed to work if the VertexRDDs share a common ancestor.

    other

    the other VertexRDD with which to diff against.

  3. abstract def diff(other: RDD[(VertexId, VD)]): VertexRDD[VD]

    For each vertex present in both this and other, diff returns only those vertices with differing values; for values that are different, keeps the values from other.

    For each vertex present in both this and other, diff returns only those vertices with differing values; for values that are different, keeps the values from other. This is only guaranteed to work if the VertexRDDs share a common ancestor.

    other

    the other RDD[(VertexId, VD)] with which to diff against.

  4. abstract def innerJoin[U, VD2](other: RDD[(VertexId, U)])(f: (VertexId, VD, U) ⇒ VD2)(implicit arg0: ClassTag[U], arg1: ClassTag[VD2]): VertexRDD[VD2]

    Inner joins this VertexRDD with an RDD containing vertex attribute pairs.

    Inner joins this VertexRDD with an RDD containing vertex attribute pairs. If the other RDD is backed by a VertexRDD with the same index then the efficient innerZipJoin implementation is used.

    other

    an RDD containing vertices to join. If there are multiple entries for the same vertex, one is picked arbitrarily. Use aggregateUsingIndex to merge multiple entries.

    f

    the join function applied to corresponding values of this and other

    returns

    a VertexRDD co-indexed with this, containing only vertices that appear in both this and other, with values supplied by f

  5. abstract def innerZipJoin[U, VD2](other: VertexRDD[U])(f: (VertexId, VD, U) ⇒ VD2)(implicit arg0: ClassTag[U], arg1: ClassTag[VD2]): VertexRDD[VD2]

    Efficiently inner joins this VertexRDD with another VertexRDD sharing the same index.

    Efficiently inner joins this VertexRDD with another VertexRDD sharing the same index. See innerJoin for the behavior of the join.

  6. abstract def leftJoin[VD2, VD3](other: RDD[(VertexId, VD2)])(f: (VertexId, VD, Option[VD2]) ⇒ VD3)(implicit arg0: ClassTag[VD2], arg1: ClassTag[VD3]): VertexRDD[VD3]

    Left joins this VertexRDD with an RDD containing vertex attribute pairs.

    Left joins this VertexRDD with an RDD containing vertex attribute pairs. If the other RDD is backed by a VertexRDD with the same index then the efficient leftZipJoin implementation is used. The resulting VertexRDD contains an entry for each vertex in this. If other is missing any vertex in this VertexRDD, f is passed None. If there are duplicates, the vertex is picked arbitrarily.

    VD2

    the attribute type of the other VertexRDD

    VD3

    the attribute type of the resulting VertexRDD

    other

    the other VertexRDD with which to join

    f

    the function mapping a vertex id and its attributes in this and the other vertex set to a new vertex attribute.

    returns

    a VertexRDD containing all the vertices in this VertexRDD with the attributes emitted by f.

  7. abstract def leftZipJoin[VD2, VD3](other: VertexRDD[VD2])(f: (VertexId, VD, Option[VD2]) ⇒ VD3)(implicit arg0: ClassTag[VD2], arg1: ClassTag[VD3]): VertexRDD[VD3]

    Left joins this RDD with another VertexRDD with the same index.

    Left joins this RDD with another VertexRDD with the same index. This function will fail if both VertexRDDs do not share the same index. The resulting vertex set contains an entry for each vertex in this. If other is missing any vertex in this VertexRDD, f is passed None.

    VD2

    the attribute type of the other VertexRDD

    VD3

    the attribute type of the resulting VertexRDD

    other

    the other VertexRDD with which to join.

    f

    the function mapping a vertex id and its attributes in this and the other vertex set to a new vertex attribute.

    returns

    a VertexRDD containing the results of f

  8. abstract def mapValues[VD2](f: (VertexId, VD) ⇒ VD2)(implicit arg0: ClassTag[VD2]): VertexRDD[VD2]

    Maps each vertex attribute, additionally supplying the vertex ID.

    Maps each vertex attribute, additionally supplying the vertex ID.

    VD2

    the type returned by the map function

    f

    the function applied to each ID-value pair in the RDD

    returns

    a new VertexRDD with values obtained by applying f to each of the entries in the original VertexRDD. The resulting VertexRDD retains the same index.

  9. abstract def mapValues[VD2](f: (VD) ⇒ VD2)(implicit arg0: ClassTag[VD2]): VertexRDD[VD2]

    Maps each vertex attribute, preserving the index.

    Maps each vertex attribute, preserving the index.

    VD2

    the type returned by the map function

    f

    the function applied to each value in the RDD

    returns

    a new VertexRDD with values obtained by applying f to each of the entries in the original VertexRDD

  10. abstract def minus(other: VertexRDD[VD]): VertexRDD[VD]

    For each VertexId present in both this and other, minus will act as a set difference operation returning only those unique VertexId's present in this.

    For each VertexId present in both this and other, minus will act as a set difference operation returning only those unique VertexId's present in this.

    other

    a VertexRDD to run the set operation against

  11. abstract def minus(other: RDD[(VertexId, VD)]): VertexRDD[VD]

    For each VertexId present in both this and other, minus will act as a set difference operation returning only those unique VertexId's present in this.

    For each VertexId present in both this and other, minus will act as a set difference operation returning only those unique VertexId's present in this.

    other

    an RDD to run the set operation against

  12. abstract def reindex(): VertexRDD[VD]

    Construct a new VertexRDD that is indexed by only the visible vertices.

    Construct a new VertexRDD that is indexed by only the visible vertices. The resulting VertexRDD will be based on a different index and can no longer be quickly joined with this RDD.

  13. abstract def reverseRoutingTables(): VertexRDD[VD]

    Returns a new VertexRDD reflecting a reversal of all edge directions in the corresponding EdgeRDD.

  14. implicit abstract def vdTag: ClassTag[VD]

    Attributes
    protected
  15. abstract def withEdges(edges: EdgeRDD[_]): VertexRDD[VD]

    Prepares this VertexRDD for efficient joins with the given EdgeRDD.

Concrete Value Members

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

    Definition Classes
    AnyRef
  2. final def !=(arg0: Any): Boolean

    Definition Classes
    Any
  3. final def ##(): Int

    Definition Classes
    AnyRef → Any
  4. def ++(other: RDD[(VertexId, VD)]): RDD[(VertexId, VD)]

    Return the union of this RDD and another one.

    Return the union of this RDD and another one. Any identical elements will appear multiple times (use .distinct() to eliminate them).

    Definition Classes
    RDD
  5. final def ==(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  6. final def ==(arg0: Any): Boolean

    Definition Classes
    Any
  7. def aggregate[U](zeroValue: U)(seqOp: (U, (VertexId, VD)) ⇒ U, combOp: (U, U) ⇒ U)(implicit arg0: ClassTag[U]): U

    Aggregate the elements of each partition, and then the results for all the partitions, using given combine functions and a neutral "zero value".

    Aggregate the elements of each partition, and then the results for all the partitions, using given combine functions and a neutral "zero value". This function can return a different result type, U, than the type of this RDD, T. Thus, we need one operation for merging a T into an U and one operation for merging two U's, as in scala.TraversableOnce. Both of these functions are allowed to modify and return their first argument instead of creating a new U to avoid memory allocation.

    Definition Classes
    RDD
  8. final def asInstanceOf[T0]: T0

    Definition Classes
    Any
  9. def cache(): VertexRDD.this.type

    Persist this RDD with the default storage level (MEMORY_ONLY).

    Persist this RDD with the default storage level (MEMORY_ONLY).

    Definition Classes
    RDD
  10. def cartesian[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[((VertexId, VD), U)]

    Return the Cartesian product of this RDD and another one, that is, the RDD of all pairs of elements (a, b) where a is in this and b is in other.

    Return the Cartesian product of this RDD and another one, that is, the RDD of all pairs of elements (a, b) where a is in this and b is in other.

    Definition Classes
    RDD
  11. def checkpoint(): Unit

    Mark this RDD for checkpointing.

    Mark this RDD for checkpointing. It will be saved to a file inside the checkpoint directory set with SparkContext.setCheckpointDir() and all references to its parent RDDs will be removed. This function must be called before any job has been executed on this RDD. It is strongly recommended that this RDD is persisted in memory, otherwise saving it on a file will require recomputation.

    Definition Classes
    RDD
  12. def clearDependencies(): Unit

    Clears the dependencies of this RDD.

    Clears the dependencies of this RDD. This method must ensure that all references to the original parent RDDs is removed to enable the parent RDDs to be garbage collected. Subclasses of RDD may override this method for implementing their own cleaning logic. See org.apache.spark.rdd.UnionRDD for an example.

    Attributes
    protected
    Definition Classes
    RDD
  13. def clone(): AnyRef

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  14. def coalesce(numPartitions: Int, shuffle: Boolean = false)(implicit ord: Ordering[(VertexId, VD)] = null): RDD[(VertexId, VD)]

    Return a new RDD that is reduced into numPartitions partitions.

    Return a new RDD that is reduced into numPartitions partitions.

    This results in a narrow dependency, e.g. if you go from 1000 partitions to 100 partitions, there will not be a shuffle, instead each of the 100 new partitions will claim 10 of the current partitions.

    However, if you're doing a drastic coalesce, e.g. to numPartitions = 1, this may result in your computation taking place on fewer nodes than you like (e.g. one node in the case of numPartitions = 1). To avoid this, you can pass shuffle = true. This will add a shuffle step, but means the current upstream partitions will be executed in parallel (per whatever the current partitioning is).

    Note: With shuffle = true, you can actually coalesce to a larger number of partitions. This is useful if you have a small number of partitions, say 100, potentially with a few partitions being abnormally large. Calling coalesce(1000, shuffle = true) will result in 1000 partitions with the data distributed using a hash partitioner.

    Definition Classes
    RDD
  15. def collect[U](f: PartialFunction[(VertexId, VD), U])(implicit arg0: ClassTag[U]): RDD[U]

    Return an RDD that contains all matching values by applying f.

    Return an RDD that contains all matching values by applying f.

    Definition Classes
    RDD
  16. def collect(): Array[(VertexId, VD)]

    Return an array that contains all of the elements in this RDD.

    Return an array that contains all of the elements in this RDD.

    Definition Classes
    RDD
  17. def compute(part: Partition, context: TaskContext): Iterator[(VertexId, VD)]

    Provides the RDD[(VertexId, VD)] equivalent output.

    Provides the RDD[(VertexId, VD)] equivalent output.

    Definition Classes
    VertexRDDRDD
  18. def context: SparkContext

    The org.apache.spark.SparkContext that this RDD was created on.

    The org.apache.spark.SparkContext that this RDD was created on.

    Definition Classes
    RDD
  19. def count(): Long

    Return the number of elements in the RDD.

    Return the number of elements in the RDD.

    Definition Classes
    RDD
  20. def countApprox(timeout: Long, confidence: Double = 0.95): PartialResult[BoundedDouble]

    :: Experimental :: Approximate version of count() that returns a potentially incomplete result within a timeout, even if not all tasks have finished.

    :: Experimental :: Approximate version of count() that returns a potentially incomplete result within a timeout, even if not all tasks have finished.

    Definition Classes
    RDD
    Annotations
    @Experimental()
  21. def countApproxDistinct(relativeSD: Double = 0.05): Long

    Return approximate number of distinct elements in the RDD.

    Return approximate number of distinct elements in the RDD.

    The algorithm used is based on streamlib's implementation of "HyperLogLog in Practice: Algorithmic Engineering of a State of The Art Cardinality Estimation Algorithm", available here.

    relativeSD

    Relative accuracy. Smaller values create counters that require more space. It must be greater than 0.000017.

    Definition Classes
    RDD
  22. def countApproxDistinct(p: Int, sp: Int): Long

    :: Experimental :: Return approximate number of distinct elements in the RDD.

    :: Experimental :: Return approximate number of distinct elements in the RDD.

    The algorithm used is based on streamlib's implementation of "HyperLogLog in Practice: Algorithmic Engineering of a State of The Art Cardinality Estimation Algorithm", available here.

    The relative accuracy is approximately 1.054 / sqrt(2^p). Setting a nonzero sp > p would trigger sparse representation of registers, which may reduce the memory consumption and increase accuracy when the cardinality is small.

    p

    The precision value for the normal set. p must be a value between 4 and sp if sp is not zero (32 max).

    sp

    The precision value for the sparse set, between 0 and 32. If sp equals 0, the sparse representation is skipped.

    Definition Classes
    RDD
    Annotations
    @Experimental()
  23. def countByValue()(implicit ord: Ordering[(VertexId, VD)] = null): Map[(VertexId, VD), Long]

    Return the count of each unique value in this RDD as a local map of (value, count) pairs.

    Return the count of each unique value in this RDD as a local map of (value, count) pairs.

    Note that this method should only be used if the resulting map is expected to be small, as the whole thing is loaded into the driver's memory. To handle very large results, consider using rdd.map(x => (x, 1L)).reduceByKey(_ + _), which returns an RDD[T, Long] instead of a map.

    Definition Classes
    RDD
  24. def countByValueApprox(timeout: Long, confidence: Double = 0.95)(implicit ord: Ordering[(VertexId, VD)] = null): PartialResult[Map[(VertexId, VD), BoundedDouble]]

    :: Experimental :: Approximate version of countByValue().

    :: Experimental :: Approximate version of countByValue().

    Definition Classes
    RDD
    Annotations
    @Experimental()
  25. final def dependencies: Seq[Dependency[_]]

    Get the list of dependencies of this RDD, taking into account whether the RDD is checkpointed or not.

    Get the list of dependencies of this RDD, taking into account whether the RDD is checkpointed or not.

    Definition Classes
    RDD
  26. def distinct(): RDD[(VertexId, VD)]

    Return a new RDD containing the distinct elements in this RDD.

    Return a new RDD containing the distinct elements in this RDD.

    Definition Classes
    RDD
  27. def distinct(numPartitions: Int)(implicit ord: Ordering[(VertexId, VD)] = null): RDD[(VertexId, VD)]

    Return a new RDD containing the distinct elements in this RDD.

    Return a new RDD containing the distinct elements in this RDD.

    Definition Classes
    RDD
  28. final def eq(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  29. def equals(arg0: Any): Boolean

    Definition Classes
    AnyRef → Any
  30. def filter(pred: ((VertexId, VD)) ⇒ Boolean): VertexRDD[VD]

    Restricts the vertex set to the set of vertices satisfying the given predicate.

    Restricts the vertex set to the set of vertices satisfying the given predicate. This operation preserves the index for efficient joins with the original RDD, and it sets bits in the bitmask rather than allocating new memory.

    It is declared and defined here to allow refining the return type from RDD[(VertexId, VD)] to VertexRDD[VD].

    pred

    the user defined predicate, which takes a tuple to conform to the RDD[(VertexId, VD)] interface

    Definition Classes
    VertexRDDRDD
  31. def finalize(): Unit

    Attributes
    protected[java.lang]
    Definition Classes
    AnyRef
    Annotations
    @throws( classOf[java.lang.Throwable] )
  32. def first(): (VertexId, VD)

    Return the first element in this RDD.

    Return the first element in this RDD.

    Definition Classes
    RDD
  33. def firstParent[U](implicit arg0: ClassTag[U]): RDD[U]

    Returns the first parent RDD

    Returns the first parent RDD

    Attributes
    protected[org.apache.spark]
    Definition Classes
    RDD
  34. def flatMap[U](f: ((VertexId, VD)) ⇒ TraversableOnce[U])(implicit arg0: ClassTag[U]): RDD[U]

    Return a new RDD by first applying a function to all elements of this RDD, and then flattening the results.

    Return a new RDD by first applying a function to all elements of this RDD, and then flattening the results.

    Definition Classes
    RDD
  35. def fold(zeroValue: (VertexId, VD))(op: ((VertexId, VD), (VertexId, VD)) ⇒ (VertexId, VD)): (VertexId, VD)

    Aggregate the elements of each partition, and then the results for all the partitions, using a given associative and commutative function and a neutral "zero value".

    Aggregate the elements of each partition, and then the results for all the partitions, using a given associative and commutative function and a neutral "zero value". The function op(t1, t2) is allowed to modify t1 and return it as its result value to avoid object allocation; however, it should not modify t2.

    This behaves somewhat differently from fold operations implemented for non-distributed collections in functional languages like Scala. This fold operation may be applied to partitions individually, and then fold those results into the final result, rather than apply the fold to each element sequentially in some defined ordering. For functions that are not commutative, the result may differ from that of a fold applied to a non-distributed collection.

    Definition Classes
    RDD
  36. def foreach(f: ((VertexId, VD)) ⇒ Unit): Unit

    Applies a function f to all elements of this RDD.

    Applies a function f to all elements of this RDD.

    Definition Classes
    RDD
  37. def foreachPartition(f: (Iterator[(VertexId, VD)]) ⇒ Unit): Unit

    Applies a function f to each partition of this RDD.

    Applies a function f to each partition of this RDD.

    Definition Classes
    RDD
  38. def getCheckpointFile: Option[String]

    Gets the name of the file to which this RDD was checkpointed

    Gets the name of the file to which this RDD was checkpointed

    Definition Classes
    RDD
  39. final def getClass(): Class[_]

    Definition Classes
    AnyRef → Any
  40. def getDependencies: Seq[Dependency[_]]

    Implemented by subclasses to return how this RDD depends on parent RDDs.

    Implemented by subclasses to return how this RDD depends on parent RDDs. This method will only be called once, so it is safe to implement a time-consuming computation in it.

    Attributes
    protected
    Definition Classes
    RDD
  41. def getPartitions: Array[Partition]

    Implemented by subclasses to return the set of partitions in this RDD.

    Implemented by subclasses to return the set of partitions in this RDD. This method will only be called once, so it is safe to implement a time-consuming computation in it.

    Attributes
    protected
    Definition Classes
    VertexRDDRDD
  42. def getPreferredLocations(split: Partition): Seq[String]

    Optionally overridden by subclasses to specify placement preferences.

    Optionally overridden by subclasses to specify placement preferences.

    Attributes
    protected
    Definition Classes
    RDD
  43. def getStorageLevel: StorageLevel

    Get the RDD's current storage level, or StorageLevel.

    Get the RDD's current storage level, or StorageLevel.NONE if none is set.

    Definition Classes
    RDD
  44. def glom(): RDD[Array[(VertexId, VD)]]

    Return an RDD created by coalescing all elements within each partition into an array.

    Return an RDD created by coalescing all elements within each partition into an array.

    Definition Classes
    RDD
  45. def groupBy[K](f: ((VertexId, VD)) ⇒ K, p: Partitioner)(implicit kt: ClassTag[K], ord: Ordering[K] = null): RDD[(K, Iterable[(VertexId, VD)])]

    Return an RDD of grouped items.

    Return an RDD of grouped items. Each group consists of a key and a sequence of elements mapping to that key. The ordering of elements within each group is not guaranteed, and may even differ each time the resulting RDD is evaluated.

    Note: This operation may be very expensive. If you are grouping in order to perform an aggregation (such as a sum or average) over each key, using PairRDDFunctions.aggregateByKey or PairRDDFunctions.reduceByKey will provide much better performance.

    Definition Classes
    RDD
  46. def groupBy[K](f: ((VertexId, VD)) ⇒ K, numPartitions: Int)(implicit kt: ClassTag[K]): RDD[(K, Iterable[(VertexId, VD)])]

    Return an RDD of grouped elements.

    Return an RDD of grouped elements. Each group consists of a key and a sequence of elements mapping to that key. The ordering of elements within each group is not guaranteed, and may even differ each time the resulting RDD is evaluated.

    Note: This operation may be very expensive. If you are grouping in order to perform an aggregation (such as a sum or average) over each key, using PairRDDFunctions.aggregateByKey or PairRDDFunctions.reduceByKey will provide much better performance.

    Definition Classes
    RDD
  47. def groupBy[K](f: ((VertexId, VD)) ⇒ K)(implicit kt: ClassTag[K]): RDD[(K, Iterable[(VertexId, VD)])]

    Return an RDD of grouped items.

    Return an RDD of grouped items. Each group consists of a key and a sequence of elements mapping to that key. The ordering of elements within each group is not guaranteed, and may even differ each time the resulting RDD is evaluated.

    Note: This operation may be very expensive. If you are grouping in order to perform an aggregation (such as a sum or average) over each key, using PairRDDFunctions.aggregateByKey or PairRDDFunctions.reduceByKey will provide much better performance.

    Definition Classes
    RDD
  48. def hashCode(): Int

    Definition Classes
    AnyRef → Any
  49. val id: Int

    A unique ID for this RDD (within its SparkContext).

    A unique ID for this RDD (within its SparkContext).

    Definition Classes
    RDD
  50. def intersection(other: RDD[(VertexId, VD)], numPartitions: Int): RDD[(VertexId, VD)]

    Return the intersection of this RDD and another one.

    Return the intersection of this RDD and another one. The output will not contain any duplicate elements, even if the input RDDs did. Performs a hash partition across the cluster

    Note that this method performs a shuffle internally.

    numPartitions

    How many partitions to use in the resulting RDD

    Definition Classes
    RDD
  51. def intersection(other: RDD[(VertexId, VD)], partitioner: Partitioner)(implicit ord: Ordering[(VertexId, VD)] = null): RDD[(VertexId, VD)]

    Return the intersection of this RDD and another one.

    Return the intersection of this RDD and another one. The output will not contain any duplicate elements, even if the input RDDs did.

    Note that this method performs a shuffle internally.

    partitioner

    Partitioner to use for the resulting RDD

    Definition Classes
    RDD
  52. def intersection(other: RDD[(VertexId, VD)]): RDD[(VertexId, VD)]

    Return the intersection of this RDD and another one.

    Return the intersection of this RDD and another one. The output will not contain any duplicate elements, even if the input RDDs did.

    Note that this method performs a shuffle internally.

    Definition Classes
    RDD
  53. def isCheckpointed: Boolean

    Return whether this RDD has been checkpointed or not

    Return whether this RDD has been checkpointed or not

    Definition Classes
    RDD
  54. def isEmpty(): Boolean

    returns

    true if and only if the RDD contains no elements at all. Note that an RDD may be empty even when it has at least 1 partition.

    Definition Classes
    RDD
    Note

    due to complications in the internal implementation, this method will raise an exception if called on an RDD of Nothing or Null. This may be come up in practice because, for example, the type of parallelize(Seq()) is RDD[Nothing]. (parallelize(Seq()) should be avoided anyway in favor of parallelize(Seq[T]()).)

  55. final def isInstanceOf[T0]: Boolean

    Definition Classes
    Any
  56. def isTraceEnabled(): Boolean

    Attributes
    protected
    Definition Classes
    Logging
  57. final def iterator(split: Partition, context: TaskContext): Iterator[(VertexId, VD)]

    Internal method to this RDD; will read from cache if applicable, or otherwise compute it.

    Internal method to this RDD; will read from cache if applicable, or otherwise compute it. This should not be called by users directly, but is available for implementors of custom subclasses of RDD.

    Definition Classes
    RDD
  58. def keyBy[K](f: ((VertexId, VD)) ⇒ K): RDD[(K, (VertexId, VD))]

    Creates tuples of the elements in this RDD by applying f.

    Creates tuples of the elements in this RDD by applying f.

    Definition Classes
    RDD
  59. def log: Logger

    Attributes
    protected
    Definition Classes
    Logging
  60. def logDebug(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging
  61. def logDebug(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging
  62. def logError(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging
  63. def logError(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging
  64. def logInfo(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging
  65. def logInfo(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging
  66. def logName: String

    Attributes
    protected
    Definition Classes
    Logging
  67. def logTrace(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging
  68. def logTrace(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging
  69. def logWarning(msg: ⇒ String, throwable: Throwable): Unit

    Attributes
    protected
    Definition Classes
    Logging
  70. def logWarning(msg: ⇒ String): Unit

    Attributes
    protected
    Definition Classes
    Logging
  71. def map[U](f: ((VertexId, VD)) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]

    Return a new RDD by applying a function to all elements of this RDD.

    Return a new RDD by applying a function to all elements of this RDD.

    Definition Classes
    RDD
  72. def mapPartitions[U](f: (Iterator[(VertexId, VD)]) ⇒ Iterator[U], preservesPartitioning: Boolean = false)(implicit arg0: ClassTag[U]): RDD[U]

    Return a new RDD by applying a function to each partition of this RDD.

    Return a new RDD by applying a function to each partition of this RDD.

    preservesPartitioning indicates whether the input function preserves the partitioner, which should be false unless this is a pair RDD and the input function doesn't modify the keys.

    Definition Classes
    RDD
  73. def mapPartitionsWithIndex[U](f: (Int, Iterator[(VertexId, VD)]) ⇒ Iterator[U], preservesPartitioning: Boolean = false)(implicit arg0: ClassTag[U]): RDD[U]

    Return a new RDD by applying a function to each partition of this RDD, while tracking the index of the original partition.

    Return a new RDD by applying a function to each partition of this RDD, while tracking the index of the original partition.

    preservesPartitioning indicates whether the input function preserves the partitioner, which should be false unless this is a pair RDD and the input function doesn't modify the keys.

    Definition Classes
    RDD
  74. def max()(implicit ord: Ordering[(VertexId, VD)]): (VertexId, VD)

    Returns the max of this RDD as defined by the implicit Ordering[T].

    Returns the max of this RDD as defined by the implicit Ordering[T].

    returns

    the maximum element of the RDD

    Definition Classes
    RDD
  75. def min()(implicit ord: Ordering[(VertexId, VD)]): (VertexId, VD)

    Returns the min of this RDD as defined by the implicit Ordering[T].

    Returns the min of this RDD as defined by the implicit Ordering[T].

    returns

    the minimum element of the RDD

    Definition Classes
    RDD
  76. var name: String

    A friendly name for this RDD

    A friendly name for this RDD

    Definition Classes
    RDD
  77. final def ne(arg0: AnyRef): Boolean

    Definition Classes
    AnyRef
  78. final def notify(): Unit

    Definition Classes
    AnyRef
  79. final def notifyAll(): Unit

    Definition Classes
    AnyRef
  80. def parent[U](j: Int)(implicit arg0: ClassTag[U]): RDD[U]

    Returns the jth parent RDD: e.

    Returns the jth parent RDD: e.g. rdd.parent[T](0) is equivalent to rdd.firstParent[T]

    Attributes
    protected[org.apache.spark]
    Definition Classes
    RDD
  81. val partitioner: Option[Partitioner]

    Optionally overridden by subclasses to specify how they are partitioned.

    Optionally overridden by subclasses to specify how they are partitioned.

    Definition Classes
    RDD
  82. final def partitions: Array[Partition]

    Get the array of partitions of this RDD, taking into account whether the RDD is checkpointed or not.

    Get the array of partitions of this RDD, taking into account whether the RDD is checkpointed or not.

    Definition Classes
    RDD
  83. def persist(): VertexRDD.this.type

    Persist this RDD with the default storage level (MEMORY_ONLY).

    Persist this RDD with the default storage level (MEMORY_ONLY).

    Definition Classes
    RDD
  84. def persist(newLevel: StorageLevel): VertexRDD.this.type

    Set this RDD's storage level to persist its values across operations after the first time it is computed.

    Set this RDD's storage level to persist its values across operations after the first time it is computed. This can only be used to assign a new storage level if the RDD does not have a storage level set yet..

    Definition Classes
    RDD
  85. def pipe(command: Seq[String], env: Map[String, String] = Map(), printPipeContext: ((String) ⇒ Unit) ⇒ Unit = null, printRDDElement: ((VertexId, VD), (String) ⇒ Unit) ⇒ Unit = null, separateWorkingDir: Boolean = false): RDD[String]

    Return an RDD created by piping elements to a forked external process.

    Return an RDD created by piping elements to a forked external process. The print behavior can be customized by providing two functions.

    command

    command to run in forked process.

    env

    environment variables to set.

    printPipeContext

    Before piping elements, this function is called as an opportunity to pipe context data. Print line function (like out.println) will be passed as printPipeContext's parameter.

    printRDDElement

    Use this function to customize how to pipe elements. This function will be called with each RDD element as the 1st parameter, and the print line function (like out.println()) as the 2nd parameter. An example of pipe the RDD data of groupBy() in a streaming way, instead of constructing a huge String to concat all the elements: def printRDDElement(record:(String, Seq[String]), f:String=>Unit) = for (e <- record._2){f(e)}

    separateWorkingDir

    Use separate working directories for each task.

    returns

    the result RDD

    Definition Classes
    RDD
  86. def pipe(command: String, env: Map[String, String]): RDD[String]

    Return an RDD created by piping elements to a forked external process.

    Return an RDD created by piping elements to a forked external process.

    Definition Classes
    RDD
  87. def pipe(command: String): RDD[String]

    Return an RDD created by piping elements to a forked external process.

    Return an RDD created by piping elements to a forked external process.

    Definition Classes
    RDD
  88. final def preferredLocations(split: Partition): Seq[String]

    Get the preferred locations of a partition, taking into account whether the RDD is checkpointed.

    Get the preferred locations of a partition, taking into account whether the RDD is checkpointed.

    Definition Classes
    RDD
  89. def randomSplit(weights: Array[Double], seed: Long = Utils.random.nextLong): Array[RDD[(VertexId, VD)]]

    Randomly splits this RDD with the provided weights.

    Randomly splits this RDD with the provided weights.

    weights

    weights for splits, will be normalized if they don't sum to 1

    seed

    random seed

    returns

    split RDDs in an array

    Definition Classes
    RDD
  90. def reduce(f: ((VertexId, VD), (VertexId, VD)) ⇒ (VertexId, VD)): (VertexId, VD)

    Reduces the elements of this RDD using the specified commutative and associative binary operator.

    Reduces the elements of this RDD using the specified commutative and associative binary operator.

    Definition Classes
    RDD
  91. def repartition(numPartitions: Int)(implicit ord: Ordering[(VertexId, VD)] = null): RDD[(VertexId, VD)]

    Return a new RDD that has exactly numPartitions partitions.

    Return a new RDD that has exactly numPartitions partitions.

    Can increase or decrease the level of parallelism in this RDD. Internally, this uses a shuffle to redistribute data.

    If you are decreasing the number of partitions in this RDD, consider using coalesce, which can avoid performing a shuffle.

    Definition Classes
    RDD
  92. def sample(withReplacement: Boolean, fraction: Double, seed: Long = Utils.random.nextLong): RDD[(VertexId, VD)]

    Return a sampled subset of this RDD.

    Return a sampled subset of this RDD.

    withReplacement

    can elements be sampled multiple times (replaced when sampled out)

    fraction

    expected size of the sample as a fraction of this RDD's size without replacement: probability that each element is chosen; fraction must be [0, 1] with replacement: expected number of times each element is chosen; fraction must be >= 0

    seed

    seed for the random number generator

    Definition Classes
    RDD
  93. def saveAsObjectFile(path: String): Unit

    Save this RDD as a SequenceFile of serialized objects.

    Save this RDD as a SequenceFile of serialized objects.

    Definition Classes
    RDD
  94. def saveAsTextFile(path: String, codec: Class[_ <: CompressionCodec]): Unit

    Save this RDD as a compressed text file, using string representations of elements.

    Save this RDD as a compressed text file, using string representations of elements.

    Definition Classes
    RDD
  95. def saveAsTextFile(path: String): Unit

    Save this RDD as a text file, using string representations of elements.

    Save this RDD as a text file, using string representations of elements.

    Definition Classes
    RDD
  96. def setName(_name: String): VertexRDD.this.type

    Assign a name to this RDD

    Assign a name to this RDD

    Definition Classes
    RDD
  97. def sortBy[K](f: ((VertexId, VD)) ⇒ K, ascending: Boolean = true, numPartitions: Int = this.partitions.length)(implicit ord: Ordering[K], ctag: ClassTag[K]): RDD[(VertexId, VD)]

    Return this RDD sorted by the given key function.

    Return this RDD sorted by the given key function.

    Definition Classes
    RDD
  98. def sparkContext: SparkContext

    The SparkContext that created this RDD.

    The SparkContext that created this RDD.

    Definition Classes
    RDD
  99. def subtract(other: RDD[(VertexId, VD)], p: Partitioner)(implicit ord: Ordering[(VertexId, VD)] = null): RDD[(VertexId, VD)]

    Return an RDD with the elements from this that are not in other.

    Return an RDD with the elements from this that are not in other.

    Definition Classes
    RDD
  100. def subtract(other: RDD[(VertexId, VD)], numPartitions: Int): RDD[(VertexId, VD)]

    Return an RDD with the elements from this that are not in other.

    Return an RDD with the elements from this that are not in other.

    Definition Classes
    RDD
  101. def subtract(other: RDD[(VertexId, VD)]): RDD[(VertexId, VD)]

    Return an RDD with the elements from this that are not in other.

    Return an RDD with the elements from this that are not in other.

    Uses this partitioner/partition size, because even if other is huge, the resulting RDD will be <= us.

    Definition Classes
    RDD
  102. final def synchronized[T0](arg0: ⇒ T0): T0

    Definition Classes
    AnyRef
  103. def take(num: Int): Array[(VertexId, VD)]

    Take the first num elements of the RDD.

    Take the first num elements of the RDD. It works by first scanning one partition, and use the results from that partition to estimate the number of additional partitions needed to satisfy the limit.

    Definition Classes
    RDD
    Note

    due to complications in the internal implementation, this method will raise an exception if called on an RDD of Nothing or Null.

  104. def takeOrdered(num: Int)(implicit ord: Ordering[(VertexId, VD)]): Array[(VertexId, VD)]

    Returns the first k (smallest) elements from this RDD as defined by the specified implicit Ordering[T] and maintains the ordering.

    Returns the first k (smallest) elements from this RDD as defined by the specified implicit Ordering[T] and maintains the ordering. This does the opposite of top. For example:

    sc.parallelize(Seq(10, 4, 2, 12, 3)).takeOrdered(1)
    // returns Array(2)
    
    sc.parallelize(Seq(2, 3, 4, 5, 6)).takeOrdered(2)
    // returns Array(2, 3)
    num

    k, the number of elements to return

    ord

    the implicit ordering for T

    returns

    an array of top elements

    Definition Classes
    RDD
  105. def takeSample(withReplacement: Boolean, num: Int, seed: Long = Utils.random.nextLong): Array[(VertexId, VD)]

    Return a fixed-size sampled subset of this RDD in an array

    Return a fixed-size sampled subset of this RDD in an array

    withReplacement

    whether sampling is done with replacement

    num

    size of the returned sample

    seed

    seed for the random number generator

    returns

    sample of specified size in an array

    Definition Classes
    RDD
  106. def toDebugString: String

    A description of this RDD and its recursive dependencies for debugging.

    A description of this RDD and its recursive dependencies for debugging.

    Definition Classes
    RDD
  107. def toJavaRDD(): JavaRDD[(VertexId, VD)]

    Definition Classes
    RDD
  108. def toLocalIterator: Iterator[(VertexId, VD)]

    Return an iterator that contains all of the elements in this RDD.

    Return an iterator that contains all of the elements in this RDD.

    The iterator will consume as much memory as the largest partition in this RDD.

    Note: this results in multiple Spark jobs, and if the input RDD is the result of a wide transformation (e.g. join with different partitioners), to avoid recomputing the input RDD should be cached first.

    Definition Classes
    RDD
  109. def toString(): String

    Definition Classes
    RDD → AnyRef → Any
  110. def top(num: Int)(implicit ord: Ordering[(VertexId, VD)]): Array[(VertexId, VD)]

    Returns the top k (largest) elements from this RDD as defined by the specified implicit Ordering[T].

    Returns the top k (largest) elements from this RDD as defined by the specified implicit Ordering[T]. This does the opposite of takeOrdered. For example:

    sc.parallelize(Seq(10, 4, 2, 12, 3)).top(1)
    // returns Array(12)
    
    sc.parallelize(Seq(2, 3, 4, 5, 6)).top(2)
    // returns Array(6, 5)
    num

    k, the number of top elements to return

    ord

    the implicit ordering for T

    returns

    an array of top elements

    Definition Classes
    RDD
  111. def treeAggregate[U](zeroValue: U)(seqOp: (U, (VertexId, VD)) ⇒ U, combOp: (U, U) ⇒ U, depth: Int = 2)(implicit arg0: ClassTag[U]): U

    Aggregates the elements of this RDD in a multi-level tree pattern.

    Aggregates the elements of this RDD in a multi-level tree pattern.

    depth

    suggested depth of the tree (default: 2)

    Definition Classes
    RDD
    See also

    org.apache.spark.rdd.RDD#aggregate

  112. def treeReduce(f: ((VertexId, VD), (VertexId, VD)) ⇒ (VertexId, VD), depth: Int = 2): (VertexId, VD)

    Reduces the elements of this RDD in a multi-level tree pattern.

    Reduces the elements of this RDD in a multi-level tree pattern.

    depth

    suggested depth of the tree (default: 2)

    Definition Classes
    RDD
    See also

    org.apache.spark.rdd.RDD#reduce

  113. def union(other: RDD[(VertexId, VD)]): RDD[(VertexId, VD)]

    Return the union of this RDD and another one.

    Return the union of this RDD and another one. Any identical elements will appear multiple times (use .distinct() to eliminate them).

    Definition Classes
    RDD
  114. def unpersist(blocking: Boolean = true): VertexRDD.this.type

    Mark the RDD as non-persistent, and remove all blocks for it from memory and disk.

    Mark the RDD as non-persistent, and remove all blocks for it from memory and disk.

    blocking

    Whether to block until all blocks are deleted.

    returns

    This RDD.

    Definition Classes
    RDD
  115. final def wait(): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  116. final def wait(arg0: Long, arg1: Int): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  117. final def wait(arg0: Long): Unit

    Definition Classes
    AnyRef
    Annotations
    @throws( ... )
  118. def zip[U](other: RDD[U])(implicit arg0: ClassTag[U]): RDD[((VertexId, VD), U)]

    Zips this RDD with another one, returning key-value pairs with the first element in each RDD, second element in each RDD, etc.

    Zips this RDD with another one, returning key-value pairs with the first element in each RDD, second element in each RDD, etc. Assumes that the two RDDs have the *same number of partitions* and the *same number of elements in each partition* (e.g. one was made through a map on the other).

    Definition Classes
    RDD
  119. def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D])(f: (Iterator[(VertexId, VD)], Iterator[B], Iterator[C], Iterator[D]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[D], arg3: ClassTag[V]): RDD[V]

    Definition Classes
    RDD
  120. def zipPartitions[B, C, D, V](rdd2: RDD[B], rdd3: RDD[C], rdd4: RDD[D], preservesPartitioning: Boolean)(f: (Iterator[(VertexId, VD)], Iterator[B], Iterator[C], Iterator[D]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[D], arg3: ClassTag[V]): RDD[V]

    Definition Classes
    RDD
  121. def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C])(f: (Iterator[(VertexId, VD)], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]

    Definition Classes
    RDD
  122. def zipPartitions[B, C, V](rdd2: RDD[B], rdd3: RDD[C], preservesPartitioning: Boolean)(f: (Iterator[(VertexId, VD)], Iterator[B], Iterator[C]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[C], arg2: ClassTag[V]): RDD[V]

    Definition Classes
    RDD
  123. def zipPartitions[B, V](rdd2: RDD[B])(f: (Iterator[(VertexId, VD)], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]

    Definition Classes
    RDD
  124. def zipPartitions[B, V](rdd2: RDD[B], preservesPartitioning: Boolean)(f: (Iterator[(VertexId, VD)], Iterator[B]) ⇒ Iterator[V])(implicit arg0: ClassTag[B], arg1: ClassTag[V]): RDD[V]

    Zip this RDD's partitions with one (or more) RDD(s) and return a new RDD by applying a function to the zipped partitions.

    Zip this RDD's partitions with one (or more) RDD(s) and return a new RDD by applying a function to the zipped partitions. Assumes that all the RDDs have the *same number of partitions*, but does *not* require them to have the same number of elements in each partition.

    Definition Classes
    RDD
  125. def zipWithIndex(): RDD[((VertexId, VD), Long)]

    Zips this RDD with its element indices.

    Zips this RDD with its element indices. The ordering is first based on the partition index and then the ordering of items within each partition. So the first item in the first partition gets index 0, and the last item in the last partition receives the largest index.

    This is similar to Scala's zipWithIndex but it uses Long instead of Int as the index type. This method needs to trigger a spark job when this RDD contains more than one partitions.

    Note that some RDDs, such as those returned by groupBy(), do not guarantee order of elements in a partition. The index assigned to each element is therefore not guaranteed, and may even change if the RDD is reevaluated. If a fixed ordering is required to guarantee the same index assignments, you should sort the RDD with sortByKey() or save it to a file.

    Definition Classes
    RDD
  126. def zipWithUniqueId(): RDD[((VertexId, VD), Long)]

    Zips this RDD with generated unique Long ids.

    Zips this RDD with generated unique Long ids. Items in the kth partition will get ids k, n+k, 2*n+k, ..., where n is the number of partitions. So there may exist gaps, but this method won't trigger a spark job, which is different from org.apache.spark.rdd.RDD#zipWithIndex.

    Note that some RDDs, such as those returned by groupBy(), do not guarantee order of elements in a partition. The unique ID assigned to each element is therefore not guaranteed, and may even change if the RDD is reevaluated. If a fixed ordering is required to guarantee the same index assignments, you should sort the RDD with sortByKey() or save it to a file.

    Definition Classes
    RDD

Deprecated Value Members

  1. def filterWith[A](constructA: (Int) ⇒ A)(p: ((VertexId, VD), A) ⇒ Boolean): RDD[(VertexId, VD)]

    Filters this RDD with p, where p takes an additional parameter of type A.

    Filters this RDD with p, where p takes an additional parameter of type A. This additional parameter is produced by constructA, which is called in each partition with the index of that partition.

    Definition Classes
    RDD
    Annotations
    @deprecated
    Deprecated

    (Since version 1.0.0) use mapPartitionsWithIndex and filter

  2. def flatMapWith[A, U](constructA: (Int) ⇒ A, preservesPartitioning: Boolean = false)(f: ((VertexId, VD), A) ⇒ Seq[U])(implicit arg0: ClassTag[U]): RDD[U]

    FlatMaps f over this RDD, where f takes an additional parameter of type A.

    FlatMaps f over this RDD, where f takes an additional parameter of type A. This additional parameter is produced by constructA, which is called in each partition with the index of that partition.

    Definition Classes
    RDD
    Annotations
    @deprecated
    Deprecated

    (Since version 1.0.0) use mapPartitionsWithIndex and flatMap

  3. def foreachWith[A](constructA: (Int) ⇒ A)(f: ((VertexId, VD), A) ⇒ Unit): Unit

    Applies f to each element of this RDD, where f takes an additional parameter of type A.

    Applies f to each element of this RDD, where f takes an additional parameter of type A. This additional parameter is produced by constructA, which is called in each partition with the index of that partition.

    Definition Classes
    RDD
    Annotations
    @deprecated
    Deprecated

    (Since version 1.0.0) use mapPartitionsWithIndex and foreach

  4. def mapPartitionsWithContext[U](f: (TaskContext, Iterator[(VertexId, VD)]) ⇒ Iterator[U], preservesPartitioning: Boolean = false)(implicit arg0: ClassTag[U]): RDD[U]

    :: DeveloperApi :: Return a new RDD by applying a function to each partition of this RDD.

    :: DeveloperApi :: Return a new RDD by applying a function to each partition of this RDD. This is a variant of mapPartitions that also passes the TaskContext into the closure.

    preservesPartitioning indicates whether the input function preserves the partitioner, which should be false unless this is a pair RDD and the input function doesn't modify the keys.

    Definition Classes
    RDD
    Annotations
    @DeveloperApi() @deprecated
    Deprecated

    (Since version 1.2.0) use TaskContext.get

  5. def mapPartitionsWithSplit[U](f: (Int, Iterator[(VertexId, VD)]) ⇒ Iterator[U], preservesPartitioning: Boolean = false)(implicit arg0: ClassTag[U]): RDD[U]

    Return a new RDD by applying a function to each partition of this RDD, while tracking the index of the original partition.

    Return a new RDD by applying a function to each partition of this RDD, while tracking the index of the original partition.

    Definition Classes
    RDD
    Annotations
    @deprecated
    Deprecated

    (Since version 0.7.0) use mapPartitionsWithIndex

  6. def mapWith[A, U](constructA: (Int) ⇒ A, preservesPartitioning: Boolean = false)(f: ((VertexId, VD), A) ⇒ U)(implicit arg0: ClassTag[U]): RDD[U]

    Maps f over this RDD, where f takes an additional parameter of type A.

    Maps f over this RDD, where f takes an additional parameter of type A. This additional parameter is produced by constructA, which is called in each partition with the index of that partition.

    Definition Classes
    RDD
    Annotations
    @deprecated
    Deprecated

    (Since version 1.0.0) use mapPartitionsWithIndex

  7. def toArray(): Array[(VertexId, VD)]

    Return an array that contains all of the elements in this RDD.

    Return an array that contains all of the elements in this RDD.

    Definition Classes
    RDD
    Annotations
    @deprecated
    Deprecated

    (Since version 1.0.0) use collect

Inherited from RDD[(VertexId, VD)]

Inherited from Logging

Inherited from Serializable

Inherited from Serializable

Inherited from AnyRef

Inherited from Any

Ungrouped