此算法能在多项式时间里判定任一给定的2CNF公式是否可满足。是算法中的一个重要问题。-this algorithm in polynomial time as a judge for the 2CNF formula can meet. The algorithm is an important issue.

2cnf-sat问题用c++实现的图形解决方法,2cnf-sat problems using c++ Achieve graphical solution

对一个2CNF进行研究，从而找出一个算法，它能在多项式时间里判定任一给定的2 CNF公式是否可满足。 -2CNF of a study to identify an algorithm that can determine in polynomial time, any given 2 CNF formula is to meet.