samples.tutorials.to_sort
Class MinimumEdgeDeletion
java.lang.Object
samples.tutorials.PatternExample
samples.tutorials.to_sort.MinimumEdgeDeletion
- All Implemented Interfaces:
- Example
public class MinimumEdgeDeletion
- extends PatternExample
Let consider a set of N boolean variables and a binary constraint network (eq or neq).
The goal is to find an assignment minimizing the number of required edge, or constraint, deletion.
The problem is inspired from the Minimum Equivalence Deletion Problem
- Since:
- 22 mars 2009 version 2.0.3
- Version:
- 2.0.3
- Author:
- Arnaud Malapert
Methods inherited from class java.lang.Object |
clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait |
pairVars
protected IntegerVariable[] pairVars
boolVars
protected IntegerVariable[] boolVars
deletion
protected IntegerVariable deletion
nbBools
protected int nbBools
pairProba
protected double pairProba
seed
protected long seed
nbPairs
protected int nbPairs
instantiated
protected int[] instantiated
pairs
protected Boolean[][] pairs
MinimumEdgeDeletion
public MinimumEdgeDeletion()
buildModel
public void buildModel()
- Specified by:
buildModel
in class PatternExample
buildSolver
public void buildSolver()
- Specified by:
buildSolver
in class PatternExample
prettyOut
public void prettyOut()
- Specified by:
prettyOut
in class PatternExample
solve
public void solve()
- Specified by:
solve
in class PatternExample
main
public static void main(String[] args)
Copyright © 2012. All Rights Reserved.