Package edu.cmu.tetrad.search.utils

Interface LegalPairs

public interface LegalPairs
Determines whether nodes indexed as (n1, center, n2) form a legal pair of edges in a graph for purposes of some algorithm that uses this information. The pair would be n1---center---n2.
Author:
josephramsey

  • Method Details

    • isLegalFirstEdge

      boolean isLegalFirstEdge(Node x, Node y)
      Returns:
      true iff x*-*y is a legal first edge for the base case.

    • isLegalPair

      boolean isLegalPair(Node x, Node y, Node z, List<Node> c, List<Node> d)
      Returns:
      true iff n1---center---n2 is a legal pair.