Struct ConstraintGraph 

pub struct ConstraintGraph { /* private fields */ }

Undirected constraint graph over entity variables. Self-loops are meaningless for binary constraints and rejected at construction; unconnected variables still form singleton components so no variable can silently drop out of the solve.

Implementations

impl ConstraintGraph

pub fn new( num_variables: u32, edges: impl IntoIterator<Item = (u32, u32)>, ) -> Self

pub fn decompose(&self) -> Vec<Component>

Deterministic connected-component decomposition: union-find over the edges, components ordered by their minimum variable index, members ascending, edges normalized and sorted. The same graph decomposes identically regardless of edge input order.