Struct KnnGraph 

pub struct KnnGraph { /* private fields */ }

Deterministic directed KNN candidate graph in compressed-row form.

This is deliberately not a semantic or domain graph: consumers decide how to interpret, threshold, symmetrize, or add provenance to candidate edges.

Implementations

impl KnnGraph

pub fn build(index: &VectorIndex, neighbors: usize) -> Result<Self, SearchError>

Builds an approximate directed KNN graph with bounded query workers.

Errors

Returns a typed query, worker, capacity, or allocation error.

pub fn build_exact( index: &VectorIndex, neighbors: usize, ) -> Result<Self, SearchError>

Builds an exact directed KNN graph for oracle and small-corpus use.

Errors

Returns a typed query, worker, capacity, or allocation error.

pub fn len(&self) -> usize

pub fn is_empty(&self) -> bool

pub fn edge_count(&self) -> usize

pub fn nodes(&self) -> impl ExactSizeIterator<Item = u64> + '_

pub fn neighbors(&self, source: u64) -> Option<&[NeighborEdge]>

pub fn edges(&self) -> impl ExactSizeIterator<Item = NeighborEdge> + '_

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

Formats the value using the given formatter.

impl PartialEq for KnnGraph

fn eq(&self, other: &KnnGraph) -> bool

Equality operator ==.

fn ne(&self, other: &Rhs) -> bool

Inequality operator !=.

impl StructuralPartialEq for KnnGraph