Package edu.cmu.tetrad.search.utils

Class DagToPag

java.lang.Object

edu.cmu.tetrad.search.utils.DagToPag

public final class DagToPag
extends Object

Converts a DAG (Directed acyclic graph) into the PAG (partial ancestral graph) which it is in the equivalence class of.

Version:

$Id: $Id

Author:

josephramsey, peterspirtes

Constructor Summary

Constructors

Constructor	Description
DagToPag(Graph dag)	Constructs a new FCI search for the given independence test and background knowledge.

Method Summary

Modifier and Type	Method	Description
static Graph	calcAdjacencyGraph(Graph dag)	Calculates the adjacency graph for the given Directed Acyclic Graph (DAG).
Graph	convert()	This method does the conversion of DAG to PAG.
static R0R4StrategyTestBased	getFinalStrategyUsingDsep(Graph mag, Knowledge knowledge, boolean verbose)	Returns the final strategy for finding a PAG using D-SEP.
Knowledge	getKnowledge()	Getter for the field knowledge.
boolean	isCompleteRuleSetUsed()	isCompleteRuleSetUsed.
void	setCompleteRuleSetUsed(boolean completeRuleSetUsed)	Setter for the field completeRuleSetUsed.
void	setKnowledge(Knowledge knowledge)	Setter for the field knowledge.
void	setVerbose(boolean verbose)	Setws whether verbose output should be printed.

Methods inherited from class java.lang.Object

equals, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Constructor Details

DagToPag

public DagToPag(Graph dag)

Constructs a new FCI search for the given independence test and background knowledge.

Parameters:

dag - a Graph object

Method Details

calcAdjacencyGraph

public static Graph calcAdjacencyGraph(Graph dag)

Calculates the adjacency graph for the given Directed Acyclic Graph (DAG).

Parameters:

dag - The input Directed Acyclic Graph (DAG).

Returns:

The adjacency graph represented by a Graph object.

getFinalStrategyUsingDsep

public static R0R4StrategyTestBased getFinalStrategyUsingDsep(Graph mag,
 Knowledge knowledge,
 boolean verbose)

Returns the final strategy for finding a PAG using D-SEP.

Parameters:

mag - the MAG (Maximum Ancestral Graph) representation of the graph

knowledge - the background knowledge used for the orientation

verbose - a boolean indicating whether verbose output should be printed

Returns:

the final strategy for finding a PAG using D-SEP

convert

public Graph convert()

This method does the conversion of DAG to PAG.

Returns:

Returns the converted PAG.

getKnowledge

public Knowledge getKnowledge()

Getter for the field knowledge.

Returns:

a Knowledge object

setKnowledge

public void setKnowledge(Knowledge knowledge)

Setter for the field knowledge.

Parameters:

knowledge - a Knowledge object

isCompleteRuleSetUsed

public boolean isCompleteRuleSetUsed()

isCompleteRuleSetUsed.

Returns:

true if Zhang's complete rule set should be used, false if only R1-R4 (the rule set of the original FCI) should be used. False by default.

setCompleteRuleSetUsed

public void setCompleteRuleSetUsed(boolean completeRuleSetUsed)

Setter for the field completeRuleSetUsed.

Parameters:

completeRuleSetUsed - set to true if Zhang's complete rule set should be used, false if only R1-R4 (the rule set of the original FCI) should be used. False by default.

setVerbose

public void setVerbose(boolean verbose)

Setws whether verbose output should be printed.

Parameters:

verbose - True, if so.