Struct PartitionResult 

pub struct PartitionResult {
    pub partitions: Vec<AHashSet<i64>>,
    pub cut_edges: Vec<(i64, i64)>,
    pub node_to_partition: HashMap<i64, usize>,
}

Result of graph partitioning computation.

Represents a partitioning of a graph into k subsets, used for sharding, load balancing, and locality optimization in distributed systems.

Fields

• partitions: Vector of partitions, each a set of node IDs
• cut_edges: Edges crossing partition boundaries (communication cost)
• node_to_partition: Mapping from node ID to partition index (0-based)

Example

let graph = SqliteGraph::open_in_memory()?;
// ... build graph ...
let result = partition_kway(&graph, &PartitionConfig::default())?;

println!("Number of partitions: {}", result.partitions.len());
println!("Cut edges (communication cost): {}", result.cut_edges.len());
// Find which partition node 5 is in
if let Some(&pidx) = result.node_to_partition.get(&5) {
    println!("Node 5 is in partition {}", pidx);
}

Fields

partitions: Vec<AHashSet<i64>>

Vector of partitions, each a set of node IDs

cut_edges: Vec<(i64, i64)>

Edges crossing partition boundaries (for communication cost analysis)

node_to_partition: HashMap<i64, usize>

Node ID -> partition index mapping

Trait Implementations

impl Clone for PartitionResult

fn clone(&self) -> PartitionResult

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PartitionResult

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

Formats the value using the given formatter.

impl PartialEq for PartitionResult

fn eq(&self, other: &PartitionResult) -> 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 PartitionResult

impl StructuralPartialEq for PartitionResult