Description
A Haskell library implementing Tarjan's algorithm for computing strongly connected components of a graph. It helps identify cycles and groups of nodes that can reach each other.
Developers use it in dependency analysis, compilers, build systems, graph tools, and scheduling logic. Inputs should model edge direction correctly because SCC results depend entirely on that direction.