Struct pulau_rs::quickunion::QuickUnion

pub struct QuickUnion<H = ByRank, 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<true>>

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

Any kind of contiguous container

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

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

impl AlgorithmContainer for QuickUnion<ByRank>

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

Any kind of contiguous container

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

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

impl AlgorithmContainer for QuickUnion<BySize<true>>

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

Any kind of contiguous container

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

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

impl AlgorithmContainer for QuickUnion<BySize>

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

Any kind of contiguous container

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

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

impl<const PATH_COMPRESS: bool> AlgorithmContainer for QuickUnion<Unweighted, PATH_COMPRESS>

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

Any kind of contiguous container

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

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

impl<const PATH_COMPRESS: bool> AlgorithmContainer for QuickUnion<Unweighted<true>, PATH_COMPRESS>

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

Any kind of contiguous container

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

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

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, T, const COMPRESS_PATH: bool> Find<T> for QuickUnion<H, COMPRESS_PATH>where
    T: VertexType,

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

impl<H, T, const COMPRESS_PATH: bool> Union<T> for QuickUnion<H, COMPRESS_PATH>where
    T: VertexType,
    H: Heuristic,
    Self: Find<T>,

fn union_sets(
    representative: &mut [T],
    heuristic: &mut [usize],
    a: T::IdentifierType,
    b: T::IdentifierType
)