Enum GraphPartitionMethod 

#[non_exhaustive]
pub enum GraphPartitionMethod {
    HashBased,
    EdgeCut,
    VertexCut,
    Fennel,
}

Method used to partition a graph’s vertices across shards.

Variants (Non-exhaustive)

Non-exhaustive enums could have additional variants added in future. Therefore, when matching against variants of non-exhaustive enums, an extra wildcard arm must be added to account for any future variants.

HashBased

Hash-based: vertex_id % n_partitions (deterministic, zero overhead).

EdgeCut

Edge-cut: assign each edge to the source vertex’s shard.

VertexCut

Vertex-cut: assign each edge to the shard of the lower-degree endpoint.

Fennel

Streaming FENNEL (Tsourakakis et al. 2014): maximise local density while penalising shard imbalance.

Trait Implementations

impl Clone for GraphPartitionMethod

fn clone(&self) -> GraphPartitionMethod

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for GraphPartitionMethod

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.

impl PartialEq for GraphPartitionMethod

fn eq(&self, other: &GraphPartitionMethod) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for GraphPartitionMethod

impl StructuralPartialEq for GraphPartitionMethod