Package: N2R
Type: Package
Title: Fast and Scalable Approximate k-Nearest Neighbor Search Methods
        using 'N2' Library
Version: 1.0.1
Authors@R: c(person("Peter", "Kharchenko", email = "Peter_Kharchenko@hms.harvard.edu", role = c("aut")), person("Viktor", "Petukhov", email = "viktor.s.petukhov@ya.ru", role = c("aut")), person("Dirk", "Eddelbuettel", email="edd@debian.org", role=c("ctb")), person("Evan", "Biederstedt", email = "evan.biederstedt@gmail.com", role=c("cre", "aut")))
Description: 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>, <arXiv:1603.09320>.
License: Apache License 2.0
Encoding: UTF-8
Depends: Matrix
Imports: Rcpp (>= 1.0.4)
Suggests: testthat
LinkingTo: Rcpp, RcppSpdlog, RcppEigen
SystemRequirements: C++11, GNU make
RoxygenNote: 7.1.2
URL: https://github.com/kharchenkolab/N2R
BugReports: https://github.com/kharchenkolab/N2R/issues
NeedsCompilation: yes
Author: Peter Kharchenko [aut],
  Viktor Petukhov [aut],
  Dirk Eddelbuettel [ctb],
  Evan Biederstedt [cre, aut]
Maintainer: Evan Biederstedt <evan.biederstedt@gmail.com>
Packaged: 2022-01-18 02:29:09 UTC; evanbiederstedt
Repository: CRAN
Date/Publication: 2022-01-18 16:12:42 UTC
Built: R 4.0.5; x86_64-w64-mingw32; 2022-04-21 06:48:53 UTC; windows
Archs: i386, x64
