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

Packages that use IndependenceCheckCounter

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

Uses of IndependenceCheckCounter in edu.cmu.tetrad.search

Methods in edu.cmu.tetrad.search with parameters of type IndependenceCheckCounter

Modifier and Type	Method	Description
static Set<Node>	RecursiveDiscriminatingPathRule.findDdpSepsetRecursive(IndependenceTest test, Graph pag, Node x, Node y, int recursiveDepth, int maxDdpPathLength, int depth, PreserveMarkov preserveMarkovHelper, IndependenceCheckCounter counter)	Finds a separating set for the non-adjacent nodes x and y by recursive blocking over discriminating paths, returning the first passing candidate, with an independence-check counter and no timeout.
static Set<Node>	RecursiveDiscriminatingPathRule.findDdpSepsetRecursive(IndependenceTest test, Graph pag, Node x, Node y, int recursiveDepth, int maxDdpPathLength, int depth, PreserveMarkov preserveMarkovHelper, IndependenceCheckCounter counter, long timeout)	Finds a separating set for the non-adjacent nodes x and y by recursive blocking over discriminating paths, returning the first passing candidate.
static Set<Node>	RecursiveDiscriminatingPathRule.findDdpSepsetRecursive(IndependenceTest test, Graph pag, Node x, Node y, int recursiveDepth, int maxDdpPathLength, int depth, PreserveMarkov preserveMarkovHelper, IndependenceCheckCounter counter, long timeout, boolean useMaxP)	Finds a separating set for the non-adjacent nodes x and y by recursive blocking over discriminating paths, with control over how the set is chosen when more than one candidate renders x and y independent.