pywhy_graphs.algorithms.pdag_to_dag

pywhy_graphs.algorithms.pdag_to_dag(G)

Compute consistent extension of given PDAG resulting in a DAG.

Implements the algorithm described in Figure 11 of [1].

Parameters:

GCPDAG

A partially directed acyclic graph.

Returns:

DAG

A directed acyclic graph.

References

[1]

David Maxwell Chickering. Learning equivalence classes of bayesian-network structures. The Journal of Machine Learning Research, 2:445–498, 2002.