depscope
Packages
IntegrateAPI DocsCuratorBenchmarkCoverage
Sign inGet API access
depscope/conda/r-emstreer

r-emstreer

condav3.1.3

Fast and easily computes an Euclidean Minimum Spanning Tree (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 empirically the fastest algorithm for computing an EMST. This package also provides functions and an S3 method for readily plotting Minimum Spanning Trees (MST) using either the style of the 'base', 'scatterplot3d', or 'ggplot2' libraries.

License BSD-3-Clausepermissive3 versions1 maintainers0 deps97 weekly dl
allanvc/emstreeR
51
/ 100
Health
use with caution

[email protected] low health (51/100) — consider alternatives

  • Moderate health score (51/100) — verify manually
Health breakdown0 – 100
15/25
maintenance
0/20
popularity
25/25
security
9/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/conda/r-emstreer

First published · 2022-05-19 19:12:55.059000+00:00

Last updated · 2025-12-17 20:18:29.503000+00:00

DepScope

Package intelligence for AI agents. 19 ecosystems.

Resources
API DocumentationHallucination BenchmarkFor EnterpriseSwagger / OpenAPIPopular PackagesCoverageAI Plugin SetupWatch the pitch (60s)
Legal
Legal hubPrivacy PolicyTerms of ServiceCookie PolicyAcceptable UseAttributionDPASub-processorsSecurityImprintContact中文
© 2026 Cuttalo srl — Italy · VAT IT03242390734Built for AI agents