Struct QuickUnion

pub struct QuickUnion<H = ByRank<Owned>, const COMPRESS_PATH: bool = true> { /* private fields */ }

QuickUnion algorithm

This algorithm is parameterized by the following

• H - Heuristic Type. Available types: ByRank, BySize, Unweighted
• COMPRESS_PATH - boolean value, enables path compression during find operation

By default, ByRank heuristic is used and path compression is enabled

Trait Implementations

impl AlgorithmContainer for QuickUnion<ByRank<Owned>>

type HeuristicKind<'a> = ByRank

type HeuristicContainer<'a, const N: usize> = [usize; N]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = [V; N]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = PhantomRng

Any kind of RNG

impl<R, const P: bool> AlgorithmContainer for QuickUnion<ByRandom<R>, P>

where R: RngCore,

type HeuristicKind<'a> = ByRandom<R>

type HeuristicContainer<'a, const N: usize> = [usize; 0]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = [V; N]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = R

Any kind of RNG

impl<R, const P: bool> AlgorithmContainer for QuickUnion<ByRandom<R, Borrowed<Thin>>, P>

where R: RngCore,

type HeuristicKind<'a> = ByRandom<R, Borrowed<Thin>>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = R

Any kind of RNG

impl<R, const P: bool> AlgorithmContainer for QuickUnion<ByRandom<R, Borrowed<Fat>>, P>

where R: RngCore,

type HeuristicKind<'a> = ByRandom<R, Borrowed>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = R

Any kind of RNG

impl<const P: bool> AlgorithmContainer for QuickUnion<ByRank<Borrowed<Thin>>, P>

type HeuristicKind<'a> = ByRank<Borrowed<Thin>>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize; N]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V; N]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = PhantomRng

Any kind of RNG

impl<const P: bool> AlgorithmContainer for QuickUnion<ByRank<Borrowed<Fat>>, P>

type HeuristicKind<'a> = ByRank<Borrowed>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = PhantomRng

Any kind of RNG

impl<const P: bool> AlgorithmContainer for QuickUnion<BySize<Borrowed<Thin>>, P>

type HeuristicKind<'a> = BySize<Borrowed<Thin>>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize; N]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V; N]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = PhantomRng

Any kind of RNG

impl<const P: bool> AlgorithmContainer for QuickUnion<BySize<Borrowed<Fat>>, P>

type HeuristicKind<'a> = BySize<Borrowed>

type HeuristicContainer<'a, const N: usize> = &'a mut [usize]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = PhantomRng

Any kind of RNG

impl AlgorithmContainer for QuickUnion<BySize<Owned>>

type HeuristicKind<'a> = BySize

type HeuristicContainer<'a, const N: usize> = [usize; N]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = [V; N]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = PhantomRng

Any kind of RNG

impl<const P: bool> AlgorithmContainer for QuickUnion<Unweighted<Borrowed<Thin>>, P>

type HeuristicKind<'a> = Unweighted<Borrowed<Thin>>

type HeuristicContainer<'a, const N: usize> = [usize; 0]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V; N]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = PhantomRng

Any kind of RNG

impl<const P: bool> AlgorithmContainer for QuickUnion<Unweighted<Borrowed<Fat>>, P>

type HeuristicKind<'a> = Unweighted<Borrowed>

type HeuristicContainer<'a, const N: usize> = [usize; 0]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = &'a mut [V]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = PhantomRng

Any kind of RNG

impl<const P: bool> AlgorithmContainer for QuickUnion<Unweighted<Owned>, P>

type HeuristicKind<'a> = Unweighted

type HeuristicContainer<'a, const N: usize> = [usize; 0]

Any kind of contiguous container

type RepresentativeContainer<'a, V: VertexType + 'a, const N: usize> = [V; N]

Any kind of contiguous container (should not be ZST). R must also live as long as 'a

type RngKind<'a> = PhantomRng

Any kind of RNG

impl<H, T, const PATH_COMPRESS: bool> Connected<T> for QuickUnion<H, PATH_COMPRESS>

where T: VertexType, Self: Find<T>,

fn connected( representative: &mut [T], a: T::IdentifierType, b: T::IdentifierType, ) -> bool

impl<H: Debug, const COMPRESS_PATH: bool> Debug for QuickUnion<H, COMPRESS_PATH>

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

Formats the value using the given formatter.

impl<H: Default, const COMPRESS_PATH: bool> Default for QuickUnion<H, COMPRESS_PATH>

fn default() -> QuickUnion<H, COMPRESS_PATH>

Returns the “default value” for a type.

impl<H, V: VertexType, const COMPRESS_PATH: bool> Find<V> for QuickUnion<H, COMPRESS_PATH>

fn find(representative: &mut [V], a: V::IdentifierType) -> V

impl<H, T, const COMPRESS_PATH: bool> Union<T, H> for QuickUnion<H, COMPRESS_PATH>

where T: VertexType, H: Heuristic, Self: Find<T>,

fn union_sets<'a>( representative: &mut [T], heuristic: &mut [usize], a: T::IdentifierType, b: T::IdentifierType, r: &mut H::RngProvider, )