Struct UnionFind 

pub struct UnionFind {
    pub parent: Vec<usize>,
    pub rank: Vec<usize>,
}

Union–Find (disjoint-set) data structure for Kruskal’s algorithm.

Fields

parent: Vec<usize>

Parent pointers; parent[i] == i for root nodes.

rank: Vec<usize>

Union-by-rank array.

Implementations

impl UnionFind

pub fn new(n: usize) -> Self

Create a new UnionFind with n singleton sets.

pub fn find(&mut self, i: usize) -> usize

Find the representative of the set containing i (path compression).

pub fn union(&mut self, i: usize, j: usize) -> bool

Union the sets containing i and j. Returns true if they were in different sets (a merge happened).

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.