Tarjan's Strongly Connected Components

Finds all strongly connected components of a directed graph in a single DFS using discovery indices and lowlink values.