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
.
an RDD containing messages to aggregate, where each message is a pair of its target vertex ID and the message data
the associative aggregation function for merging messages to the same vertex
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.
Persists the vertex partitions at targetStorageLevel
, which defaults to MEMORY_ONLY.
Persists the vertex partitions at targetStorageLevel
, which defaults to MEMORY_ONLY.
Provides the RDD[(VertexId, VD)]
equivalent output.
Provides the RDD[(VertexId, VD)]
equivalent output.
The number of vertices in the RDD.
The number of vertices in the RDD.
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.
the other VertexRDD with which to diff against.
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.
the other RDD[(VertexId, VD)] with which to diff against.
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]
.
the user defined predicate, which takes a tuple to conform to the
RDD[(VertexId, VD)]
interface
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.
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.
the join function applied to corresponding values of this
and other
a VertexRDD co-indexed with this
, containing only vertices that appear in both
this
and other
, with values supplied by f
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.
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.
the attribute type of the other VertexRDD
the attribute type of the resulting VertexRDD
the other VertexRDD with which to join
the function mapping a vertex id and its attributes in this and the other vertex set to a new vertex attribute.
a VertexRDD containing all the vertices in this VertexRDD with the attributes emitted
by f
.
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
.
the attribute type of the other VertexRDD
the attribute type of the resulting VertexRDD
the other VertexRDD with which to join.
the function mapping a vertex id and its attributes in this and the other vertex set to a new vertex attribute.
a VertexRDD containing the results of f
Maps each vertex attribute, additionally supplying the vertex ID.
Maps each vertex attribute, additionally supplying the vertex ID.
the type returned by the map function
the function applied to each ID-value pair in the RDD
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.
Maps each vertex attribute, preserving the index.
Maps each vertex attribute, preserving the index.
the type returned by the map function
the function applied to each value in the RDD
a new VertexRDD with values obtained by applying f
to each of the entries in the
original VertexRDD
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
.
a VertexRDD to run the set operation against
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
.
an RDD to run the set operation against
Persists the vertex partitions at the specified storage level, ignoring any existing target storage level.
Persists the vertex partitions at the specified storage level, ignoring any existing target storage level.
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.
Returns a new VertexRDD
reflecting a reversal of all edge directions in the corresponding
EdgeRDD.
Returns a new VertexRDD
reflecting a reversal of all edge directions in the corresponding
EdgeRDD.
Prepares this VertexRDD for efficient joins with the given EdgeRDD.
Prepares this VertexRDD for efficient joins with the given EdgeRDD.
(Since version 1.0.0) use mapPartitionsWithIndex and filter
(Since version 1.0.0) use mapPartitionsWithIndex and flatMap
(Since version 1.0.0) use mapPartitionsWithIndex and foreach
(Since version 1.2.0) use TaskContext.get
(Since version 0.7.0) use mapPartitionsWithIndex
(Since version 1.0.0) use mapPartitionsWithIndex
(Since version 1.0.0) use collect