- d_separated(G, x, y, z)[source]#
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.
A d-separating set in a DAG is a set of nodes that blocks all paths between the two sets. Nodes in
zblock a path if they are part of the path and are not a collider, or a descendant of a collider. A collider structure along a path is
... -> c <- ...where
cis the collider node.