Package: quitefastmst 0.9.1
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:
quitefastmst_0.9.1.tar.gz
quitefastmst_0.9.1.tar.gz(r-4.7-arm64)quitefastmst_0.9.1.tar.gz(r-4.7-x86_64)quitefastmst_0.9.1.tar.gz(r-4.6-arm64)quitefastmst_0.9.1.tar.gz(r-4.6-x86_64)
quitefastmst_0.9.1.tgz(r-4.6-emscripten)
manual.pdf |manual.html✨
card.svg |card.png
quitefastmst/json (API)
NEWS
| # 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
Last updated from:958abe7644. Checks:6 OK. Indexed: no.
| Target | Result | Time | Files | Syslog |
|---|---|---|---|---|
| linux-devel-arm64 | OK | 159 | ||
| linux-devel-x86_64 | OK | 148 | ||
| source / vignettes | OK | 191 | ||
| linux-release-arm64 | OK | 140 | ||
| linux-release-x86_64 | OK | 138 | ||
| wasm-release | OK | 106 |
Exports:knn_euclidmst_euclidomp_get_max_threadsomp_set_num_threads
Dependencies:Rcpp
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 |
