Struct VamanaGraph 

pub struct VamanaGraph {
    pub neighbors: Vec<Vec<u32>>,
    pub medoid: u32,
    pub max_degree: usize,
    pub build_beam: usize,
    pub alpha: f32,
}

Vamana graph with bounded out-degree

Fields

neighbors: Vec<Vec<u32>>

medoid: u32

max_degree: usize

build_beam: usize

alpha: f32

Implementations

impl VamanaGraph

pub fn new(n: usize, max_degree: usize, build_beam: usize, alpha: f32) -> Self

pub fn build(&mut self, vectors: &FlatVectors) -> Result<()>

Build the Vamana graph over flat vector storage

pub fn greedy_search_fast( &self, vectors: &FlatVectors, query: &[f32], beam_width: usize, visited: &mut VisitedSet, ) -> (Vec<u32>, usize)

Greedy beam search with reusable VisitedSet (zero-alloc per query)

pub fn greedy_search( &self, vectors: &FlatVectors, query: &[f32], beam_width: usize, ) -> (Vec<u32>, usize)

Public search entry point (allocates its own VisitedSet)