Class DmPc

java.lang.Object
edu.cmu.tetrad.algcomparison.algorithm.AbstractBootstrapAlgorithm
edu.cmu.tetrad.algcomparison.algorithm.oracle.pag.DmPc
All Implemented Interfaces:
Algorithm, ReturnsBootstrapGraphs, TakesCovarianceMatrix, AcceptsKnowledge, HasParameters, TakesIndependenceWrapper, TetradSerializable, Serializable
public class DmPc extends AbstractBootstrapAlgorithm implements Algorithm, TakesIndependenceWrapper, AcceptsKnowledge, ReturnsBootstrapGraphs, TakesCovarianceMatrix
DM-PC, removed in Tetrad 8.0.0.

Backward compatibility only, and not runnable. This class is retained under its original name so that sessions saved by Tetrad 7.6.10 and earlier, which refer to it by this class name, continue to load: without it the whole session fails to open, not merely this box. Its registration annotations are commented out, so it does not appear in the algorithm chooser.

Unlike the other compatibility classes, this one cannot reproduce the original behavior, because edu.cmu.tetrad.search.DmPc no longer exists. Running it therefore throws UnsupportedOperationException with an explanation rather than returning a graph that was computed some other way. A restored session opens, shows whatever graph it had stored, and reports the removal if the search is re-run.

Version:
$Id: $Id
Author:
josephramsey
See Also:

  • Constructor Details

    • DmPc

      public DmPc()
      No-arg constructor. Used for reflection; do not delete.

  • Method Details

    • runSearch

      public Graph runSearch(DataModel dataModel, Parameters parameters)
      Always throws, because the implementation this class wrapped was removed in Tetrad 8.0.0.
      Parameters:
      dataModel - ignored
      parameters - ignored
      Returns:
      never returns

    • getComparisonGraph

      public Graph getComparisonGraph(Graph graph)
      Returns that graph that the result should be compared to.
      Specified by:
      getComparisonGraph in interface Algorithm
      Parameters:
      graph - The true directed graph, if there is one.
      Returns:
      The comparison graph.

    • getDescription

      public String getDescription()
      Returns a short, one-line description of this algorithm. This will be printed in the report.
      Specified by:
      getDescription in interface Algorithm
      Returns:
      This description.

    • getDataType

      public DataType getDataType()
      Returns the data type that the search requires, whether continuous, discrete, or mixed.
      Specified by:
      getDataType in interface Algorithm
      Returns:
      This type.

    • getParameters

      public List<String> getParameters()
      Returns the list of parameter names that are used. These are looked up in ParamMap, so if they're not
      Specified by:
      getParameters in interface HasParameters
      Returns:
      Returns the list of parameter names that are used. These are looked up in ParamMap, so if they're not already defined they'll need to be defined there.

    • getKnowledge

      public Knowledge getKnowledge()
      Returns a knowledge object.
      Specified by:
      getKnowledge in interface AcceptsKnowledge
      Returns:
      a knowledge object.

    • setKnowledge

      public void setKnowledge(Knowledge knowledge)
      Sets a knowledge object.
      Specified by:
      setKnowledge in interface AcceptsKnowledge
      Parameters:
      knowledge - a knowledge object.

    • getIndependenceWrapper

      public IndependenceWrapper getIndependenceWrapper()
      Returns the independence wrapper.
      Specified by:
      getIndependenceWrapper in interface TakesIndependenceWrapper
      Returns:
      the independence wrapper.

    • setIndependenceWrapper

      public void setIndependenceWrapper(IndependenceWrapper test)
      Sets the independence wrapper.
      Specified by:
      setIndependenceWrapper in interface TakesIndependenceWrapper
      Parameters:
      test - the independence wrapper.