View Javadoc

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.tools;
31  
32  import org.sat4j.specs.ISolverService;
33  import org.sat4j.specs.RandomAccessModel;
34  
35  public class HeuristicsTracing extends SearchListenerAdapter<ISolverService> {
36  
37      /**
38  	 * 
39  	 */
40      private static final long serialVersionUID = 1L;
41      private ISolverService solverService;
42      private final IVisualizationTool visuTool;
43  
44      public HeuristicsTracing(IVisualizationTool visuTool) {
45          this.visuTool = visuTool;
46      }
47  
48      @Override
49      public void solutionFound(int[] model, RandomAccessModel lazyModel) {
50          trace();
51      }
52  
53      @Override
54      public void restarting() {
55          trace();
56      }
57  
58      private void trace() {
59          this.visuTool.init();
60  
61          int n = this.solverService.nVars();
62          double[] heuristics = this.solverService.getVariableHeuristics();
63          for (int i = 1; i <= n; i++) {
64              this.visuTool.addPoint(heuristics[i], i);
65          }
66          this.visuTool.end();
67      }
68  
69      @Override
70      public void init(ISolverService solverService) {
71          this.solverService = solverService;
72      }
73  }