Examples of util.objects.setDataStructures.ISet

util.objects.setDataStructures.ISet
Class representing a set of POSITIVE integers (typically graph nodes) Created by IntelliJ IDEA. @since 9 feb. 2011 @author chameau, Jean-Guillaume Fages

    for(int i=SCCfinder.getSCCFirstNode(cc); i>=0; i=SCCfinder.getNextNode(i)){
      vars[i].instantiateTo(i+offSet,aCause);
    }
    mates[cc].clear();
    if(sink){
      ISet ps = G_R.getPredOf(cc);
      for(int p=ps.getFirstElement();p>=0;p=ps.getNextElement()){
        G_R.removeArc(p,cc);
        if(G_R.getSuccOf(p).isEmpty()){
          makeLoops(source,p,sink);
        }
      }
    }else{
      ISet ss = G_R.getSuccOf(cc);
      for(int s=ss.getFirstElement();s>=0;s=ss.getNextElement()){
        G_R.removeArc(cc,s);
        if(G_R.getPredOf(s).isEmpty()){
          makeLoops(source,s,sink);
        }
      }

View Full Code Here


  public void filter(IntVar[] vars, UndirectedGraph graph, F heur, Propagator aCause) throws ContradictionException{
    assert  n == vars.length-1;
    BitSet mis = heur.getMIS();
    if(mis.cardinality()==vars[n].getUB()){
      ISet nei;
      for (int i = mis.nextClearBit(0); i>=0 && i < n; i = mis.nextClearBit(i + 1)) {
        int mate = -1;
        int last = 0;
        if(valToRem.length<vars[i].getDomainSize()){
          valToRem = new int[vars[i].getDomainSize()*2];
        }
        int ub = vars[i].getUB();
        int lb = vars[i].getLB();
        for (int k = lb; k <= ub; k = vars[i].nextValue(k)) {
          valToRem[last++] = k;
        }
        nei = graph.getNeighOf(i);
        for (int j = nei.getFirstElement(); j >= 0; j = nei.getNextElement()) {
          if (mis.get(j)) {
            if (mate == -1) {
              mate = j;
            } else if (mate >= 0) {
              mate = -2;

View Full Code Here

        nodeSCC = new int[n];
        nbSCC = 0;
    }


    public void findAllSCC() {
        ISet nodes = graph.getNodes();
        for (int i = 0; i < n; i++) {
            restriction.set(i, nodes.contain(i));
        }
        findAllSCCOf(restriction);
    }

View Full Code Here

     * in the general tree that maps to height i in the binary tree. i.e. iff v has an ancestor u such that h(I(u)) = i.
     */
    private void performLCAPreprocessing() {
        // step 1 : DFS already done
        // step 2
        ISet nei;
        for (int i = nbActives - 1; i >= 0; i--) {
            h[i] = BitOperations.getFirstExp(i + 1);
            if (h[i] == -1) {
                throw new UnsupportedOperationException();
            }
            htmp[i] = h[i];
            I[i] = i;
            L[i] = i;
            int sucInRun = -1;
            nei = graph.getSuccOf(nodeOfDfsNumber[i]);
            int s;
            for (int k = nei.getFirstElement(); k >= 0; k = nei.getNextElement()) {
                s = dfsNumberOfNode[k];
                if (i != s && father[s] == i && htmp[s] > htmp[i]) {
                    htmp[i] = htmp[s];
                    sucInRun = s;
                }

View Full Code Here

            first = restriction.nextSetBit(first);
        }
    }


    private void findSingletons(BitSet restriction) {
        ISet nodes = graph.getNodes();
        for (int i = restriction.nextSetBit(0); i >= 0; i = restriction.nextSetBit(i + 1)) {
            if (nodes.contain(i) && graph.getPredOf(i).getSize() * graph.getSuccOf(i).getSize() == 0) {
                nodeSCC[i] = nbSCC;
                sccFirstNode[nbSCC++] = i;
                restriction.clear(i);
            }
        }

View Full Code Here

    if (node_CC == null) {
      CC_firstNode = new int[n];
      CC_nextNode = new int[n];
      node_CC = new int[n];
    }
    ISet act = graph.getNodes();
    for (int i = act.getFirstElement(); i >= 0; i = act.getNextElement()) {
      p[i] = -1;
    }
    for(int i=0;i<CC_firstNode.length;i++){
      CC_firstNode[i] = -1;
    }
    int first = act.getFirstElement();
    int cc = 0;
    while (first >= 0) {
      findCC(first, cc);
      cc++;
      while (first >= 0 && p[first] != -1) {
        first = act.getNextElement();
      }
    }
    nbCC = cc;
  }

View Full Code Here

    fifo[last++] = start;
    p[start] = start;
    add(start,cc);
    while(first<last){
      int i = fifo[first++];
      ISet s = graph.getSuccOrNeighOf(i);
      for(int j=s.getFirstElement();j>=0;j=s.getNextElement()){
        if(p[j]==-1){
          p[j] = i;
          add(j,cc);
          fifo[last++] = j;
        }
      }
      if(graph.isDirected()){
        s = graph.getPredOrNeighOf(i);
        for(int j=s.getFirstElement();j>=0;j=s.getNextElement()){
          if(p[j]==-1){
            p[j] = i;
            add(j,cc);
            fifo[last++] = j;
          }

View Full Code Here

    // SDOM & IDOM
    //***********************************************************************************


    protected void findAllIdom() {
        int w, v, u;
        ISet prds;
        for (int i = n - 1; i >= 1; i--) {
            w = vertex[i];
            prds = preds[w];
            for (v = prds.getFirstElement(); v >= 0; v = prds.getNextElement()) {
                u = EVAL(v);
                if (semi[u] < semi[w]) {
                    semi[w] = semi[u];
                }
            }

View Full Code Here

    if (nodeOfNum == null) {
      nodeOfNum = new int[n];
      numOfNode = new int[n];
      inf = new int[n];
    }
    ISet act = graph.getNodes();
    for (int i = act.getFirstElement(); i >= 0; i = act.getNextElement()) {
      inf[i] = Integer.MAX_VALUE;
      p[i] = -1;
    }
    //algo
    int start = act.getFirstElement();
    int i = start;
    int k = 0;
    numOfNode[start] = k;
    nodeOfNum[k] = start;
    p[start] = start;
    int j, q;
    int nbRootChildren = 0;
    boolean first = true;
    while (true) {
      if (first) {
        j = graph.getSuccOrNeighOf(i).getFirstElement();
        first = false;
      } else {
        j = graph.getSuccOrNeighOf(i).getNextElement();
      }
      if (j < 0) {
        if (i == start) {
          if (k < act.getSize() - 1) {
            return false;// NOT EVEN CONNECTED
          } else {
            return true;
          }
        }

View Full Code Here

      isthmusTo = new TIntArrayList();
      ND = new int[n];
      L = new int[n];
      H = new int[n];
    }
    ISet act = graph.getNodes();
    for (int i = act.getFirstElement(); i >= 0; i = act.getNextElement()) {
      p[i] = -1;
    }
    for(int i=0;i<CC_firstNode.length;i++){
      CC_firstNode[i] = -1;
    }
    //algo
    int start = act.getFirstElement();
    int i = start;
    int k = 0;
    numOfNode[start] = k;
    nodeOfNum[k] = start;
    p[start] = start;
    int j;
    boolean first = true;
    while (true) {
      if (first) {
        j = graph.getSuccOrNeighOf(i).getFirstElement();
        first = false;
      } else {
        j = graph.getSuccOrNeighOf(i).getNextElement();
      }
      if (j < 0) {
        if (i == start) {
          if (k < act.getSize() - 1) {
            return false;
          } else {
            break;
          }
        }
        i = p[i];
      } else {
        if (p[j] == -1) {
          p[j] = i;
          i = j;
          first = true;
          add(i, 0);
          k++;
          numOfNode[i] = k;
          nodeOfNum[k] = i;
        }
      }
    }
    // POST ORDER PASS FOR FINDING ISTHMUS
    isthmusFrom.clear();
    isthmusTo.clear();
    int currentNode;
    for (i = k; i >= 0; i--) {
      currentNode = nodeOfNum[i];
      ND[currentNode] = 1;
      L[currentNode] = i;
      H[currentNode] = i;
      ISet nei = graph.getSuccOrNeighOf(currentNode);
      for (int s = nei.getFirstElement(); s >= 0; s = nei.getNextElement()) {
        if (p[s] == currentNode) {
          ND[currentNode] += ND[s];
          L[currentNode] = Math.min(L[currentNode], L[s]);
          H[currentNode] = Math.max(H[currentNode], H[s]);
        } else if (s != p[currentNode]) {

View Full Code Here

0 1 2

TOP

Related Classes of util.objects.setDataStructures.ISet

solver.constraints.nary.alldifferent.algo.AlgoAllDiffAC

solver.constraints.nary.circuit.PropCircuitSCC

solver.constraints.nary.circuit.PropSubCircuitSCC

solver.constraints.nary.cumulative.PropGraphCumulative

solver.constraints.nary.nValue.amnv.graph.Gi

solver.constraints.nary.nValue.amnv.mis.MD

solver.constraints.nary.nValue.amnv.mis.MDRk

solver.constraints.nary.nValue.amnv.mis.Rk

solver.constraints.nary.nValue.amnv.rules.R3

solver.constraints.nary.nValue.PropAtLeastNValues_AC

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.