Struct UnionFind 

pub struct UnionFind<T: Hash + Eq + Clone> { /* private fields */ }

Disjoint-set union–find with union by rank and path compression.

Implementations

impl<T: Hash + Eq + Clone> UnionFind<T>

pub fn new(elements: impl IntoIterator<Item = T>) -> Self

Create a new union–find structure for the given elements.

pub fn find(&mut self, x: &T) -> Result<T, Error>

Return the representative of the set containing x.

pub fn union(&mut self, x: &T, y: &T) -> Result<bool, Error>

Merge the sets containing x and y.

pub fn connected(&mut self, x: &T, y: &T) -> Result<bool, Error>

Return whether x and y are in the same set.

pub fn count(&mut self) -> usize

Return the current number of disjoint sets.