Nothing
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'.
Getting started
Browse package contents
Package details |
|
|---|---|
| Author | Marek Gagolewski [aut, cre, cph] (ORCID: <https://orcid.org/0000-0003-0637-6028>) |
| Maintainer | Marek Gagolewski <marek@gagolewski.com> |
| License | AGPL-3 |
| Version | 0.9.2 |
| URL | https://quitefastmst.gagolewski.com/ https://github.com/gagolews/quitefastmst |
| Package repository | View on CRAN |
| Installation |
Install the latest version of this package by entering the following in R:
|
Try the quitefastmst package in your browser
Any scripts or data that you put into this service are public.
