577 B
577 B
hnsw
Hierarchical Navigable Small World - demonstration of concept implementation in Python
Implementation mainly referenced the paper Efficient and robust approximate nearest neighbor search using Hierarchical Navigable Small World graphs however I made simplifications.
I don't care about performance. That said, we can still compare the relative running time?
Update:
Fix issue #1: Avoided using greedy routing. Previous results are in result-greedy.csv. We have not yet seen a difference in results, but the logic is different.