Expand description
Vamana graph construction with α-robust pruning
Optimized with:
- FlatVectors (contiguous memory, cache-friendly)
- VisitedSet (O(1) clear via generation counter)
- Rayon-parallel medoid finding
Structs§
- Vamana
Graph - Vamana graph with bounded out-degree