graphx

Type Members

1. case class Edge[ED](srcId: VertexId = 0, dstId: VertexId = 0, attr: ED = null.asInstanceOf[ED]) extends Serializable with Product

   A single directed edge consisting of a source id, target id, and the data associated with the edge.

2. abstract class EdgeContext[VD, ED, A] extends AnyRef

   Represents an edge along with its neighboring vertices and allows sending messages along the edge.

3. class EdgeDirection extends Serializable

   The direction of a directed edge relative to a vertex.

4. abstract class EdgeRDD[ED] extends RDD[Edge[ED]]

   EdgeRDD[ED, VD] extends RDD[Edge[ED]] by storing the edges in columnar format on each partition for performance.

5. class EdgeTriplet[VD, ED] extends Edge[ED]

   An edge triplet represents an edge along with the vertex attributes of its neighboring vertices.

6. abstract class Graph[VD, ED] extends Serializable

   The Graph abstractly represents a graph with arbitrary objects associated with vertices and edges.

7. class GraphOps[VD, ED] extends Serializable

   Contains additional functionality for Graph.

8. type PartitionID = Int

   Integer identifer of a graph partition.

   Integer identifer of a graph partition. Must be less than 2^30.

9. trait PartitionStrategy extends Serializable

   Represents the way edges are assigned to edge partitions based on their source and destination vertex IDs.

10. class TripletFields extends Serializable

11. type VertexId = Long

    A 64-bit vertex identifier that uniquely identifies a vertex within a graph.

    A 64-bit vertex identifier that uniquely identifies a vertex within a graph. It does not need to follow any ordering or any constraints other than uniqueness.

12. 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.

13. class GraphKryoRegistrator extends KryoRegistrator

    Registers GraphX classes with Kryo for improved performance.