Struct QuickFind

pub struct QuickFind<K = Owned> { /* private fields */ }

QuickFind algorithm

Trait Implementations

impl AlgorithmContainer for QuickFind<Owned>

type HeuristicKind<'a> = NoHeuristic

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

type RngKind<'a> = PhantomRng

Any kind of RNG

impl AlgorithmContainer for QuickFind<Borrowed>

type HeuristicKind<'a> = NoHeuristic

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

type RngKind<'a> = PhantomRng

Any kind of RNG

impl<T, K> Connected<T> for QuickFind<K>

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

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

impl<K: Debug> Debug for QuickFind<K>

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

Formats the value using the given formatter.

impl<K: Default> Default for QuickFind<K>

fn default() -> QuickFind<K>

Returns the “default value” for a type.

impl<T, K> Find<T> for QuickFind<K>

where T: VertexType,

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

impl<T, K> Union<T, NoHeuristic> for QuickFind<K>

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

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