Package edu.cmu.tetrad.search
Class PcLocal
java.lang.Object
edu.cmu.tetrad.search.PcLocal
- All Implemented Interfaces:
GraphSearch
Implements the PC Local algorithm.
- Author:
- Joseph Ramsey (this version).
-
Constructor Summary
ConstructorsConstructorDescriptionPcLocal
(IndependenceTest independenceTest) Constructs a PC Local search with the given independence oracle.PcLocal
(IndependenceTest independenceTest, Graph graph) -
Method Summary
Modifier and TypeMethodDescriptionlong
boolean
static boolean
isArrowpointAllowed
(Object from, Object to, Knowledge knowledge) Checks if an arrowpoint is allowed by background knowledge.boolean
search()
Runs PC starting with a fully connected graph over all of the variables in the domain of the independence test.void
setAggressivelyPreventCycles
(boolean aggressivelyPreventCycles) void
setExternalGraph
(Graph externalGraph) void
setKnowledge
(Knowledge knowledge) void
setVerbose
(boolean verbose)
-
Constructor Details
-
PcLocal
Constructs a PC Local search with the given independence oracle. -
PcLocal
-
-
Method Details
-
isAggressivelyPreventCycles
public boolean isAggressivelyPreventCycles() -
setAggressivelyPreventCycles
public void setAggressivelyPreventCycles(boolean aggressivelyPreventCycles) -
getIndependenceTest
-
getKnowledge
-
setKnowledge
-
getElapsedTime
public long getElapsedTime() -
search
Runs PC starting with a fully connected graph over all of the variables in the domain of the independence test.- Specified by:
search
in interfaceGraphSearch
-
isArrowpointAllowed
Checks if an arrowpoint is allowed by background knowledge. -
getSepsets
-
isVerbose
public boolean isVerbose() -
setVerbose
public void setVerbose(boolean verbose) -
setExternalGraph
-