Package edu.cmu.tetrad.search

Class PossibleDConnectingPath

java.lang.Object

edu.cmu.tetrad.search.PossibleDConnectingPath

public class PossibleDConnectingPath
extends Object

Finds possible d-connecting undirectedPaths for the IonSearch.

Not thread safe.

Author:

Tyler Gibson

Method Summary

Modifier and Type	Method	Description
boolean	equals(Object o)
static List<PossibleDConnectingPath>	findDConnectingPaths(Graph pag, Node x, Node y, Collection<Node> z)	Finds all possible D-connection undirectedPaths as sub-graphs of the pag given at construction time from x to y given z.
static List<PossibleDConnectingPath>	findDConnectingPathsOfLength(Graph pag, Node x, Node y, Collection<Node> z, Integer length)	Finds all possible D-connection undirectedPaths as sub-graphs of the pag given at construction time from x to y given z for a particular path length.
Set<Node>	getConditions()
Graph	getPag()
List<Node>	getPath()
String	toString()

Methods inherited from class java.lang.Object

clone, finalize, getClass, hashCode, notify, notifyAll, wait, wait, wait

Method Details

getPag

public Graph getPag()

getConditions

public Set<Node> getConditions()

getPath

public List<Node> getPath()

toString

public String toString()

Overrides:

toString in class Object

findDConnectingPaths

public static List<PossibleDConnectingPath> findDConnectingPaths(Graph pag,
 Node x,
 Node y,
 Collection<Node> z)

Finds all possible D-connection undirectedPaths as sub-graphs of the pag given at construction time from x to y given z.

findDConnectingPathsOfLength

public static List<PossibleDConnectingPath> findDConnectingPathsOfLength(Graph pag,
 Node x,
 Node y,
 Collection<Node> z,
 Integer length)

Finds all possible D-connection undirectedPaths as sub-graphs of the pag given at construction time from x to y given z for a particular path length.

equals

public boolean equals(Object o)

Overrides:

equals in class Object