public class GabowStrongConnectivityInspector<V,E>
Computes the strongly connected components of a directed graph. The implemented algorithm follows
Cheriyan-Mehlhorn/Gabow's algorithm presented in Path-based depth-first search for strong and
biconnected components by Gabow (2000). The running time is order of $O(|V|+|E|)$.
Computes a list of subgraphs of the given graph. Each subgraph will represent a strongly
connected component and will contain all vertices of that component. The subgraph will have
an edge $(u,v)$ iff $u$ and $v$ are contained in the strongly connected component.