/*******************************************************************************
 * SAT4J: a SATisfiability library for Java Copyright (C) 2004, 2012 Artois University and CNRS
 *
 * All rights reserved. This program and the accompanying materials
 * are made available under the terms of the Eclipse Public License v1.0
 * which accompanies this distribution, and is available at
 *  http://www.eclipse.org/legal/epl-v10.html
 *
 * Alternatively, the contents of this file may be used under the terms of
 * either the GNU Lesser General Public License Version 2.1 or later (the
 * "LGPL"), in which case the provisions of the LGPL are applicable instead
 * of those above. If you wish to allow use of your version of this file only
 * under the terms of the LGPL, and not to allow others to use your version of
 * this file under the terms of the EPL, indicate your decision by deleting
 * the provisions above and replace them with the notice and other provisions
 * required by the LGPL. If you do not delete the provisions above, a recipient
 * may use your version of this file under the terms of the EPL or the LGPL.
 *
 * Based on the original MiniSat specification from:
 *
 * An extensible SAT solver. Niklas Een and Niklas Sorensson. Proceedings of the
 * Sixth International Conference on Theory and Applications of Satisfiability
 * Testing, LNCS 2919, pp 502-518, 2003.
 *
 * See www.minisat.se for the original solver in C++.
 *
 * Contributors:
 *   CRIL - initial API and implementation
 *******************************************************************************/
package org.sat4j.pb;

import java.util.ArrayList;
import java.util.List;

public class Explanation<C> {
    private final List<DepdendenyNode<C>> roots;
    private final List<Conflict<C>> conflicts;

    public Explanation() {
        this.roots = new ArrayList<DepdendenyNode<C>>();
        this.conflicts = new ArrayList<Conflict<C>>();
    }

    public DepdendenyNode<C> newFalseRoot(C name) {
        DepdendenyNode<C> root = newNode(name);
        this.roots.add(root);
        return root;
    }

    public DepdendenyNode<C> newNode(C name) {
        return new DepdendenyNode<C>(name, this);
    }

    public List<DepdendenyNode<C>> getRoots() {
        return this.roots;
    }

    public Conflict<C> newConflict() {
        Conflict<C> conflict = new Conflict<C>(this);
        this.conflicts.add(conflict);
        return conflict;
    }

    public List<Conflict<C>> getConflicts() {
        return this.conflicts;
    }

}
