graphical_models.classes.mags.ancestral_graph.AncestralGraph.msep_from_given

AncestralGraph.msep_from_given(A: Set[Hashable], C: Set[Hashable] = {}) → Set[Hashable][source]

Find all nodes m-separated from A given C.

Uses algorithm similar to that in Geiger, D., Verma, T., & Pearl, J. (1990). Identifying independence in Bayesian networks. Networks, 20(5), 507-534.