{"name":"@rtsao/scc","version":"1.1.0","repository":{"type":"git","url":"git+https://github.com/rtsao/scc.git"},"main":"index.js","license":"MIT","gitHead":"1120edc92040b0ca748ab62a882a98565c85deed","description":"Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).","bugs":{"url":"https://github.com/rtsao/scc/issues"},"homepage":"https://github.com/rtsao/scc#readme","_id":"@rtsao/scc@1.1.0","_nodeVersion":"14.10.1","_npmVersion":"7.18.1","dist":{"shasum":"927dd2fae9bc3361403ac2c7a00c32ddce9ad7e8","size":1862,"noattachment":false,"key":"/@rtsao/scc/-/@rtsao/scc-1.1.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/@rtsao/scc/download/@rtsao/scc-1.1.0.tgz"},"_npmUser":{"name":"rtsao","email":"ryan.j.tsao@gmail.com"},"directories":{},"maintainers":[{"name":"rtsao","email":""}],"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/scc_1.1.0_1649264856486_0.13558468231049892"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2022-04-07T01:10:26.324Z","publish_time":1649264856584,"_cnpm_publish_time":1649264856584,"dist-tags":{"latest":"1.1.0"}}