quitefastmst: 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 also supported. The package also features relatively fast fallback minimum spanning tree and nearest-neighbours algorithms for spaces of higher dimensionality. The 'Python' version of 'quitefastmst' is available via 'PyPI'.

Version:	0.9.0
Imports:	Rcpp
LinkingTo:	Rcpp
Suggests:	datasets
Published:	2025-07-23
DOI:	10.32614/CRAN.package.quitefastmst
Author:	Marek Gagolewski [aut, cre, cph]
Maintainer:	Marek Gagolewski <marek at gagolewski.com>
BugReports:	https://github.com/gagolews/quitefastmst/issues
License:	AGPL-3
URL:	https://quitefastmst.gagolewski.com/, https://github.com/gagolews/quitefastmst
NeedsCompilation:	yes
SystemRequirements:	OpenMP, C++17
Materials:	NEWS
CRAN checks:	quitefastmst results

Documentation:

Reference manual:

quitefastmst.html , quitefastmst.pdf

Downloads:

Package source:	quitefastmst_0.9.0.tar.gz
Windows binaries:	r-devel: quitefastmst_0.9.0.zip, r-release: quitefastmst_0.9.0.zip, r-oldrel: quitefastmst_0.9.0.zip
macOS binaries:	r-release (arm64): quitefastmst_0.9.0.tgz, r-oldrel (arm64): quitefastmst_0.9.0.tgz, r-release (x86_64): quitefastmst_0.9.0.tgz, r-oldrel (x86_64): quitefastmst_0.9.0.tgz

Reverse dependencies:

Reverse imports:

genieclust

Linking:

Please use the canonical form https://CRAN.R-project.org/package=quitefastmst to link to this page.