Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).
@vssuser/[email protected] low health (37/100) — consider alternatives
Get this data programmatically — free, no authentication.
curl https://depscope.dev/api/check/npm/@vssuser/rtsao-sccFirst published · 2026-04-21T08:05:26.809Z
Last updated · 2026-04-21T08:05:27.024Z