Package util.objects.graphs

Examples of util.objects.graphs.DirectedGraph

79
80
81
82
83
84
85
86
87
88
89
     */
    public PropAntiArborescences(IntVar[] succs, int offSet, boolean linear) {
        super(succs, PropagatorPriority.LINEAR, false);
        this.n = succs.length;
        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
86
87
88
89
90
91
92
93
94
95
96
                }
            }
        }
        n2 = idx;
        fifo = new int[n2];
        digraph = new DirectedGraph(n2 + 1, SetType.BITSET, false);
        free = new BitSet(n2);
        father = new int[n2];
        in = new BitSet(n2);
        SCCfinder = new StrongConnectivityFinder(digraph);
    }
View Full Code Here
66
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
112
113
114
115
116
117
118
119
120
121
122
                }
            }
        }
        n2 = idx;
        fifo = new int[n2];
        digraph = new DirectedGraph(solver, n2 + 2, SetType.LINKED_LIST, false);
        free = new BitSet(n2);
        remProc = new DirectedRemProc();
        father = new int[n2];
        in = new BitSet(n2);
        SCCfinder = new StrongConnectivityFinder(digraph);
View Full Code Here
72
73
74
75
76
77
78
79
80
81
82
83
  public PropCircuitSCC(IntVar[] succs, int offSet, CircuitConf conf) {
    super(succs, PropagatorPriority.LINEAR, false);
    this.offSet = offSet;
    n = vars.length;
    n2 = n+1;
    support = new DirectedGraph(n2,SetType.BITSET,true);
    G_R = new DirectedGraph(n2,SetType.LINKED_LIST,false);
    SCCfinder = new StrongConnectivityFinder(support);
    mates = new ISet[n2];
    for(int i=0;i<n2;i++){
      mates[i] = SetFactory.makeLinkedList(false);
    }
View Full Code Here
81
82
83
84
85
86
87
88
89
90
91
92
    public PropSubCircuitSCC(IntVar[] succs, int offSet) {
        super(succs, PropagatorPriority.LINEAR, false);
        this.offSet = offSet;
        n = vars.length;
        n2 = n + 1;
        support = new DirectedGraph(n2, SetType.LINKED_LIST, true);
        G_R = new DirectedGraph(n2, SetType.LINKED_LIST, false);
        SCCfinder = new StrongConnectivityFinder(support);
        mates = new ISet[n2];
        for (int i = 0; i < n2; i++) {
            mates[i] = SetFactory.makeLinkedList(false);
        }
View Full Code Here
67
68
69
70
71
72
73
74
75
76
77
    public PropCircuit_ArboFiltering(IntVar[] succs, int offSet, CircuitConf conf) {
        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
69
70
71
72
73
74
75
76
        label = new int[n];
        vertex = new int[n];
        bucket = new int[n];
        succs = new ISet[n];
        preds = new ISet[n];
        T = new DirectedGraph(n, SetType.LINKED_LIST, false);
        list = new TIntArrayList();
    }
View Full Code Here
TOP

Related Classes of util.objects.graphs.DirectedGraph

  • solver.constraints.nary.alldifferent.algo.AlgoAllDiffAC
  • solver.constraints.nary.circuit.PropCircuit_ArboFiltering
  • solver.constraints.nary.circuit.PropCircuitSCC
  • solver.constraints.nary.circuit.PropSubcircuit_AntiArboFiltering
  • solver.constraints.nary.circuit.PropSubCircuitSCC
  • solver.constraints.nary.nValue.PropAtLeastNValues_AC
  • solver.constraints.nary.tree.PropAntiArborescences
  • util.graphOperations.dominance.AbstractLengauerTarjanDominatorsFinder
    • 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.