emstreeR
cranv3.1.3Tools for Fast Computing and Visualizing Euclidean Minimum Spanning Trees. Fast and easy computation of Euclidean Minimum Spanning Trees (EMST) from data, relying on the R API for 'mlpack' - the C++ Machine Learning Library (Curtin et. al., 2013). 'emstreeR' uses the Dual-Tree Boruvka (March, Ram, Gray, 2010, <doi:10.1145/1835804.1835882>), which is theoretically and empir
License BSD_3_clause + file LICENSE0 versions1 maintainers6 deps94 weekly dl
https://CRAN.R-project.org/package=emstreeR42
/ 100
Health
safe to use
[email protected] is safe to use (health: 42/100)
Health breakdown0 – 100
15/25
maintenance
0/20
popularity
25/25
security
0/15
maturity
2/15
community
Vulnerabilities
0
none known
Health History
Dependency Tree
License Audit
API access
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/cran/emstreeRFirst published · 2025-12-17 17:00:26
Last updated · 2025-12-17T15:10:02+00:00