You are not logged in. Please login at www.codechef.com to post your questions!

×

need help about 2-SAT problem

I am trying to learn 2-SAT. All I found is a google translated e-maxx.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 2-SAT besides satisfiable/not?

http://codeforces.com/problemset/problem/228/E I found this problem as an exercise of 2-SAT. 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 2-sat, dsu, topological sort, scc

asked 22 May '14, 00:47

black_artist's gravatar image

2★black_artist
112
accept rate: 0%


toggle preview
Preview

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here

By RSS:

Answers

Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text](http://url.com/ "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:

×734
×38
×2

question asked: 22 May '14, 00:47

question was seen: 2,753 times

last updated: 14 Mar '16, 15:48