Struct QuickFindUf 

pub struct QuickFindUf<V> { /* private fields */ }

Union-Find implementation with quick find operation.

Trait Implementations

impl<V> Clone for QuickFindUf<V>

where V: Clone + Union,

fn clone(&self) -> QuickFindUf<V>

Returns a duplicate of the value.

fn clone_from(&mut self, other: &QuickFindUf<V>)

Performs copy-assignment from source.

impl<V: Debug> Debug for QuickFindUf<V>

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

Formats the value using the given formatter.

impl<A> Extend<A> for QuickFindUf<A>

fn extend<T>(&mut self, iterable: T)

where T: IntoIterator<Item = A>,

Extends a collection with the contents of an iterator.

fn extend_one(&mut self, item: A)

🔬This is a nightly-only experimental API. (extend_one)

Extends a collection with exactly one element.

fn extend_reserve(&mut self, additional: usize)

🔬This is a nightly-only experimental API. (extend_one)

Reserves capacity in a collection for the given number of additional elements.

impl<A: Union> FromIterator<A> for QuickFindUf<A>

fn from_iter<T: IntoIterator<Item = A>>(iterator: T) -> QuickFindUf<A>

Creates a value from an iterator.

impl<V: Union> UnionFind<V> for QuickFindUf<V>

fn size(&self) -> usize

Returns the size of self.

fn insert(&mut self, data: V) -> usize

Inserts a new set into the union.

fn union(&mut self, key0: usize, key1: usize) -> bool

Join two sets that contains given keys (union operation).

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

Returns the identifier of the set that the key belongs to.

fn get(&mut self, key: usize) -> &V

Returns the reference to the value of the set that the key belongs to.

fn get_mut(&mut self, key: usize) -> &mut V

Returns the mutable reference to the value of the set that the key belongs to.

fn new(len: usize) -> Self

where V: Default,

Creates empty UnionFind struct.