{"package":"quitefastmst","ecosystem":"cran","latest_version":"0.9.1","description":"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-3","license_risk":"network_copyleft","commercial_use_notes":"AGPL-3.0: blocks closed-source SaaS — network use = distribution. Requires source disclosure to users.","homepage":"https://quitefastmst.gagolewski.com/","repository":"https://github.com/gagolews/quitefastmst","downloads_weekly":121,"health":{"score":50,"risk":"high","breakdown":{"maintenance":20,"popularity":3,"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":"0.9.1","total_count":0,"recent":[]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2026-02-16 01:48:25","last_published":"2026-02-11T16:00:03+00:00","dependencies_count":1,"dependencies":["Rcpp"]},"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":"0.9.1","version_hint":null,"summary":"quitefastmst@0.9.1 is safe to use (health: 50/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}}