Graph Theory37 sections · 1633 units
Open in Course

What is an SCC?

(Mutual reachability)

An SCC (Strongly Connected Component) is a maximal set of nodes where every node can reach every other node through directed paths. Maximal means you cannot add any more nodes to the set without breaking the mutual reachability property. If node vv is outside the SCC, either vv cannot reach the SCC or the SCC cannot reach vv.

Example: In graph 12311 \to 2 \to 3 \to 1, nodes {1,2,3}\{1, 2, 3\} form an SCC because 11 reaches 22 reaches 33 reaches 11. Every pair is mutually reachable.