Enum Class VertexRepairSearch.AdjustmentGraphType
java.lang.Object
java.lang.Enum<VertexRepairSearch.AdjustmentGraphType>
edu.cmu.tetrad.search.VertexRepairSearch.AdjustmentGraphType
- All Implemented Interfaces:
Serializable, Comparable<VertexRepairSearch.AdjustmentGraphType>, Constable
- Enclosing class:
VertexRepairSearch
public static enum VertexRepairSearch.AdjustmentGraphType
extends Enum<VertexRepairSearch.AdjustmentGraphType>
Graph types supported by the repair search.
- Author:
- josephramsey (extracted from VertexRepairPanelGlobalRepair)
-
Nested Class Summary
Nested classes/interfaces inherited from class Enum
Enum.EnumDesc<E> -
Enum Constant Summary
Enum ConstantsEnum ConstantDescriptionA completed partially directed acyclic graph: the Markov-equivalence class of a DAG, with compelled edges directed and the rest left undirected.A directed acyclic graph: every edge is directed and there is no directed cycle.A maximal ancestral graph: directed and bidirected edges, admitting latent confounders, with an edge between every pair of vertices not m-separated by any set.A partial ancestral graph: the equivalence class of a MAG, admitting latent confounders and using circle endpoints for undetermined orientations.A partially directed acyclic graph: directed and undirected edges, no directed cycle. -
Method Summary
Modifier and TypeMethodDescriptionReturns the enum constant of this class with the specified name.values()Returns an array containing the constants of this enum class, in the order they are declared.Methods inherited from class Enum
compareTo, describeConstable, equals, getDeclaringClass, hashCode, name, ordinal, toString, valueOf
-
Enum Constant Details
-
CPDAG
A completed partially directed acyclic graph: the Markov-equivalence class of a DAG, with compelled edges directed and the rest left undirected. Candidate graphs are canonicalized back to a CPDAG after every edit. -
PDAG
A partially directed acyclic graph: directed and undirected edges, no directed cycle. UnlikeCPDAG, no canonicalization is applied, so the orientation of non-compelled edges is preserved as edited. -
PAG
A partial ancestral graph: the equivalence class of a MAG, admitting latent confounders and using circle endpoints for undetermined orientations. Candidate graphs are canonicalized back to a PAG after every edit. -
DAG
A directed acyclic graph: every edge is directed and there is no directed cycle. Assumes causal sufficiency. -
MAG
A maximal ancestral graph: directed and bidirected edges, admitting latent confounders, with an edge between every pair of vertices not m-separated by any set.
-
-
Method Details
-
values
Returns an array containing the constants of this enum class, in the order they are declared.- Returns:
- an array containing the constants of this enum class, in the order they are declared
-
valueOf
Returns the enum constant of this class with the specified name. The string must match exactly an identifier used to declare an enum constant in this class. (Extraneous whitespace characters are not permitted.)- Parameters:
name- the name of the enum constant to be returned.- Returns:
- the enum constant with the specified name
- Throws:
IllegalArgumentException- if this enum class has no constant with the specified nameNullPointerException- if the argument is null
-