You have learned SCCs find strongly connected components in directed graphs.
Now I'll show you how they solve logic puzzles. -SAT is a satisfiability problem. You have boolean variables and constraints like "x OR y must be true." Your job: assign true or false to each variable so all constraints hold at once. I'll teach you how to convert logic into graphs, find SCCs, and extract valid assignments. The connection between logic and graph structure is both beautiful and practical.
