Package: quitefastmst 0.9.2

Marek Gagolewski

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]

quitefastmst_0.9.2.tar.gz
quitefastmst_0.9.2.zip(r-4.7-x86_64)quitefastmst_0.9.2.zip(r-4.7-arm64)quitefastmst_0.9.2.zip(r-4.6-x86_64)quitefastmst_0.9.2.zip(r-4.6-arm64)
quitefastmst_0.9.2.tar.gz(r-4.7-arm64)quitefastmst_0.9.2.tar.gz(r-4.7-x86_64)quitefastmst_0.9.2.tar.gz(r-4.6-arm64)quitefastmst_0.9.2.tar.gz(r-4.6-x86_64)
quitefastmst_0.9.2.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
DESCRIPTION |NEWS
card.svg |card.png
quitefastmst/json (API)

# Install 'quitefastmst' in R:
install.packages('quitefastmst', repos = c('https://cran.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:

Conda:

cppopenmp

3.17 score 11 packages 2.2k downloads 4 exports 1 dependencies

Last updated from:ff9ae183f1. Checks:10 OK. Indexed: no.

TargetResultTimeFilesSyslog
linux-devel-arm64OK118
linux-devel-x86_64OK124
source / vignettesOK248
linux-release-arm64OK151
linux-release-x86_64OK197
windows-devel-arm64OK330
windows-devel-x86_64OK185
windows-release-arm64OK205
windows-release-x86_64OK151
wasm-releaseOK117

Exports:knn_euclidmst_euclidomp_get_max_threadsomp_set_num_threads

Dependencies:Rcpp