Count the strongly connected components of a directed graph — maximal groups of vertices where every vertex can reach every other by following directed edges.
Loading content...