Package: r-cran-quitefastmst
Version: 0.9.1-1
Architecture: arm64
Maintainer: Ubuntu Developers <ubuntu-devel-discuss@lists.ubuntu.com>
Original-Maintainer: Debian R Packages Maintainers <r-pkg-team@alioth-lists.debian.net>
Installed-Size: 1769
Depends: r-api-4.0, r-cran-rcpp, libc6 (>= 2.43), libgcc-s1 (>= 3.0), libgomp1 (>= 4.9), libstdc++6 (>= 14)
Section: gnu-r
Priority: optional
Homepage: https://cran.r-project.org/package=quitefastmst
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'.
