Source: r-cran-densityclust
Section: gnu-r
Priority: optional
Maintainer: Debian R Packages Maintainers <r-pkg-team@alioth-lists.debian.net>
Uploaders: Andreas Tille <tille@debian.org>
Vcs-Browser: https://salsa.debian.org/r-pkg-team/r-cran-densityclust
Vcs-Git: https://salsa.debian.org/r-pkg-team/r-cran-densityclust.git
Homepage: https://cran.r-project.org/package=densityClust
Standards-Version: 4.6.2
Rules-Requires-Root: no
Build-Depends: debhelper-compat (= 13),
               dh-r,
               r-base-dev,
               r-cran-fnn,
               r-cran-ggplot2,
               r-cran-ggrepel,
               r-cran-gridextra,
               r-cran-rcolorbrewer,
               r-cran-rtsne,
               r-cran-cpp11
Testsuite: autopkgtest-pkg-r

Package: r-cran-densityclust
Architecture: any
Depends: ${R:Depends},
         ${shlibs:Depends},
         ${misc:Depends}
Recommends: ${R:Recommends}
Suggests: ${R:Suggests}
Description: GNU R clustering by fast search and find of density peaks
 An improved implementation (based on k-nearest neighbors) of the
 density peak clustering algorithm, originally described by Alex Rodriguez
 and Alessandro Laio (Science, 2014 vol. 344). It can handle large datasets
 (> 100, 000 samples) very efficiently. It was initially implemented by
 Thomas Lin Pedersen, with inputs from Sean Hughes and later improved by
 Xiaojie Qiu to handle large datasets with kNNs.