Struct StreamingPartitioner 

pub struct StreamingPartitioner { /* private fields */ }

A stateful online streaming partitioner.

Nodes arrive one at a time (with their adjacency list as observed so far). Each call to assign_vertex makes an irrevocable assignment based on already-assigned neighbors.

Example

use scirs2_graph::partitioning::{StreamingPartitioner, StreamingPartitionConfig, StreamingPartitionAlgorithm};

let config = StreamingPartitionConfig { n_parts: 3, ..Default::default() };
let mut sp = StreamingPartitioner::new(10, config);
// Assign node 0 with no neighbors yet
let part = sp.assign_vertex(0, &[]);
assert!(part < 3);

Implementations

impl StreamingPartitioner

pub fn new(n_nodes: usize, config: StreamingPartitionConfig) -> Self

Create a new streaming partitioner for n_nodes nodes.

pub fn assign_vertex(&mut self, v: usize, neighbors: &[(usize, f64)]) -> usize

Assign vertex v to a partition given its (already-known) neighbors.

Only neighbors whose partition is already determined influence the score. Returns the assigned partition ID.

pub fn current_partition(&self) -> &[Option<usize>]

Return the current partition assignments (None = not yet assigned).

pub fn edge_cut_estimate(&self, adj: &[Vec<(usize, f64)>]) -> usize

Estimate the edge cut from the current partition state.

Only counts edges where both endpoints are assigned and in different parts. Counts each undirected edge once.