{"package":"r-quitefastmst","ecosystem":"conda","latest_version":"0.9.1","description":"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 also supported.  The package also features relatively fast fallback minimum spanning tree and nearest-neighbours algorithms for spaces of higher dimensionality.  The 'Python' version of 'quitefastmst' is available via 'PyPI'.","license":"AGPL-3.0-only","license_risk":"unknown","commercial_use_notes":"verify manually — license not parseable / not declared.","homepage":"https://quitefastmst.gagolewski.com/","repository":"https://github.com/gagolews/quitefastmst","downloads_weekly":109,"health":{"score":53,"risk":"high","breakdown":{"maintenance":20,"popularity":3,"security":25,"maturity":3,"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":2,"recent":["0.9.0","0.9.1"]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2025-08-03 23:30:03.154000+00:00","last_published":"2026-02-12 00:40:25.531000+00:00","dependencies_count":0,"dependencies":[]},"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":"use_with_caution","issues":["Moderate health score (53/100) — verify manually"],"use_version":"0.9.1","version_hint":null,"summary":"r-quitefastmst@0.9.1 low health (53/100) — consider alternatives"},"version_scoped":null,"_meta":{"endpoint":"check","tier":"full","philosophy":"DepScope is free. Use the cheapest endpoint that answers your real question.","cheaper_alternatives":[{"endpoint":"/api/exists/conda/r-quitefastmst","tokens_estimated":12,"use_when":"you only need to know if the package exists (hallucination guard)"},{"endpoint":"/api/health/conda/r-quitefastmst","tokens_estimated":80,"use_when":"you only need a 0-100 score for go/no-go (>=70 = safe)"},{"endpoint":"/api/prompt/conda/r-quitefastmst","tokens_estimated":280,"use_when":"you want a plain-text LLM-friendly brief instead of JSON"},{"endpoint":"POST /api/check_bulk","tokens_estimated":60,"use_when":"you have 5+ packages to check; sends one round-trip instead of N"}],"docs":"https://depscope.dev/integrate","hint_bulk":"You've called /api/check 9 times in 60s. Save bandwidth + tokens with POST /api/check_bulk (1 round-trip for N pkgs)."},"requested_version":null,"_cache":"miss","_response_ms":478,"_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},"version_history_summary":{"total_versions":2,"first_release_age_days":273,"last_release_days_ago":81,"avg_days_between_releases":273,"release_velocity":"active"}}