Package: quitefastmst 0.9.1.9001

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 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'.

Authors:Marek Gagolewski [aut, cre, cph]

# Install 'quitefastmst' in R:

install.packages('quitefastmst', repos = c('https://gagolews.r-universe.dev', 'https://cloud.r-project.org'))

Bug tracker:https://github.com/gagolews/quitefastmst/issues

Uses libs:

c++– GNU Standard C++ Library v3
openmp– GCC OpenMP (GOMP) support library

On CRAN:

cluster-analysis clustering clustering-evaluation euclidean-distances genie hdbscan hdbscan-clustering-algorithm machine-learning machine-learning-algorithms minimum-spanning-tree mst mutual-reachability-distance neighbor-search outlier-detection cpp openmp

5.31 score 1 stars 9 packages 402 downloads 4 exports 1 dependencies

Last updated from:4d087f9105. Checks:13 OK. Indexed: yes.

Target	Result	Time
linux-devel-arm64	OK	173
linux-devel-x86_64	OK	146
source / vignettes	OK	171
linux-release-arm64	OK	155
linux-release-x86_64	OK	145
macos-release-arm64	OK	170
macos-release-x86_64	OK	368
macos-oldrel-arm64	OK	94
macos-oldrel-x86_64	OK	221
windows-devel	OK	145
windows-release	OK	169
windows-oldrel	OK	149
wasm-release	OK	117

Exports:knn_euclid mst_euclid omp_get_max_threads omp_set_num_threads

Dependencies:Rcpp

Citation

Development and contributors

Readme and manuals

Help Manual

Help page	Topics
Euclidean Nearest Neighbours	knn_euclid
Euclidean and Mutual Reachability Minimum Spanning Trees	mst_euclid
Get or Set the Number of Threads	omp_get_max_threads omp_set_num_threads