Hierarchical Navigable Small World

Home
Nearest-neighbor search fundamentals
Foundations of similarity search
From proximity graphs to HNSW
High-dimensional geometry
HNSW algorithms and theory
Compression and quantization concepts
Concurrency and parallelism concepts
Building HNSW from scratch
Filtered and hybrid search concepts
Reading real HNSW implementations
Tuning and optimization
Accelerators and scaling
Evaluation and benchmarking
Applications and hybrid retrieval
Dynamics, variants, and frontier research
Appendices
Vector and distance math
Probability and randomization
Algorithms and complexity fundamentals
Core data structures
Graph theory fundamentals
HNSW-specific concepts and parameters
HNSW construction concepts
HNSW search concepts
Complexity and theory specific to HNSW
Recall, accuracy, and query difficulty
Systems and hardware concepts
Memory and storage concepts
Alternative ANN techniques and families
Graph-based ANN alternatives to HNSW
Scaling and distributed search concepts
Persistence and database concepts
Benchmarking and evaluation concepts
Datasets and benchmark suites
Applications and use cases
Failure modes and debugging concepts
Frontier research concepts

Home / Docs / Graph theory fundamentals / What is a k-nearest-neighbor graph (k-NN graph)?

What is a k-nearest-neighbor graph (k-NN graph)?

Created: Sep 23, 20261 min read

Content coming soon.

← PreviousWhat is an adjacency matrix?Next →What is a proximity graph?

On this page

© 2026 Hierarchical Navigable Small World