1 /******************************************************************************* 2 * SAT4J: a SATisfiability library for Java Copyright (C) 2004, 2012 Artois University and CNRS 3 * 4 * All rights reserved. This program and the accompanying materials 5 * are made available under the terms of the Eclipse Public License v1.0 6 * which accompanies this distribution, and is available at 7 * http://www.eclipse.org/legal/epl-v10.html 8 * 9 * Alternatively, the contents of this file may be used under the terms of 10 * either the GNU Lesser General Public License Version 2.1 or later (the 11 * "LGPL"), in which case the provisions of the LGPL are applicable instead 12 * of those above. If you wish to allow use of your version of this file only 13 * under the terms of the LGPL, and not to allow others to use your version of 14 * this file under the terms of the EPL, indicate your decision by deleting 15 * the provisions above and replace them with the notice and other provisions 16 * required by the LGPL. If you do not delete the provisions above, a recipient 17 * may use your version of this file under the terms of the EPL or the LGPL. 18 * 19 * Based on the original MiniSat specification from: 20 * 21 * An extensible SAT solver. Niklas Een and Niklas Sorensson. Proceedings of the 22 * Sixth International Conference on Theory and Applications of Satisfiability 23 * Testing, LNCS 2919, pp 502-518, 2003. 24 * 25 * See www.minisat.se for the original solver in C++. 26 * 27 * Contributors: 28 * CRIL - initial API and implementation 29 *******************************************************************************/ 30 package org.sat4j.pb; 31 32 import java.util.ArrayList; 33 import java.util.List; 34 35 public class Conflict<C> { 36 37 private final Explanation<C> explanation; 38 private final List<DepdendenyNode<C>> roots; 39 40 public Conflict(Explanation<C> explanation) { 41 this.explanation = explanation; 42 this.roots = new ArrayList<DepdendenyNode<C>>(); 43 } 44 45 public DepdendenyNode<C> newRoot(C name) { 46 DepdendenyNode<C> root = this.explanation.newNode(name); 47 this.roots.add(root); 48 return root; 49 } 50 51 public List<DepdendenyNode<C>> getRoots() { 52 return this.roots; 53 } 54 55 }