Crandore Hub

N2R

Fast and Scalable Approximate k-Nearest Neighbor Search Methods using 'N2' Library

Implements methods to perform fast approximate K-nearest neighbor search on input matrix. Algorithm based on the 'N2' implementation of an approximate nearest neighbor search using hierarchical Navigable Small World (NSW) graphs. The original algorithm is described in "Efficient and Robust Approximate Nearest Neighbor Search Using Hierarchical Navigable Small World Graphs", Y. Malkov and D. Yashunin, <doi:10.1109/TPAMI.2018.2889473>, <doi:10.48550/arXiv.1603.09320>.

Versions across snapshots

VersionRepositoryFileSize
1.0.5 rolling source/ R- N2R_1.0.5.tar.gz 28.6 KiB
1.0.5 rolling linux/jammy R-4.5 N2R_1.0.5.tar.gz 122.5 KiB
1.0.5 rolling linux/noble R-4.5 N2R_1.0.5.tar.gz 125.1 KiB
1.0.5 latest source/ R- N2R_1.0.5.tar.gz 28.6 KiB
1.0.5 latest linux/jammy R-4.5 N2R_1.0.5.tar.gz 122.5 KiB
1.0.5 latest linux/noble R-4.5 N2R_1.0.5.tar.gz 125.1 KiB
1.0.5 2026-04-26 source/ R- N2R_1.0.5.tar.gz 28.6 KiB
1.0.5 2026-04-23 source/ R- N2R_1.0.5.tar.gz 28.6 KiB
1.0.5 2026-04-09 windows/windows R-4.5 N2R_1.0.5.zip 451.4 KiB
1.0.3 2025-04-20 source/ R- N2R_1.0.3.tar.gz 25.8 KiB

Dependencies (latest)

Depends

Imports

LinkingTo

Suggests