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

Packages that use FciOrient

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

Uses of FciOrient in edu.cmu.tetrad.graph

Methods in edu.cmu.tetrad.graph with parameters of type FciOrient

Modifier and Type	Method	Description
static Graph	GraphUtils.guaranteePag(Graph pag, FciOrient fciOrient, Knowledge knowledge, Set<Triple> knownColliders, boolean verbose, Set<Node> selection)	Guarantees the correctness of a Partial Ancestral Graph (PAG) by repairing faulty structures such as cycles, violations of maximality, and incorrectly oriented edges.
static boolean	GraphUtils.repairMaximality(Graph pag, boolean verbose, Set<Node> selection, FciOrient fciOrient, Knowledge knowledge, Set<Triple> knownColliders)	Repairs the maximality of a PAG (Partial Ancestral Graph) by ensuring that any inducing path between two nodes not currently adjacent in the graph results in an added non-directed edge.

Uses of FciOrient in edu.cmu.tetrad.search

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

Modifier and Type	Method	Description
static Set<Node>	RecursiveDiscriminatingPathRule.findDdpSepsetRecursive(IndependenceTest test, Graph pag, Node x, Node y, FciOrient fciOrient, int maxBlockingPathLength, int maxDdpPathLength, PreserveMarkov preserveMarkovHelper, int depth)	Finds the set of nodes (separator set) for the Recursive Discriminating Path rule in a graph.