Strongly Connected Components (SCCs) are groups of nodes in a directed graph where every node can reach every other node in the group. Finding SCCs helps you compress a graph into simpler parts. If you have a messy directed graph with cycles, finding its SCCs gives you a DAG (directed acyclic graph) that is easier to work with.
In this section, I'll teach you two algorithms: Kosaraju's (two DFS passes) and Tarjan's (one DFS with low-link values). You will solve three CSES problems and learn when to apply SCC detection.
