Struct KnnGraph 

pub struct KnnGraph {
    pub neighbors: Vec<NeighborList>,
    pub n: usize,
    pub k: usize,
    pub metric: DistanceMetric,
    pub provenance: Option<String>,
}

Portable k-nearest-neighbour graph: per-point indices and distances only.

Fields

neighbors: Vec<NeighborList>

n: usize

k: usize

metric: DistanceMetric

provenance: Option<String>

Implementations

impl KnnGraph

pub fn required_k_for_pacmap(n: usize, n_neighbors: usize) -> usize

Minimum k for PaCMAP mid-near candidate window: min(n_neighbors + 50, n − 1).

pub fn validate( &self, data_n: usize, required_k: usize, metric: DistanceMetric, ) -> Result<(), KnnError>

Validate graph shape / metric for a consumer that needs required_k neighbours.

pub fn validate_for_pacmap( &self, data_n: usize, n_neighbors: usize, config_metric: DistanceMetric, ) -> Result<(), KnnError>

PaCMAP-oriented validation helper.

Trait Implementations

impl Clone for KnnGraph

fn clone(&self) -> KnnGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for KnnGraph

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

Formats the value using the given formatter.