graphical_models.classes.dags.dag.DAG.residual_essential_graph

DAG.residual_essential_graph()[source]

Return the residual essential graph associated with this DAG.

See the following for the definition of the residual essential graph: Squires, Chandler, et al. “Active Structure Learning of Causal DAGs via Directed Clique Tree.” (2020)

Returns: The directed clique tree of this DAG.
Return type: networkx.MultiDiGraph

Examples

>>> from graphical_models import DAG
>>> d = DAG(arcs={(0, 1), (1, 2), (1, 3), (1, 4), (3, 2), (3, 4)})
>>> r_eg = d.residual_essential_graph()
>>> r_eg.arcs
{(1, 2), (1, 3), (1, 4)}