Struct VamanaGraph 

pub struct VamanaGraph {
    pub neighbors: Vec<Vec<u32>>,
    pub vectors: Vec<Vec<f32>>,
    pub medoid: u32,
    pub config: VamanaConfig,
}

In-memory Vamana graph for building and searching.

Fields

neighbors: Vec<Vec<u32>>

Adjacency lists per node.

vectors: Vec<Vec<f32>>

Vectors, row-major.

medoid: u32

Medoid (entry point) index.

config: VamanaConfig

Build config.

Implementations

impl VamanaGraph

pub fn build(vectors: Vec<Vec<f32>>, config: VamanaConfig) -> Result<Self>

Build a Vamana graph: find medoid, init neighbors, then refine via greedy search + robust prune.

pub fn search(&self, query: &[f32], top_k: usize) -> Vec<(u32, f32)>

Greedy beam search returning top_k (node_id, distance) pairs.

Trait Implementations

impl Clone for VamanaGraph

fn clone(&self) -> VamanaGraph

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for VamanaGraph

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

Formats the value using the given formatter.