⭐ 欢迎来到虫虫下载站! | 📦 资源下载 📁 资源专辑 ℹ️ 关于我们
⭐ 虫虫下载站

📄 problems.java

📁 Java版的SAT求解器
💻 JAVA
字号:
/* * Problems.java	1.0 04/09/06 * * Copyright 2004-2005 Positronic Software. * * */package positronic.satisfiability.elements;import java.util.*;import positronic.satisfiability.exceptions.*;import positronic.math.*;/** * An iterator over all possible Problems. * * To use this class, one passes a collection of BooleanVariables to one of the * constructors. The Problems object produced is an Iterator, and one may use its * hasNext and next methods to produce all possible problems over the given * collection. Each application of the next method produces an instance of the * IProblem class; this instance contains a problem over the given collection. * * @author  Kerry Michael Soileau * ksoileau@yahoo.com * http://web.wt.net/~ksoileau/index.htm * @version 1.0, 04/09/06 * @see ArrayList * @see Collection * @see Iterator * @see Vector */public class Problems{  public Problem[] problem;  public Problems(Object[] bv) throws BooleanLiteralException  {    System.out.println("There are "+bv.length+" BooleanVariables in this example.");    Clauses cl=new Clauses(bv);    Object[] clob=cl.toArray();    System.out.println("This produces "+clob.length+" Clauses.");    PowerSet ps=new PowerSet(clob);    int p=(int)Math.pow(2.,clob.length);    System.out.println("This produces "+p+" Problems.");    problem=new Problem[p];    for(int i=0;i<problem.length && ps.hasNext();i++)    {      problem[i]=new Problem((ArrayList)ps.next());      problem[i].sort();    }  }}

⌨️ 快捷键说明

复制代码 Ctrl + C
搜索代码 Ctrl + F
全屏模式 F11
切换主题 Ctrl + Shift + D
显示快捷键 ?
增大字号 Ctrl + =
减小字号 Ctrl + -