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.

Version:

$Id: $Id

Author:

josephramsey

Method Summary

Modifier and Type	Method	Description
boolean	isLegalFirstEdge(Node x, Node y)	isLegalFirstEdge.
boolean	isLegalPair(Node x, Node y, Node z, List<Node> c, List<Node> d)	isLegalPair.

Method Details

isLegalFirstEdge

boolean isLegalFirstEdge(Node x,
 Node y)

isLegalFirstEdge.

Parameters:

x - a Node object

y - a Node object

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)

isLegalPair.

Parameters:

x - a Node object

y - a Node object

z - a Node object

c - a List object

d - a List object

Returns:

true iff n1---center---n2 is a legal pair.