admin/hnsw
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity
hnsw/README.md
wangziao 7b00e272d7 use best first search, not greedy routing
2025-05-18 11:31:38 -07:00

575 B
Raw Blame History

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:

Fixed code to avoid using greedy routing. Previous results are in result-greedy.csv. We have not yet seen a difference in results, but the logic is different.