Find strongly connected components in a graph (use DFS or BFS)
Utilisateur anonyme
To find strongly connected components in a directed graph, one could use Rao Kosaraju's algorithm. To find connected components in an undirected graph, simple BFS from all non-explored vertices is enough.