Struct ClusterGraph 

pub struct ClusterGraph { /* private fields */ }

Undirected similarity graph over records.

Each node is a RecordId; each edge weight is the match_probability of the AutoMatch pair that connected those two records.

Implementations

impl ClusterGraph

pub fn new() -> Self

pub fn add_pairs(&mut self, pairs: &[ScoredPair])

Add AutoMatch pairs to the graph. Non-AutoMatch pairs are ignored.

pub fn compute_clusters(&self, config: &ClusterConfig) -> Vec<Vec<RecordId>>

Compute clusters using the two-phase chain-breaking algorithm:

1. Weak-edge removal: remove all edges with weight < config.within_cluster_min then extract connected components.
2. Star pruning: for any component whose size exceeds config.max_cluster_size, find the hub (highest-degree node in the original graph), remove all non-hub edges below the min threshold, and re-extract components from that sub-graph.

Returns only non-trivial components (size ≥ 2).

Trait Implementations

impl Default for ClusterGraph

fn default() -> Self

Returns the “default value” for a type.