๐ WAYPOINT LESSON
Recognizing SCC Problems
โญโญโญ advancedโณ 35 min read๐ Lesson 151 of 281
Mutual reachability, propagating swaps, 'same group' sizes, and digraph DP that back edges break โ the four signatures of SCC.
The four signatures
- "u reaches v AND v reaches u" โ mutual reachability IS the SCC relation.
- Bidirectional swaps that propagate: swap(i,j) and swap(j,k) allowed โ one component {i, j, k}.
- "Group" answers โ SCC sizes.
- DP on a digraph where back edges break the state โ condense first.
Anti-signature: a DAG needs no SCC pass; undirected connectivity is not SCC territory.
โก Now practice
Ready to CodeSCC TrioCount and size components, count distinct condensation edges, and label components โ with an undirected misread, a dedupe miss, and an O(nยทm) near-miss.
3 challenges ยท ยท ~110 min