Vector search: Small worlds

Vector search: The problem, Part 2. Approximate nearest neighbor search by walking on a graph. From the naive proximity graph and its local-minimum failure, through Watts-Strogatz small-world graphs, to HNSW, the workhorse of every modern vector database.