causaldag.classes.dag.DAG.dsep_from_given¶
-
DAG.
dsep_from_given
(A, C: Union[Hashable, Set[Hashable]] = frozenset()) → Set[Hashable][source]¶ Find all nodes d-separated from
A
givenC
.Uses algorithm in Geiger, D., Verma, T., & Pearl, J. (1990). Identifying independence in Bayesian networks. Networks, 20(5), 507-534.
Parameters: - A – set of nodes.
- C – set of conditioned nodes.
Returns: Nodes which are d-separated from
A
givenC
.Return type: set
Examples
>>> import causaldag as cd >>> d = cd.DAG(arcs={(0, 1), (1, 2), (2, 3), (3, 4)}) >>> d.dsep_from_given(0, 1) {2, 3, 4]