title: How to get 2-Sat values
body: <p>Whenever I search for an algorithm for 2-Sat, I get back the algorithm for the decision form of the problem: Does there exist a legal set of values that satisfy all the clauses. However, that does not allow me to easily find a set of satisfying boolean values.</p>
  
  <p>How can I efficiently find a legal set of values that will satisfy a 2-Sat instance?
  <br/><br/></p>
  
  <p>I am working in c++ with the boost library and would appreciate code that can be easily integrated.</p>
  
  <p>Thanks in advance</p>