@rtsao/scc (npm): Find strongly connected components of a directed graph using [Tarjan's algorithm](https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm).
Keywords: cycle-detection|strongly-connected-components|tarjan|topological-sort