Package edu.cmu.tetrad.search

Class CcdMax

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

  • Constructor Details

  • Method Details

    • search

      public Graph search()
      Specified by:
      search in interface GraphSearch

    • 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.

    • getElapsedTime

      public long getElapsedTime()
      Returns:
      The elapsed time in milliseconds.

    • setApplyOrientAwayFromCollider

      public void setApplyOrientAwayFromCollider(boolean applyOrientAwayFromCollider)
      Parameters:
      applyOrientAwayFromCollider - True if the orient away from collider rule should be applied.

    • 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)

    • setUseOrientTowardDConnections

      public void setUseOrientTowardDConnections(boolean useOrientTowardDConnections)

    • setOrientConcurrentFeedbackLoops

      public void setOrientConcurrentFeedbackLoops(boolean orientConcurrentFeedbackLoops)

    • setDoColliderOrientations

      public void setDoColliderOrientations(boolean doColliderOrientations)

    • setCollapseTiers

      public void setCollapseTiers(boolean collapseTiers)