possibleParents = new LinkedList<>();
String _x = x.getName();
for (Node z : nodes) {
String _z = z.getName();
if (possibleParentOf(_z, _x, knowledge)) {
possibleParents.add(z);
}
}
return possibleParents;
}
private boolean possibleParentOf(String _z, String _x, IKnowledge bk) {
return !(bk.isForbidden(_z, _x) || bk.isRequired(_x, _z));
}
/**
* A variable v is in Possible-D-Sep(A,B) iff
*
* (i) v != A & v != B
* (ii) there is an undirected path U between A and v such that for every
* subpath of U either:
* (a) Y is a collider on the subpath, or
* (b) X is adjacent to Z.
*
*/
private Set getPossibleDsep(Node node1, Node node2, int maxPathLength) {
Set dsep = GraphUtils.possibleDsep(node1, node2, graph, maxPathLength);
dsep.remove(node1);
dsep.remove(node2);
// TetradLogger.getInstance().log("details", "Possible-D-Sep(" + node1 + ", " + node2 + ") = " + dsep);
return dsep;
}
public int getDepth() {
return depth;
}
public void setDepth(int depth) {
if (depth < -1) {
throw new IllegalArgumentException(
"Depth must be -1 (unlimited) or >= 0: " + depth);
}
this.depth = depth;
}
public IKnowledge getKnowledge() {
return knowledge;
}
public void setKnowledge(IKnowledge knowledge) {
this.knowledge = knowledge;
}
public int getMaxReachablePathLength() {
return maxReachablePathLength == Integer.MAX_VALUE ? -1 : maxReachablePathLength;
}
public void setMaxPathLength(int maxReachablePathLength) {
if (maxReachablePathLength < -1) {
throw new IllegalArgumentException("Max path length must be -1 (unlimited) or >= 0: " + maxReachablePathLength);
}
this.maxReachablePathLength = maxReachablePathLength == -1 ? Integer.MAX_VALUE : maxReachablePathLength;
}
}