d_separated(G, x, y, z)

Parameters

G : graph

A NetworkX DAG.

x : set

First set of nodes in G .

y : set

Second set of nodes in G .

z : set

Set of conditioning nodes in G . Can be empty set.

Raises

NetworkXError

The d-separation test is commonly used with directed graphical models which are acyclic. Accordingly, the algorithm raises a NetworkXError if the input graph is not a DAG.

NodeNotFound

If any of the input nodes are not found in the graph, a NodeNotFound exception is raised.

Returns

b : bool

A boolean that is true if x is d-separated from y given z in G .

Return whether node sets x and y are d-separated by z .

Examples

See :

Local connectivity graph

Hover to see nodes names; edges to Self not shown, Caped at 50 nodes.

Using a canvas is more power efficient and can get hundred of nodes ; but does not allow hyperlinks; , arrows or text (beyond on hover)

SVG is more flexible but power hungry; and does not scale well to 50 + nodes.

All aboves nodes referred to, (or are referred from) current nodes; Edges from Self to other have been omitted (or all nodes would be connected to the central node "self" which is not useful). Nodes are colored by the library they belong to, and scaled with the number of references pointing them

---

GitHub : /networkx/algorithms/d_separation.py#68
type: <class 'function'>
Commit: