# 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](https://arxiv.org/abs/1603.09320) however I made simplifications.

I don't care about performance. That said, we can still compare the relative running time?