Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).
@rtsao/[email protected] low health (39/100) — consider alternatives
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/npm/@rtsao/sccFirst published · 2019-04-15T16:39:12.732Z
Last updated · 2022-04-06T17:07:36.584Z