Parents

CPDAG

A (very) simple rule table for computing the parents of a set of nodes $X$ in a completed partially directed acyclic graph (CPDAG). Of course, this task can also be easily solved without a CIfly algorithm.

EDGES --> <--, ---
SETS X
COLORS init, yield
START <-- [init] AT X
OUTPUT <-- [yield]

<-- [init] | <-- [yield] | next not in X

Graph type:

CPDAG

Applications:

Optimal adjustment sets