From 0b9a02d6b3796e8ce4fed6cbce282fced15e486a Mon Sep 17 00:00:00 2001 From: MridulS Date: Mon, 2 Jan 2023 13:08:27 +0000 Subject: =?UTF-8?q?Deploying=20to=20gh-pages=20from=20@=20networkx/network?= =?UTF-8?q?x@71ad516a90c89c7294e32bf28e1f05c63c5f17e4=20=F0=9F=9A=80?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- _modules/networkx/algorithms/d_separation.html | 10 +++++----- 1 file changed, 5 insertions(+), 5 deletions(-) (limited to '_modules/networkx/algorithms/d_separation.html') diff --git a/_modules/networkx/algorithms/d_separation.html b/_modules/networkx/algorithms/d_separation.html index c437ec20..f95c23cb 100644 --- a/_modules/networkx/algorithms/d_separation.html +++ b/_modules/networkx/algorithms/d_separation.html @@ -591,7 +591,7 @@
[docs]@not_implemented_for("undirected") def d_separated(G, x, y, z): - """ + """ Return whether node sets ``x`` and ``y`` are d-separated by ``z``. Parameters @@ -677,7 +677,7 @@ @not_implemented_for("undirected") def minimal_d_separator(G, u, v): - """Compute a minimal d-separating set between 'u' and 'v'. + """Compute a minimal d-separating set between 'u' and 'v'. A d-separating set in a DAG is a set of nodes that blocks all paths between the two nodes, 'u' and 'v'. This function @@ -759,7 +759,7 @@ @not_implemented_for("undirected") def is_minimal_d_separator(G, u, v, z): - """Determine if a d-separating set is minimal. + """Determine if a d-separating set is minimal. A d-separating set, `z`, in a DAG is a set of nodes that blocks all paths between the two nodes, `u` and `v`. This function @@ -861,7 +861,7 @@ @not_implemented_for("directed") def _bfs_with_marks(G, start_node, check_set): - """Breadth-first-search with markings. + """Breadth-first-search with markings. Performs BFS starting from ``start_node`` and whenever a node inside ``check_set`` is met, it is "marked". Once a node is marked, @@ -953,7 +953,7 @@

- © Copyright 2004-2022, NetworkX Developers.
+ © Copyright 2004-2023, NetworkX Developers.

-- cgit v1.2.1