Fast and Scalable Approximate k-Nearest Neighbor Search Methods using 'N2' Library R package N2R version 1.0.5 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>. Software Depends: Matrix Imports: Rcpp (>= 1.0.4) LinkingTo: Rcpp, BH, RcppSpdlog, RcppEigen Suggests: testthat Evan Biederstedt <evan.biederstedt@gmail.com> Comprehensive R Archive Network (CRAN) Peter Kharchenko [aut], Viktor Petukhov [aut], Dirk Eddelbuettel [ctb], Evan Biederstedt [cre, aut] Apache License 2.0 2026-03-30 application/tgz https://CRAN.R-project.org/package=N2R doi:10.32614/CRAN.package.N2R