{"name":"@rtsao/scc","version":"1.0.0","repository":{"type":"git","url":"git+https://github.com/rtsao/scc.git"},"main":"index.js","license":"MIT","gitHead":"6f1e9018758bac4ae9c0facd72265e6633c59de1","description":"Find strongly connected components of a directed graph using Tarjan's algorithm.","bugs":{"url":"https://github.com/rtsao/scc/issues"},"homepage":"https://github.com/rtsao/scc#readme","_id":"@rtsao/scc@1.0.0","_npmVersion":"5.6.0","_nodeVersion":"8.9.0","_npmUser":{"name":"rtsao","email":"ryan.j.tsao@gmail.com"},"dist":{"shasum":"fe33974e74d31ac5bed4f427d843364aebabd5ab","size":1679,"noattachment":false,"key":"/@rtsao/scc/-/@rtsao/scc-1.0.0.tgz","tarball":"http://registry.cnpm.dingdandao.com/@rtsao/scc/download/@rtsao/scc-1.0.0.tgz"},"maintainers":[{"name":"rtsao","email":""}],"directories":{},"_npmOperationalInternal":{"host":"s3://npm-registry-packages","tmp":"tmp/scc_1.0.0_1555346352921_0.23059262953909054"},"_hasShrinkwrap":false,"_cnpmcore_publish_time":"2021-12-24T00:32:01.444Z","publish_time":1555346353021,"_cnpm_publish_time":1555346353021,"dist-tags":{"latest":"1.1.0"}}