Package edu.cmu.tetrad.search

Class OrientCollidersMaxP

java.lang.Object
edu.cmu.tetrad.search.OrientCollidersMaxP
public final class OrientCollidersMaxP extends Object
This is an optimization of the CCD (Cyclic Causal Discovery) algorithm by Thomas Richardson.
Author:
Joseph Ramsey

  • Constructor Details

  • Method Details

    • orient

      public void orient(Graph graph)
      Searches for a PAG satisfying the description in Thomas Richardson (1997), dissertation, Carnegie Mellon University. Uses a simplification of that algorithm.

    • getDepth

      public int getDepth()
      Returns:
      The depth of search for the Fast Adjacency Search.

    • setDepth

      public void setDepth(int depth)
      Parameters:
      depth - The depth of search for the Fast Adjacency Search.

    • getKnowledge

      public Knowledge getKnowledge()

    • setKnowledge

      public void setKnowledge(Knowledge knowledge)

    • setUseHeuristic

      public void setUseHeuristic(boolean useHeuristic)

    • getMaxPathLength

      public int getMaxPathLength()

    • setMaxPathLength

      public void setMaxPathLength(int maxPathLength)

    • orientCollider

      public static void orientCollider(Node x, Node y, Node z, PcAll.ConflictRule conflictRule, Graph graph)

    • getConflictRule

      public PcAll.ConflictRule getConflictRule()

    • setConflictRule

      public void setConflictRule(PcAll.ConflictRule conflictRule)