Source: wikibot/kosaraju-s-algorithm
= Kosaraju's algorithm
{wiki=Kosaraju's_algorithm}
Kosaraju's algorithm is a graph algorithm used to find the strongly connected components (SCCs) of a directed graph. A strongly connected component is a maximal subgraph where every vertex is reachable from every other vertex in that subgraph.