当前位置: 首页>>代码示例>>Java>>正文


Java ESat.TRUE属性代码示例

本文整理汇总了Java中org.chocosolver.util.ESat.TRUE属性的典型用法代码示例。如果您正苦于以下问题:Java ESat.TRUE属性的具体用法?Java ESat.TRUE怎么用?Java ESat.TRUE使用的例子?那么恭喜您, 这里精选的属性代码示例或许可以为您提供帮助。您也可以进一步了解该属性所在org.chocosolver.util.ESat的用法示例。


在下文中一共展示了ESat.TRUE属性的15个代码示例,这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞,您的评价将有助于系统推荐出更棒的Java代码示例。

示例1: isEntailed

@Override
public ESat isEntailed() {
    ISet ker = g.getMandatoryNodes();
    ISet succ;
    for (int i : ker) {
        succ = g.getMandSuccOf(i);
        for (int j : succ) {
            if (g.getMandSuccOf(j).contains(i)) {
                return ESat.FALSE;
            }
        }
    }
    if (g.isInstantiated()) {
        return ESat.TRUE;
    }
    return ESat.UNDEFINED;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:17,代码来源:PropAntiSymmetric.java

示例2: isEntailed

@Override
public ESat isEntailed() {
	try {
		if (!sorted()) {
			return ESat.FALSE;
		}
	} catch (ContradictionException e) {
		return ESat.FALSE;
	}
	for (BoolVar aT : t) {
		if (!aT.isInstantiated()) {
			return ESat.UNDEFINED;
		}
	}
	return ESat.TRUE;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:16,代码来源:PropSymmetryBreaking.java

示例3: isEntailed

@Override
public ESat isEntailed() {
	for (int i = 0; i < n; i++) {
		if(succs[i].isInstantiated()){
			if (!g.getPotNeighOf(i).contains(succs[i].getValue())) {
				return ESat.FALSE;
			}
		}
		ISet tmp = g.getMandNeighOf(i);
		for (int j : tmp) {
			if ((!succs[i].contains(j)) && (!succs[j].contains(i))) {
				return ESat.FALSE;
			}
		}
	}
	if (isCompletelyInstantiated()) {
		return ESat.TRUE;
	}
	return ESat.UNDEFINED;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:20,代码来源:PropNeighIntsChannel1.java

示例4: isEntailed

@Override
public ESat isEntailed() {
    ISet ker = g.getMandatoryNodes();
    ISet succ;
    for (int i : ker) {
        succ = g.getMandSuccOf(i);
        for (int j : succ) {
            if (!g.getPotSuccOf(j).contains(i)) {
                return ESat.FALSE;
            }
        }
    }
    if (g.isInstantiated()) {
        return ESat.TRUE;
    }
    return ESat.UNDEFINED;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:17,代码来源:PropSymmetric.java

示例5: isEntailed

@Override
public ESat isEntailed() {
	boolean done = true;
	for(int i=0;i<n;i++){
		if((!degrees[i].contains(0)) && !g.getPotentialNodes().contains(i)){
			return ESat.FALSE;
		}
		ISet env = target.getPotSet(g, i);
		ISet ker = target.getMandSet(g, i);
		if(degrees[i].getLB()>env.size()
				|| degrees[i].getUB()<ker.size()){
			return ESat.FALSE;
		}
		if(env.size() != ker.size() || !degrees[i].isInstantiated()){
			done = false;
		}
	}
	if (!done) {
		return ESat.UNDEFINED;
	}
	return ESat.TRUE;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:22,代码来源:PropNodeDegree_Var.java

示例6: isEntailed

@Override
 public ESat isEntailed() {
     for (int i = 0; i < n; i++) {
if(succs[i].isInstantiated()){
             if (!g.getPotSuccOrNeighOf(i).contains(succs[i].getValue())) {
                 return ESat.FALSE;
             }
         }
         ISet tmp = g.getMandSuccOrNeighOf(i);
         for (int j : tmp) {
             if (!succs[i].contains(j)) {
		if(g.isDirected() || !succs[j].contains(i)) {
			return ESat.FALSE;
		}
             }
         }
     }
     if (isCompletelyInstantiated()) {
         return ESat.TRUE;
     }
     return ESat.UNDEFINED;
 }
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:22,代码来源:PropNeighIntsChannel2.java

示例7: isEntailed

@Override
public ESat isEntailed() {
    int min = 0;
    int max = 0;
    ISet env = g.getPotentialNodes();
    for (int i : env) {
        if (g.getMandSuccOrNeighOf(i).contains(i)) {
            min++;
            max++;
        } else if (g.getPotSuccOrNeighOf(i).contains(i)) {
            max++;
        }
    }
    if (k.getLB() > max || k.getUB() < min) {
        return ESat.FALSE;
    }
    if (min == max) {
        return ESat.TRUE;
    }
    return ESat.UNDEFINED;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:21,代码来源:PropNbLoops.java

示例8: solve

public boolean solve() {
  if (solver != null) {
    System.out.println("Running choco solver ...");
    logger.log(Level.INFO, "Running Choco Solver ...");
    solver.findSolution();
    logger.log(Level.INFO, "end running Choco Solver ");

    if (solver.isFeasible() == ESat.TRUE) {
      solution = new ArrayList<String>();

      for (int i = 0; i < vars.length; i++) {
        int var = vars[i].getValue();

        Value input = inputs.get(i).value;
        if (input instanceof janala.interpreters.StringValue) {
          solution.add(StringConstants.instance.get(var));
        } else {
          solution.add(Integer.toString(var));
        }
      }
      return true;
    } else {
      logger.log(Level.INFO, "-- Infeasible");
      return false;
    }
  }
  return false;
}
 
开发者ID:zhihan,项目名称:janala2-gradle,代码行数:28,代码来源:ChocoSolver.java

示例9: isEntailed

@Override
public ESat isEntailed() {
	ISet nodes = g.getMandatoryNodes();
	for (int i : nodes) {
		if (g.getMandNeighOf(i).size() > 2 || g.getPotNeighOf(i).size() < 2) {
			return ESat.FALSE;
		}
	}
	if (g.isInstantiated()) {
		return ESat.TRUE;
	}
	return ESat.UNDEFINED;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:13,代码来源:PropHamiltonianCycle.java

示例10: isEntailed

@Override
public ESat isEntailed() {
	int upperGraphGirth = getUpperGraphGirth();
	int lowerGraphGirth = getLowerGraphGirth();
	if (upperGraphGirth < girth.getLB()) {
		return ESat.FALSE;
	}
	if (lowerGraphGirth > girth.getUB()) {
		return ESat.FALSE;
	}
	if (graph.isInstantiated() && girth.isInstantiatedTo(lowerGraphGirth)) {
		return ESat.TRUE;
	}
	return ESat.UNDEFINED;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:15,代码来源:PropGirth.java

示例11: isEntailed

@Override
public ESat isEntailed() {
    int env = g.getPotentialNodes().size();
    int ker = g.getMandatoryNodes().size();
    if (env < k.getLB() || ker > k.getUB()) {
        return ESat.FALSE;
    }
    if (env == ker) {
        return ESat.TRUE;
    }
    return ESat.UNDEFINED;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:12,代码来源:PropNbNodes.java

示例12: isEntailed

@Override
public ESat isEntailed() {
	if (k.getUB() < minCC() || k.getLB()>maxCC()) {
		return ESat.FALSE;
	}
	if (isCompletelyInstantiated()) {
		return ESat.TRUE;
	}
	return ESat.UNDEFINED;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:10,代码来源:PropNbSCC.java

示例13: isEntailed

@Override
  public ESat isEntailed() {
if (g.getPotentialNodes().size() == g.getMandatoryNodes().size()){
	return ESat.UNDEFINED;
}
      if (!env_CC_finder.isBiconnected()) {
          return ESat.FALSE;
      }
      if (g.isInstantiated()) {
          return ESat.TRUE;
      }
      return ESat.UNDEFINED;
  }
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:13,代码来源:PropBiconnected.java

示例14: isEntailed

@Override
public ESat isEntailed() {
	System.out.println("[WARNING] "+this.getClass().getSimpleName()+".isEntail() is not implemented yet " +
			"and returns true by default. Please do not reify this constraint ");
	return ESat.TRUE;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:6,代码来源:PropCircuit.java

示例15: isEntailed

@Override
public ESat isEntailed() {
	return ESat.TRUE;
}
 
开发者ID:chocoteam,项目名称:choco-graph,代码行数:4,代码来源:PropLagr_DCMST_generic.java


注:本文中的org.chocosolver.util.ESat.TRUE属性示例由纯净天空整理自Github/MSDocs等开源代码及文档管理平台,相关代码片段筛选自各路编程大神贡献的开源项目,源码版权归原作者所有,传播和使用请参考对应项目的License;未经允许,请勿转载。