Struct pulau_rs::quickfind::QuickFind

pub struct QuickFind<const IS_SLICE: bool = false>;

QuickFind algorithm

Trait Implementations

impl AlgorithmContainer for QuickFind<false>

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 AlgorithmContainer for QuickFind<true>

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<T, const IS_SLICE: bool> Connected<T> for QuickFind<IS_SLICE>where
    T: VertexType,
    Self: Find<T>,

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

impl<const IS_SLICE: bool> Debug for QuickFind<IS_SLICE>

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

Formats the value using the given formatter.

impl<const IS_SLICE: bool> Default for QuickFind<IS_SLICE>

fn default() -> QuickFind<IS_SLICE>

Returns the “default value” for a type.

impl<T, const IS_SLICE: bool> Find<T> for QuickFind<IS_SLICE>where
    T: VertexType,

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

impl<T, const IS_SLICE: bool> Union<T> for QuickFind<IS_SLICE>where
    T: VertexType,
    Self: Find<T>,

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