{"package":"@rtsao/scc","ecosystem":"npm","latest_version":"1.1.0","description":"Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).","license":"MIT","homepage":"https://github.com/rtsao/scc#readme","repository":"https://github.com/rtsao/scc","downloads_weekly":33366672,"health":{"score":50,"risk":"high","breakdown":{"maintenance":0,"popularity":20,"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":"1.1.0","total_count":2,"recent":["1.0.0","1.1.0"]},"metadata":{"deprecated":false,"deprecated_message":null,"maintainers_count":1,"first_published":"2019-04-15T16:39:12.732Z","last_published":"2022-04-06T17:07:36.584Z","dependencies_count":0,"dependencies":[]},"bundle":{"size_kb":0.6,"gzip_kb":0.3,"dependency_count":0,"has_js_module":false,"has_side_effects":true,"scoped":true,"source":"bundlephobia"},"typescript":{"score":0,"has_types":false,"types_source":null,"types_package":null},"known_issues":{"bugs_count":0,"bugs_severity":{},"status_breakdown":{},"link":null,"scope":"none"},"recommendation":{"action":"safe_to_use","issues":[],"use_version":"1.1.0","version_hint":null,"summary":"@rtsao/scc@1.1.0 is safe to use (health: 50/100)"},"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}}