Struct algorithms_edu::data_structures::union_find::UnionFind

pub struct UnionFind { /* fields omitted */ }

Vector-based union-find representing a set of disjoint sets.

Implementations

impl UnionFind

pub fn with_size(size: usize) -> Self

pub fn with_ranks(ranks: Vec<usize>) -> Self

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn extend(&mut self, size: usize)

pub fn union(&mut self, a: usize, b: usize) -> bool

Try to union two sets.

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

Finds the representative element for the given element’s set.

pub fn in_same_set(&mut self, a: usize, b: usize) -> bool

pub fn parent(&self, element: usize) -> usize

pub fn set_parent(&mut self, element: usize, parent: usize)

Trait Implementations

impl Clone for UnionFind

pub fn clone(&self) -> UnionFind

Returns a copy of the value.

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

Performs copy-assignment from source.