Struct VamanaGraph 

pub struct VamanaGraph {
    pub dim: usize,
    pub r: usize,
    pub alpha: f32,
    pub entry: usize,
    /* private fields */
}

Vamana graph index.

Holds only adjacency data; vector values are not stored here. Use build::build_vamana to populate from a vector slice.

Fields

dim: usize

Vector dimensionality (informational; not enforced here).

r: usize

Maximum out-degree per node (typical: 64).

alpha: f32

α-pruning factor (typical: 1.2). Stored for reference; pruning logic lives in prune::alpha_prune.

entry: usize

Index of the entry-point node (typically the medoid).

Implementations

impl VamanaGraph

pub fn new(dim: usize, r: usize, alpha: f32) -> Self

Create an empty graph with the given parameters.

pub fn len(&self) -> usize

Number of nodes in the graph.

pub fn is_empty(&self) -> bool

Returns true if the graph has no nodes.

pub fn add_node(&mut self, id: u64) -> usize

Add a node with the given external ID; returns its internal index.

pub fn set_neighbors(&mut self, idx: usize, neighbors: Vec<u32>)

Replace the adjacency list for the node at idx.

Truncates neighbors to at most self.r entries.

pub fn neighbors(&self, idx: usize) -> &[u32]

Immutable view of the adjacency list for the node at idx.

pub fn external_id(&self, idx: usize) -> u64

External ID of the node at idx.

pub fn iter(&self) -> impl Iterator<Item = (usize, &VamanaNode)>

Iterate over all nodes as (internal_index, &VamanaNode).