I am trying to learn 2SAT. All I found is a google translated emaxx.ru and a wekipedia page. But I could not understand all of them. I understand the graph construction and the impossible case, why and when it does not have solution. its clear to me . But I can not understand the topo sort / start time finish time part inside it. What else information can we extract form 2SAT besides satisfiable/not? http://codeforces.com/problemset/problem/228/E I found this problem as an exercise of 2SAT. As i mentioned I understand the graph construction and decision part but I can not understand the topo sort part for path printing (the order that ons all bits). Tags 2sat, dsu, topological sort, scc asked 22 May '14, 00:47

answered 14 Mar '16, 15:48
