Tag Archives: Kosaraju’s algorithm

Strongly Connected Components

Another useful application of the depth-first search algorithm, is decomposing of the directed graph into the strongly connected components or SCC. A strongly connected component of the graph is a maximal set of vertices in which there is a path from any vertex to any other vertex in both directions.

scc4

The above directed graph has three strongly connected components. Continue reading Strongly Connected Components