-SAT uses SCCs, which you learned in an earlier section. It also uses topological ordering of the condensation graph to construct assignments. This shows how graph algorithms combine to solve logic problems. The same SCC code works for cycle detection, -SAT, and other applications.
Knowing graph traversal and structure well enables many applications beyond pure graph problems. Algorithms compose in effective ways.