If x and ¬x are in same SCC, then we know…
that the formula is is NOT satisfiable
If x and ¬x are not in same SCC, then we know…
that the formula IS satisfiable
If S is a sink SCC, then we know that….
S’ is a sink SCC
(a ∨ b)
¬a –> b, ¬b –> a
If x and ¬x are part of the same strongly connected component, then…
we know that the formula is NOT satisfiable
If x and ¬x are NOT part of the same strongly connected component, then…
we know that the formula IS satisfiable
runtime of 2SAT
O(n + m)
2SAT algorithm explained