Class RecursiveAdjustmentMultipleTest
java.lang.Object
edu.cmu.tetrad.search.RecursiveAdjustmentMultipleTest
Sanity checks for AdjustmentMultiple:
-
Constructor Summary
ConstructorsConstructorDescriptionConstructor for the RecursiveAdjustmentMultipleTest class. -
Method Summary
Modifier and TypeMethodDescriptionvoidTests the adjustment set computation for a Directed Acyclic Graph (DAG) with multiple treatments sharing a common backdoor path to the outcome.voidTests whether specifying different possible endpoint options in the adjustment set computation produces solutions from the same only slightly reordered but identical solution families.voidTests the adjustment set computation for a simple Directed Acyclic Graph (DAG) with a single treatment-outcome pair.
-
Constructor Details
-
RecursiveAdjustmentMultipleTest
public RecursiveAdjustmentMultipleTest()Constructor for the RecursiveAdjustmentMultipleTest class. This class is used for testing scenarios involving the computation of adjustment sets in Directed Acyclic Graphs (DAGs). It provides methods for testing single treatment-outcome pairs, multiple treatments with shared backdoor paths, and validation of solution consistency under different configurations.
-
-
Method Details
-
testSinglePairSimpleDAG
public void testSinglePairSimpleDAG()Tests the adjustment set computation for a simple Directed Acyclic Graph (DAG) with a single treatment-outcome pair. -
testNearWhichEndpointDoesNotChangeSolutions
public void testNearWhichEndpointDoesNotChangeSolutions()Tests whether specifying different possible endpoint options in the adjustment set computation produces solutions from the same only slightly reordered but identical solution families.
-