Package util.graphOperations.dominance

Examples of util.graphOperations.dominance.SimpleDominatorsFinder

83
84
85
86
87
88
89
90
        this.offSet = offSet;
        this.connectedGraph = new DirectedGraph(n + 1, SetType.BITSET, false);
        if (linear) {
            domFinder = new AlphaDominatorsFinder(n, connectedGraph);
        } else {
            domFinder = new SimpleDominatorsFinder(n, connectedGraph);
        }
    }
View Full Code Here
67
68
69
70
71
72
73
74
    public PropSubcircuit_AntiArboFiltering(IntVar[] succs, int offSet) {
        super(succs, PropagatorPriority.QUADRATIC, true);
        this.n = succs.length;
        this.offSet = offSet;
        this.connectedGraph = new DirectedGraph(n + 1, SetType.LINKED_LIST, false);
        domFinder = new SimpleDominatorsFinder(n, connectedGraph);
        rootCandidates = new int[n];
    }
View Full Code Here
68
69
70
71
72
73
74
75
76
77
        super(succs, PropagatorPriority.QUADRATIC, false);
        this.conf = conf;
        this.n = succs.length;
        this.offSet = offSet;
        this.connectedGraph = new DirectedGraph(n + 1, SetType.BITSET, false);
        domFinder = new SimpleDominatorsFinder(n, connectedGraph);
        if (conf == CircuitConf.RD) {
            rd = new Random(0);
        }
    }
View Full Code Here
TOP

Related Classes of util.graphOperations.dominance.SimpleDominatorsFinder

  • solver.constraints.nary.circuit.PropCircuit_ArboFiltering
  • solver.constraints.nary.circuit.PropSubcircuit_AntiArboFiltering
  • solver.constraints.nary.tree.PropAntiArborescences
    • Copyright © 2018 www.massapicom. All rights reserved.
    All source code are property of their respective owners. Java is a trademark of Sun Microsystems, Inc and owned by ORACLE Inc. Contact coftware#gmail.com.