title: 2-Satisfiability and Strongly connected components
body: <p>I know that applying <strong>Strongly connected components</strong> in a Digraph we can check <strong>2-SAT boolean satisfiability</strong> if the problem is solvable in polynomial time.</p>
  
  <p>Let's assume the problem is satisfiable. </p>
  
  <p>The question: is there a general algorithm to calculate that solution relying on 2-SAT?</p>