private void addRequiredEdges(Graph graph) {
if (true) return;
if (knowledgeEmpty()) return;
for (Iterator<KnowledgeEdge> it = getKnowledge().requiredEdgesIterator(); it.hasNext(); ) {
KnowledgeEdge next = it.next();
Node nodeA = graph.getNode(next.getFrom());
Node nodeB = graph.getNode(next.getTo());
if (!graph.isAncestorOf(nodeB, nodeA)) {
graph.removeEdges(nodeA, nodeB);
graph.addDirectedEdge(nodeA, nodeB);
TetradLogger.getInstance()
.log("insertedEdges", "Adding edge by knowledge: " + graph.getEdge(nodeA, nodeB));
}
}
for (Edge edge : graph.getEdges()) {
final String A = edge.getNode1().getName();
final String B = edge.getNode2().getName();
if (knowledge.isForbidden(A, B)) {
Node nodeA = edge.getNode1();
Node nodeB = edge.getNode2();
if (nodeA != null
&& nodeB != null
&& graph.isAdjacentTo(nodeA, nodeB)
&& !graph.isChildOf(nodeA, nodeB)) {
if (!graph.isAncestorOf(nodeA, nodeB)) {
graph.removeEdges(nodeA, nodeB);
graph.addDirectedEdge(nodeB, nodeA);
TetradLogger.getInstance()
.log("insertedEdges", "Adding edge by knowledge: " + graph.getEdge(nodeB, nodeA));
}
}
if (!graph.isChildOf(nodeA, nodeB)
&& getKnowledge().isForbidden(nodeA.getName(), nodeB.getName())) {
if (!graph.isAncestorOf(nodeA, nodeB)) {
graph.removeEdges(nodeA, nodeB);
graph.addDirectedEdge(nodeB, nodeA);
TetradLogger.getInstance()
.log("insertedEdges", "Adding edge by knowledge: " + graph.getEdge(nodeB, nodeA));
}
}
} else if (knowledge.isForbidden(B, A)) {
Node nodeA = edge.getNode2();
Node nodeB = edge.getNode1();
if (nodeA != null
&& nodeB != null
&& graph.isAdjacentTo(nodeA, nodeB)
&& !graph.isChildOf(nodeA, nodeB)) {
if (!graph.isAncestorOf(nodeA, nodeB)) {
graph.removeEdges(nodeA, nodeB);
graph.addDirectedEdge(nodeB, nodeA);
TetradLogger.getInstance()
.log("insertedEdges", "Adding edge by knowledge: " + graph.getEdge(nodeB, nodeA));
}
}
if (!graph.isChildOf(nodeA, nodeB)
&& getKnowledge().isForbidden(nodeA.getName(), nodeB.getName())) {
if (!graph.isAncestorOf(nodeA, nodeB)) {
graph.removeEdges(nodeA, nodeB);
graph.addDirectedEdge(nodeB, nodeA);
TetradLogger.getInstance()
.log("insertedEdges", "Adding edge by knowledge: " + graph.getEdge(nodeB, nodeA));
}
}
}
}
}
private void resolveOneEdgeMax(Graph graph, Node x, Node y, boolean strong, Graph oldGraph) {
if (RandomUtil.getInstance().nextDouble() > 0.5) {
Node temp = x;
x = y;
y = temp;
}
TetradLogger.getInstance().log("info", "\nEDGE " + x + " --- " + y);
SortedMap<Double, String> scoreReports = new TreeMap<Double, String>();
List<Node> neighborsx = graph.getAdjacentNodes(x);
neighborsx.remove(y);
double max = Double.NEGATIVE_INFINITY;
boolean left = false;
boolean right = false;
DepthChoiceGenerator genx = new DepthChoiceGenerator(neighborsx.size(), neighborsx.size());
int[] choicex;
while ((choicex = genx.next()) != null) {
List<Node> condxMinus = GraphUtils.asList(choicex, neighborsx);
List<Node> condxPlus = new ArrayList<Node>(condxMinus);
condxPlus.add(y);
double xPlus = score(x, condxPlus);
double xMinus = score(x, condxMinus);
List<Node> neighborsy = graph.getAdjacentNodes(y);
neighborsy.remove(x);
DepthChoiceGenerator geny = new DepthChoiceGenerator(neighborsy.size(), neighborsy.size());
int[] choicey;
while ((choicey = geny.next()) != null) {
List<Node> condyMinus = GraphUtils.asList(choicey, neighborsy);
// List<Node> parentsY = oldGraph.getParents(y);
// parentsY.remove(x);
// if (!condyMinus.containsAll(parentsY)) {
// continue;
// }
List<Node> condyPlus = new ArrayList<Node>(condyMinus);
condyPlus.add(x);
double yPlus = score(y, condyPlus);
double yMinus = score(y, condyMinus);
// Checking them all at once is expensive but avoids lexical ordering problems in the
// algorithm.
if (normal(y, condyPlus)
|| normal(x, condxMinus)
|| normal(x, condxPlus)
|| normal(y, condyMinus)) {
continue;
}
double delta = 0.0;
if (strong) {
if (yPlus <= xPlus + delta && xMinus <= yMinus + delta) {
double score = combinedScore(xPlus, yMinus);
if (yPlus <= yMinus + delta && xMinus <= xPlus + delta) {
StringBuilder builder = new StringBuilder();
builder.append("\nStrong " + y + "->" + x + " " + score);
builder.append("\n Parents(" + x + ") = " + condxMinus);
builder.append("\n Parents(" + y + ") = " + condyMinus);
scoreReports.put(-score, builder.toString());
if (score > max) {
max = score;
left = true;
right = false;
}
} else {
StringBuilder builder = new StringBuilder();
builder.append("\nNo directed edge " + x + "--" + y + " " + score);
builder.append("\n Parents(" + x + ") = " + condxMinus);
builder.append("\n Parents(" + y + ") = " + condyMinus);
scoreReports.put(-score, builder.toString());
}
} else if (xPlus <= yPlus + delta && yMinus <= xMinus + delta) {
double score = combinedScore(yPlus, xMinus);
if (yMinus <= yPlus + delta && xPlus <= xMinus + delta) {
StringBuilder builder = new StringBuilder();
builder.append("\nStrong " + x + "->" + y + " " + score);
builder.append("\n Parents(" + x + ") = " + condxMinus);
builder.append("\n Parents(" + y + ") = " + condyMinus);
scoreReports.put(-score, builder.toString());
if (score > max) {
max = score;
left = false;
right = true;
}
} else {
StringBuilder builder = new StringBuilder();
builder.append("\nNo directed edge " + x + "--" + y + " " + score);
builder.append("\n Parents(" + x + ") = " + condxMinus);
builder.append("\n Parents(" + y + ") = " + condyMinus);
scoreReports.put(-score, builder.toString());
}
} else if (yPlus <= xPlus + delta && yMinus <= xMinus + delta) {
double score = combinedScore(yPlus, xMinus);
StringBuilder builder = new StringBuilder();
builder.append("\nNo directed edge " + x + "--" + y + " " + score);
builder.append("\n Parents(" + x + ") = " + condxMinus);
builder.append("\n Parents(" + y + ") = " + condyMinus);
scoreReports.put(-score, builder.toString());
} else if (xPlus <= yPlus + delta && xMinus <= yMinus + delta) {
double score = combinedScore(yPlus, xMinus);
StringBuilder builder = new StringBuilder();
builder.append("\nNo directed edge " + x + "--" + y + " " + score);
builder.append("\n Parents(" + x + ") = " + condxMinus);
builder.append("\n Parents(" + y + ") = " + condyMinus);
scoreReports.put(-score, builder.toString());
}
} else {
if (yPlus <= xPlus + delta && xMinus <= yMinus + delta) {
double score = combinedScore(xPlus, yMinus);
StringBuilder builder = new StringBuilder();
builder.append("\nWeak " + y + "->" + x + " " + score);
builder.append("\n Parents(" + x + ") = " + condxMinus);
builder.append("\n Parents(" + y + ") = " + condyMinus);
scoreReports.put(-score, builder.toString());
if (score > max) {
max = score;
left = true;
right = false;
}
} else if (xPlus <= yPlus + delta && yMinus <= xMinus + delta) {
double score = combinedScore(yPlus, xMinus);
StringBuilder builder = new StringBuilder();
builder.append("\nWeak " + x + "->" + y + " " + score);
builder.append("\n Parents(" + x + ") = " + condxMinus);
builder.append("\n Parents(" + y + ") = " + condyMinus);
scoreReports.put(-score, builder.toString());
if (score > max) {
max = score;
left = false;
right = true;
}
} else if (yPlus <= xPlus + delta && yMinus <= xMinus + delta) {
double score = combinedScore(yPlus, xMinus);
StringBuilder builder = new StringBuilder();
builder.append("\nNo directed edge " + x + "--" + y + " " + score);
builder.append("\n Parents(" + x + ") = " + condxMinus);
builder.append("\n Parents(" + y + ") = " + condyMinus);
scoreReports.put(-score, builder.toString());
} else if (xPlus <= yPlus + delta && xMinus <= yMinus + delta) {
double score = combinedScore(yPlus, xMinus);
StringBuilder builder = new StringBuilder();
builder.append("\nNo directed edge " + x + "--" + y + " " + score);
builder.append("\n Parents(" + x + ") = " + condxMinus);
builder.append("\n Parents(" + y + ") = " + condyMinus);
scoreReports.put(-score, builder.toString());
}
}
}
}
for (double score : scoreReports.keySet()) {
TetradLogger.getInstance().log("info", scoreReports.get(score));
}
graph.removeEdges(x, y);
if (left) {
graph.addDirectedEdge(y, x);
}
if (right) {
graph.addDirectedEdge(x, y);
}
if (!graph.isAdjacentTo(x, y)) {
graph.addUndirectedEdge(x, y);
}
}