Source: r-cran-quitefastmst
Standards-Version: 4.7.4
Maintainer: Debian R Packages Maintainers <r-pkg-team@alioth-lists.debian.net>
Uploaders:
 Charles Plessy <plessy@debian.org>,
Section: gnu-r
Testsuite: autopkgtest-pkg-r
Build-Depends:
 debhelper-compat (= 13),
 dh-r,
 r-base-dev,
 r-cran-rcpp,
 architecture-is-64-bit,
 architecture-is-little-endian,
Vcs-Browser: https://salsa.debian.org/r-pkg-team/r-cran-quitefastmst
Vcs-Git: https://salsa.debian.org/r-pkg-team/r-cran-quitefastmst.git
Homepage: https://cran.r-project.org/package=quitefastmst
Rules-Requires-Root: no

Package: r-cran-quitefastmst
Architecture: any
Depends:
 ${R:Depends},
 ${shlibs:Depends},
 ${misc:Depends},
Recommends:
 ${R:Recommends},
Suggests:
 ${R:Suggests},
Description: Euclidean and Mutual Reachability Minimum Spanning Trees
 Functions to compute Euclidean minimum spanning trees using single-, sesqui-,
 and dual-tree Boruvka algorithms. Thanks to K-d trees, they are fast
 in spaces of low intrinsic dimensionality. Mutual reachability distances
 (used in the definition of the 'HDBSCAN*' algorithm) are supported too.
 The package also includes relatively fast fallback minimum spanning tree
 and nearest-neighbours algorithms for spaces of higher dimensionality.
 The 'Python' version of 'quitefastmst' is available via 'PyPI'.