Module graph 

Vamana graph for DiskANN

Implements the Vamana graph structure used in Microsoft’s DiskANN. Vamana is a navigable small-world graph optimized for approximate nearest neighbor search on disk-based datasets.

Algorithm

• Each node has at most R neighbors (max_degree)
• Neighbors are selected using robust pruning to ensure good coverage
• Graph supports incremental updates and entry point management

References

• DiskANN: Fast Accurate Billion-point Nearest Neighbor Search on a Single Node (Jayaram Subramanya et al., NeurIPS 2019)

Structs

GraphStats

Graph statistics

VamanaGraph

Vamana graph structure

VamanaGraphHandle

Thread-safe wrapper for VamanaGraph

VamanaNode

A node in the Vamana graph