A single directed edge consisting of a source id, target id, and the data associated with the edge.
Represents an edge along with its neighboring vertices and allows sending messages along the edge.
The direction of a directed edge relative to a vertex.
EdgeRDD[ED, VD] extends
RDD[Edge[ED]] by storing the edges in columnar format on each
partition for performance.
An edge triplet represents an edge along with the vertex attributes of its neighboring vertices.
The Graph abstractly represents a graph with arbitrary objects associated with vertices and edges.
Contains additional functionality for Graph.
Integer identifer of a graph partition.
Represents the way edges are assigned to edge partitions based on their source and destination vertex IDs.
A 64-bit vertex identifier that uniquely identifies a vertex within a graph.
RDD[(VertexId, VD)] by ensuring that there is only one entry for each vertex and by
pre-indexing the entries for fast, efficient joins.
Registers GraphX classes with Kryo for improved performance.
A set of EdgeDirections.
The Graph object contains a collection of routines used to construct graphs from RDDs.
Provides utilities for loading Graphs from files.
Collection of built-in PartitionStrategy implementations.
Implements a Pregel-like bulk-synchronous message-passing API.
The VertexRDD singleton is used to construct VertexRDDs.
Various analytics functions for graphs.
Collections of utilities used by graphx.