Package: quitefastmst
Type: Package
Title: Euclidean and Mutual Reachability Minimum Spanning Trees
Version: 0.9.1
Date: 2026-02-11
Authors@R: 
    person("Marek", "Gagolewski",
        role=c("aut", "cre", "cph"),
        email="marek@gagolewski.com",
        comment=c(ORCID="0000-0003-0637-6028"))
Description: 
    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'.
BugReports: https://github.com/gagolews/quitefastmst/issues
URL: https://quitefastmst.gagolewski.com/,
        https://github.com/gagolews/quitefastmst
License: AGPL-3
Imports: Rcpp
Suggests: datasets
LinkingTo: Rcpp
Encoding: UTF-8
SystemRequirements: OpenMP
RoxygenNote: 7.3.3
NeedsCompilation: yes
Packaged: 2026-02-11 16:24:15 UTC; gagolews
Author: Marek Gagolewski [aut, cre, cph] (ORCID:
    <https://orcid.org/0000-0003-0637-6028>)
Maintainer: Marek Gagolewski <marek@gagolewski.com>
Repository: CRAN
Date/Publication: 2026-02-11 17:00:03 UTC
Built: R 4.6.0; x86_64-pc-linux-gnu; 'Wed, 22 Apr 2026 16:46:19 +0900'; unix
