Struct UnionFind 

pub struct UnionFind { /* private fields */ }

A simple disjoint-set (union-find) data structure over integer IDs.

Implementations

impl UnionFind

pub fn new(n: usize) -> Self

Create a new union-find with n singletons (0..n).

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

Find the representative of the component containing x (path compression).

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

Union the components containing x and y. Returns true if they were separate.

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

Check whether x and y are in the same component.

pub fn component_count(&mut self) -> usize

Count the number of distinct components.

pub fn component_of(&mut self, x: usize) -> Vec<usize>

Collect all elements in the same component as x.

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.