This documents the development version of NetworkX. Documentation for the current release can be found here.
d_separated(G: networkx.classes.digraph.DiGraph, x: AbstractSet, y: AbstractSet, z: AbstractSet) → bool¶
Return whether node sets
yare d-separated by
A NetworkX DAG.
First set of nodes in
Second set of nodes in
Set of conditioning nodes in
G. Can be empty set.
A boolean that is true if
xis d-separated from
The d-separation test is commonly used with directed graphical models which are acyclic. Accordingly, the algorithm raises a
NetworkXErrorif the input graph is not a DAG.
If any of the input nodes are not found in the graph, a
NodeNotFoundexception is raised.