本文整理汇总了Java中org.chocosolver.util.ESat.FALSE属性的典型用法代码示例。如果您正苦于以下问题：Java ESat.FALSE属性的具体用法？Java ESat.FALSE怎么用？Java ESat.FALSE使用的例子？那么恭喜您, 这里精选的属性代码示例或许可以为您提供帮助。您也可以进一步了解该属性所在类org.chocosolver.util.ESat的用法示例。
在下文中一共展示了ESat.FALSE属性的15个代码示例，这些例子默认根据受欢迎程度排序。您可以为喜欢或者感觉有用的代码点赞，您的评价将有助于系统推荐出更棒的Java代码示例。
示例1: isEntailed
@Override
public ESat isEntailed() {
for (int i = 0; i < n; i++) {
for(int j=0;j<n;j++){
if(matrix[i][j].getLB()==1 && !g.getPotSuccOrNeighOf(i).contains(j)){
return ESat.FALSE;
}else if(matrix[i][j].getUB()==0 && g.getMandSuccOrNeighOf(i).contains(j)){
return ESat.FALSE;
}
}
}
if (isCompletelyInstantiated()) {
return ESat.TRUE;
}
return ESat.UNDEFINED;
}
示例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;
}
示例3: isEntailed
@Override
public ESat isEntailed() {
int min = 0;
int max = 0;
for (int i = 0; i < n; i++) {
ISet nei = g.getPotNeighOf(i);
for (int j : nei) {
if (i <= j) {
max += distMatrix[i][j];
if (g.getMandNeighOf(i).contains(j)) {
min += distMatrix[i][j];
}
}
}
}
if (min > sum.getUB() || max < sum.getLB()) {
return ESat.FALSE;
}
if (min == max) {
return ESat.TRUE;
} else {
return ESat.UNDEFINED;
}
}
示例4: isEntailed
@Override
public ESat isEntailed() {
int nbK = 0;
int nbE = 0;
ISet env = g.getPotentialNodes();
for (int i : env) {
nbE += g.getUB().getSuccOrNeighOf(i).size();
nbK += g.getLB().getSuccOrNeighOf(i).size();
}
if (!g.isDirected()) {
nbK /= 2;
nbE /= 2;
}
if (nbK > k.getUB() || nbE < k.getLB()) {
return ESat.FALSE;
}
if (k.isInstantiated() && g.isInstantiated()) {
return ESat.TRUE;
}
return ESat.UNDEFINED;
}
示例5: isEntailed
@Override
public ESat isEntailed() {
if(g.getPotentialNodes().size()==1){
return ESat.TRUE;
}
//Graphs with zero nodes are not connected.
if(g.getMandatoryNodes().size() == 0){
return ESat.FALSE;
}
explore();
for(int i: g.getMandatoryNodes()){
if(!visited.get(i)){
return ESat.FALSE;
}
}
if (!g.isInstantiated()) {
return ESat.UNDEFINED;
}
return ESat.TRUE;
}
示例6: 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;
}
示例7: 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;
}
示例8: 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)) {
return ESat.FALSE;
}
}
}
if (isCompletelyInstantiated()) {
return ESat.TRUE;
}
return ESat.UNDEFINED;
}
示例9: 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;
}
示例10: 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;
}
示例11: 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;
}
示例12: 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;
}
示例13: isEntailed
@Override
public ESat isEntailed() {
if((vertex<0 || vertex>=g.getNbMaxNodes())
|| (bool.getLB()==1 && !g.getPotentialNodes().contains(vertex))
|| (bool.getUB()==0 && g.getMandatoryNodes().contains(vertex))
){
return ESat.FALSE;
}
if(bool.isInstantiated()
&& g.getMandatoryNodes().contains(vertex)==g.getPotentialNodes().contains(vertex)){
return ESat.TRUE;
}
return ESat.UNDEFINED;
}
示例14: isEntailed
@Override
public ESat isEntailed() {
int minSum = 0;
int maxSum = 0;
for (int i = 0; i < n; i++) {
ISet env = g.getPotNeighOf(i);
ISet ker = g.getMandNeighOf(i);
for (int j : env) {
if (i <= j) {
maxSum += distMatrix[i][j];
if (ker.contains(j)) {
minSum += distMatrix[i][j];
}
}
}
}
if (maxSum < 0) {
maxSum = Integer.MAX_VALUE;
}
if (minSum > sum.getUB() || maxSum < sum.getLB()) {
return ESat.FALSE;
}
if (maxSum == minSum && sum.isInstantiated()) {
return ESat.TRUE;
}
return ESat.UNDEFINED;
}
示例15: 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;
}