HNSW Explorer

Graph

Links per node (M) 5

Build breadth (efC) 24

Prune slack (alpha)

Changing any setting rebuilds the graph from the same points. efC is efConstruction. Alpha above 1 keeps longer layer 0 links, as DiskANN RobustPrune does.

Point

x y z

Each coordinate runs from -1 to 1.

Delete needs a node at these coordinates. Click a node to fill them in.

Search breadth (ef) 12

Search returns the 5 nearest nodes (k = 5) and uses at least k as breadth.

Hash count (k) 2

Used in both entry point modes. More hashes make smaller buckets. Bucket width is w = 1.

Playback

Speed (steps per second) 8

Graph layers

Add a node or run a search to watch the algorithm work.

Point at a node to see its details. Drag the layers to rotate them. Click them, then scroll to zoom.

The code running now

Legend

Node
Two-way link
One-way link
Same node, next layer
Greedy step
Drop a layer
Explored
In list (size ef)
Current node
Returned best K
Query or new point
Entry point
True neighbour missed
Link just added
Link just pruned
LSH bucket member
LSH seed
Skipped by LSH