Struct smartcore::algorithm::neighbour::fastpair::FastPair

pub struct FastPair<'a, T: RealNumber + FloatNumber, M: Array2<T>> {
    pub distances: HashMap<usize, PairwiseDistance<T>>,
    pub neighbours: Vec<usize>,
    /* private fields */
}

Inspired by Python implementation: https://github.com/carsonfarmer/fastpair/blob/b8b4d3000ab6f795a878936667eee1b557bf353d/fastpair/base.py MIT License (MIT) Copyright (c) 2016 Carson Farmer

affinity used is Euclidean so to allow linkage with single, ward, complete and average

Fields

distances: HashMap<usize, PairwiseDistance<T>>

closest pair hashmap (connectivity matrix for closest pairs)

neighbours: Vec<usize>

conga line used to keep track of the closest pair

Implementations

impl<'a, T: RealNumber + FloatNumber, M: Array2<T>> FastPair<'a, T, M>

pub fn new(m: &'a M) -> Result<Self, Failed>

Constructor Instantiate and inizialise the algorithm

pub fn closest_pair(&self) -> PairwiseDistance<T>

Find closest pair by scanning list of nearest neighbors.

Trait Implementations

impl<'a, T: Clone + RealNumber + FloatNumber, M: Clone + Array2<T>> Clone for FastPair<'a, T, M>

fn clone(&self) -> FastPair<'a, T, M>

Returns a copy of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl<'a, T: Debug + RealNumber + FloatNumber, M: Debug + Array2<T>> Debug for FastPair<'a, T, M>

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

Formats the value using the given formatter.