This project implements the Vamana algorithm, designed for efficient k-nearest neighbor (k-NN) search in high-dimensional data spaces.
- Graph construction / indexing
- Fast query routing on the graph
- Focus on performance and memory efficiency
- Written in C++
- C++
- Data structures & graph algorithms
- Performance-oriented implementation
My Contribution
- Implemented the Vamana-style graph construction and query logic
- Designed and implemented unit tests using Google Test
- Structured the build system and Makefile
- Focused on correctness, performance, and clean C++ design
Notes This project was developed as part of academic coursework. The implementation reflects my personal contribution to the algorithm and system design.
sudo apt-get update sudo apt-get install libgtest-dev cmake
cd /usr/src/gtest sudo cmake . sudo make sudo cp lib/libgtest*.a /usr/lib/
make
make test
make run