{"package":"emstreeR","ecosystem":"cran","latest_version":"3.1.3","description":"Tools 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 LICENSE","license_risk":"unknown","commercial_use_notes":"verify manually — license not parseable / not declared.","homepage":"https://cran.r-project.org/package=emstreeR","repository":"https://CRAN.R-project.org/package=emstreeR","downloads_weekly":94,"health":{"score":42,"risk":"high","breakdown":{"maintenance":15,"popularity":0,"security":25,"maturity":0,"community":2},"deprecated":false,"max_score":100},"vulnerabilities":{"count":0,"critical":0,"high":0,"medium":0,"low":0,"details":[]},"versions":{"latest":"3.1.3","total_count":0,"recent":[]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2025-12-17 17:00:26","last_published":"2025-12-17T15:10:02+00:00","dependencies_count":6,"dependencies":["mlpack","scatterplot3d","ggplot2","graphics","stats","sf"]},"github_stats":null,"bundle":null,"typescript":null,"known_issues":{"bugs_count":0,"bugs_severity":{},"status_breakdown":{},"link":null,"scope":"none"},"historical_compromise":null,"recommendation":{"action":"safe_to_use","issues":[],"use_version":"3.1.3","version_hint":null,"summary":"emstreeR@3.1.3 is safe to use (health: 42/100)"},"version_scoped":null,"requested_version":null,"_cache":"hit","_response_ms":0,"_powered_by":"depscope.dev — free package intelligence for AI agents","typosquat":{"is_suspected":false},"maintainer_trust":{"available":false},"malicious":{"is_malicious":false},"scorecard":{"available":false},"quality":{"available":false}}