July 2017
Intermediate to advanced
796 pages
18h 55m
English
The EdgeRDD represents the set of Edges between the vertices and is a member of the Graph class as seen earlier. EdgeRDD, just like VertexRDD, extends from RDD and takes both Edge attributes and Vertex attributes.
EdgeRDD[ED, VD] extends RDD[Edge[ED]] by storing the edges in columnar format on each partition for performance. It may additionally store the vertex attributes associated with each edge to provide the triplet view:
class EdgeRDD[ED]() extends RDD[Edge[ED]]
EdgeRDD also implements many functions, which provide important functionality related to graph operations. Each function typically accepts inputs of edges represented by EdgeRDD. Each Edge consists of a source vertexId, destination vertexId and edge attributes such as ...
Read now
Unlock full access