Struct UnionFind 

pub struct UnionFind { /* private fields */ }

Union-Find (Disjoint Set Union) data structure with path compression and union by rank.

This implementation uses both optimizations to achieve near-O(1) amortized time per operation:

• Path compression: Flatten tree during find operations
• Union by rank: Attach smaller tree under root of larger tree

TIGER-06 Mitigation

Path compression prevents worst-case O(n) find operations. Union by rank keeps trees balanced.

Implementations

impl UnionFind

pub fn new(n: usize) -> Self

Create a new union-find structure with n elements

pub fn find(&mut self, x: usize) -> Option<usize>

Find the root of the set containing x, with path compression.

Returns None if max iterations exceeded.

pub fn union(&mut self, x: usize, y: usize) -> bool

Union the sets containing x and y, using union by rank.

Returns true if a union was performed, false if already in same set or error.

pub fn count_components(&mut self, method_count: usize) -> usize

Count the number of unique connected components.

Only counts components for the first method_count elements (ignoring fields that are only connected to a single method).

pub fn get_components(&mut self) -> HashMap<usize, Vec<usize>>

Get components as groups of indices.

pub fn limit_exceeded(&self) -> bool

Check if iteration limit was exceeded

Trait Implementations

impl Clone for UnionFind

fn clone(&self) -> UnionFind

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for UnionFind

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

Formats the value using the given formatter.