CLRS — Chapter 20, §20.5: Strongly Connected Components (Kosaraju) — Correctness and Running TimeTextbook
Two vertices belong to the same strongly connected component when each can reach the other by a directed path. The partition separates the mutually reachable parts of a directed graph without requiring the whole graph to be connected. This mission formalizes the two-pass DFS algorithm of CLRS, fourth edition, Chapter 20, §20.5, often called Kosaraju's…