x
the input graph, a DAG, MAG, or PDAG.
type
can be one of "missing.edge" or "basis.set". With the former, one testable
implication is returned per missing edge of the graph. With the latter, one testable
implication is returned per vertex of the graph that has non-descendants other than
its parents. Basis sets can be smaller, but they involve higher-dimensional independencies,
whereas missing edge sets involve only bivariate independencies.