Uses of Class
edu.cmu.tetrad.search.utils.PossibleMConnectingPath

Packages that use PossibleMConnectingPath

Package	Description
edu.cmu.tetrad.search.utils	This package contains utility classes for causal graph search algorithms.

Uses of PossibleMConnectingPath in edu.cmu.tetrad.search.utils

Methods in edu.cmu.tetrad.search.utils that return types with arguments of type PossibleMConnectingPath

Modifier and Type	Method	Description
static List<PossibleMConnectingPath>	PossibleMConnectingPath.findMConnectingPaths(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<PossibleMConnectingPath>	PossibleMConnectingPath.findMConnectingPathsOfLength(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.