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)
.
An implementation by JGraphT.