ap.util
An implementation of Tarjan's algorithm for computing the strongly connected components of a graph.
The result of the computation: the SCCs of the graph in topological order.
An implementation of Tarjan's algorithm for computing the strongly connected components of a graph.