Represents the way edges are assigned to edge partitions based on their source and destination vertex IDs.
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.
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.
Registers GraphX classes with Kryo for improved performance.
Provides utilities for loading
Contains additional functionality for
Assigns edges to partitions by hashing the source and destination vertex IDs in a canonical direction, resulting in a random vertex cut that colocates all edges between two vertices, regardless of direction.
Assigns edges to partitions using only the source vertex ID, colocating edges with the same source.
Assigns edges to partitions using a 2D partitioning of the sparse edge adjacency matrix, guaranteeing a
Assigns edges to partitions by hashing the source and destination vertex IDs, resulting in a random vertex cut that colocates all same-direction edges between two vertices.
Implements a Pregel-like bulk-synchronous message-passing API.
Represents a subset of the fields of an [[EdgeTriplet]] or [[EdgeContext]].