Package edu.cmu.tetrad.graph
Class Paths
java.lang.Object
edu.cmu.tetrad.graph.Paths
- All Implemented Interfaces:
TetradSerializable
,Serializable
- See Also:
-
Nested Class Summary
Nested Classes -
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionallDirectedPathsFromTo
(Node node1, Node node2, int maxLength) allPathsFromTo
(Node node1, Node node2, int maxLength) boolean
definiteNonDescendent
(Node node1, Node node2) added by ekorber, 2004/06/12boolean
defVisible
(Edge edge) added by ekorber, 2004/06/11directedPathsFromTo
(Node node1, Node node2, int maxLength) boolean
boolean
existsDirectedPathFromTo
(Node node1, Node node2) boolean
existsDirectedPathFromTo
(Node node1, Node node2, int depth) boolean
existsInducingPath
(Node x, Node y) Determines whether an inducing path exists between node1 and node2, given a set O of observed nodes and a set sem of conditioned nodes.boolean
existsInducingPathVisit
(Node a, Node b, Node x, Node y, LinkedList<Node> path) boolean
existsSemiDirectedPath
(Node from, Node to) boolean
existsSemiDirectedPath
(Node node1, Set<Node> nodes) boolean
existsTrek
(Node node1, Node node2) Determines whether a trek exists between two nodes in the graph.Return a map from each node to its ancestors.getAncestors
(List<Node> nodes) getDescendants
(List<Node> nodes) getInducingPath
(Node x, Node y) getMConnectedVars
(Node y, Set<Node> z) getValidOrder
(List<Node> initialOrder, boolean forward) Returns a valid causal order for either a DAG or a CPDAG.boolean
isAncestorOf
(Node node1, Node node2) Determines whether one node is an ancestor of another.boolean
isDescendentOf
(Node node1, Node node2) Determines whether one node is a descendent of another.boolean
isDirectedFromTo
(Node node1, Node node2) boolean
isMConnectedTo
(Node x, Node y, Set<Node> z) Detemrmines whether x and y are d-connected given z.boolean
Detemrmines whether x and y are d-connected given z.boolean
boolean
Checks to see if x and y are d-connected given z.boolean
isMSeparatedFrom
(Node node1, Node node2, Set<Node> z) Determines whether one n ode is d-separated from another.boolean
Check to see if a set of variables Z satisfies the back-door criterion relative to node x and node y.boolean
isUndirectedFromTo
(Node node1, Node node2) void
makeValidOrder
(List<Node> order) boolean
possibleAncestor
(Node node1, Node node2) possibleMsep
(Node x, Node y, int maxPathLength) void
removeByPossibleMsep
(IndependenceTest test, SepsetMap sepsets) Remove edges by the possible m-separation rule.semidirectedPathsFromTo
(Node node1, Node node2, int maxLength) treksIncludingBidirected
(Node node1, Node node2)
-
Constructor Details
-
Paths
-
-
Method Details
-
getValidOrder
Returns a valid causal order for either a DAG or a CPDAG. (bryanandrews)- Parameters:
initialOrder
- Variables in the order will be kept as close to this initial order as possible, either the forward order or the reverse order, depending on the next parameter.forward
- Whether the variable will be iterated over in forward or reverse direction.- Returns:
- The valid causal order found.
-
makeValidOrder
-
maxCliques
-
connectedComponents
- Returns:
- the connected components of the given graph, as a list of lists of nodes.
-
directedPathsFromTo
-
semidirectedPathsFromTo
-
allPathsFromTo
-
allDirectedPathsFromTo
-
treks
-
treksIncludingBidirected
-
existsDirectedPathFromTo
-
existsSemiDirectedPath
-
isMConnectedTo
-
isMConnectedTo
public boolean isMConnectedTo(Set<Node> x, Set<Node> y, Set<Node> z, Map<Node, Set<Node>> ancestorMap) Checks to see if x and y are d-connected given z.- Parameters:
ancestorMap
- A map of nodes to their ancestors.- Returns:
- True if x and y are d-connected given z.
-
getMConnectedVars
-
getMConnectedVars
-
getAncestorMap
Return a map from each node to its ancestors.- Returns:
- This map.
-
existsInducingPath
Determines whether an inducing path exists between node1 and node2, given a set O of observed nodes and a set sem of conditioned nodes.- Parameters:
x
- the first node.y
- the second node.- Returns:
- true if an inducing path exists, false if not.
-
existsInducingPathVisit
-
getInducingPath
-
possibleMsep
-
removeByPossibleMsep
Remove edges by the possible m-separation rule.- Parameters:
test
- The independence test to use to remove edges.sepsets
- A sepset map to which sepsets should be added. May be null, in which case sepsets will not be recorded.
-
isSatisfyBackDoorCriterion
Check to see if a set of variables Z satisfies the back-door criterion relative to node x and node y. -
getSepset
-
isMConnectedTo
Detemrmines whether x and y are d-connected given z.- Returns:
- true if x and y are d-connected given z; false otherwise.
-
isMConnectedTo
Detemrmines whether x and y are d-connected given z.- Returns:
- true if x and y are d-connected given z; false otherwise.
-
defVisible
added by ekorber, 2004/06/11- Returns:
- true if the given edge is definitely visible (Jiji, pg 25)
- Throws:
IllegalArgumentException
- if the given edge is not a directed edge in the graph
-
existsDirectedCycle
public boolean existsDirectedCycle() -
existsDirectedPathFromTo
- Returns:
- true iff there is a (nonempty) directed path from node1 to node2. a
-
existsSemiDirectedPath
-
existsTrek
Determines whether a trek exists between two nodes in the graph. A trek exists if there is a directed path between the two nodes or else, for some third node in the graph, there is a path to each of the two nodes in question. -
getDescendants
-
isAncestorOf
Determines whether one node is an ancestor of another. -
getAncestors
-
isDescendentOf
Determines whether one node is a descendent of another. -
definiteNonDescendent
added by ekorber, 2004/06/12- Returns:
- true iff node2 is a definite nondecendent of node1
-
isMSeparatedFrom
Determines whether one n ode is d-separated from another. According to Spirtes, Richardson and Meek, two nodes are d- connected given some conditioning set Z if there is an acyclic undirected path U between them, such that every collider on U is an ancestor of some element in Z and every non-collider on U is not in Z. Two elements are d-separated just in case they are not d-connected. A collider is a node which two edges hold in common for which the endpoints leading into the node are both arrow endpoints.- Parameters:
node1
- the first node.node2
- the second node.z
- the conditioning set.- Returns:
- true if node1 is d-separated from node2 given set t, false if not.
- See Also:
-
isDirectedFromTo
-
isUndirectedFromTo
-
possibleAncestor
-