quitefastmst

cranv0.9.1

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 p

License AGPL-3network copyleft0 versions1 maintainers1 deps121 weekly dl
gagolews/quitefastmst
50
/ 100
Health
safe to use

[email protected] is safe to use (health: 50/100)

Health breakdown0 – 100
20/25
maintenance
3/20
popularity
25/25
security
0/15
maturity
2/15
community
Vulnerabilities
0
none known

Health History

Dependency Tree

License Audit

Dependencies (1)
Rcpp
API access

Get this data programmatically — free, no authentication.

curl https://depscope.dev/api/check/cran/quitefastmst

First published · 2026-02-16 01:48:25

Last updated · 2026-02-11T16:00:03+00:00