Package: quitefastmst
Type: Package
Title: Euclidean and Mutual Reachability Minimum Spanning Trees
Version: 0.9.2
Date: 2026-09-28
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
Config/roxygen2/version: 8.1.0
NeedsCompilation: yes
Packaged: 2026-10-28 12:15:58 UTC; root
Author: Marek Gagolewski [aut, cre, cph] (ORCID:
        <https://orcid.org/0000-0003-0637-6028>)
Maintainer: Marek Gagolewski <marek@gagolewski.com>
Repository: https://cran.r-universe.dev
Date/Publication: 2026-09-28 09:20:02 UTC
RemoteUrl: https://github.com/cran/quitefastmst
RemoteRef: HEAD
RemoteSha: ff9ae183f19c405d86101c1021e0ff9dbccf90fb