summaryrefslogtreecommitdiff
path: root/_modules/networkx/algorithms/d_separation.html
diff options
context:
space:
mode:
authorMridulS <mail@mriduls.com>2023-01-02 13:08:27 +0000
committerMridulS <mail@mriduls.com>2023-01-02 13:08:27 +0000
commit0b9a02d6b3796e8ce4fed6cbce282fced15e486a (patch)
tree8b48b18926291619367d4f9537892bd228bf7987 /_modules/networkx/algorithms/d_separation.html
parent6ae99ab58d8b8ba50f66768c0f3aa4bb82b22196 (diff)
downloadnetworkx-0b9a02d6b3796e8ce4fed6cbce282fced15e486a.tar.gz
Deploying to gh-pages from @ networkx/networkx@71ad516a90c89c7294e32bf28e1f05c63c5f17e4 🚀
Diffstat (limited to '_modules/networkx/algorithms/d_separation.html')
-rw-r--r--_modules/networkx/algorithms/d_separation.html10
1 files changed, 5 insertions, 5 deletions
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 @@
<div class="viewcode-block" id="d_separated"><a class="viewcode-back" href="../../../reference/algorithms/generated/networkx.algorithms.d_separation.d_separated.html#networkx.algorithms.d_separation.d_separated">[docs]</a><span class="nd">@not_implemented_for</span><span class="p">(</span><span class="s2">&quot;undirected&quot;</span><span class="p">)</span>
<span class="k">def</span> <span class="nf">d_separated</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">x</span><span class="p">,</span> <span class="n">y</span><span class="p">,</span> <span class="n">z</span><span class="p">):</span>
- <span class="sd">&quot;&quot;&quot;</span>
+<span class="w"> </span><span class="sd">&quot;&quot;&quot;</span>
<span class="sd"> Return whether node sets ``x`` and ``y`` are d-separated by ``z``.</span>
<span class="sd"> Parameters</span>
@@ -677,7 +677,7 @@
<span class="nd">@not_implemented_for</span><span class="p">(</span><span class="s2">&quot;undirected&quot;</span><span class="p">)</span>
<span class="k">def</span> <span class="nf">minimal_d_separator</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">u</span><span class="p">,</span> <span class="n">v</span><span class="p">):</span>
- <span class="sd">&quot;&quot;&quot;Compute a minimal d-separating set between &#39;u&#39; and &#39;v&#39;.</span>
+<span class="w"> </span><span class="sd">&quot;&quot;&quot;Compute a minimal d-separating set between &#39;u&#39; and &#39;v&#39;.</span>
<span class="sd"> A d-separating set in a DAG is a set of nodes that blocks all paths</span>
<span class="sd"> between the two nodes, &#39;u&#39; and &#39;v&#39;. This function</span>
@@ -759,7 +759,7 @@
<span class="nd">@not_implemented_for</span><span class="p">(</span><span class="s2">&quot;undirected&quot;</span><span class="p">)</span>
<span class="k">def</span> <span class="nf">is_minimal_d_separator</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">u</span><span class="p">,</span> <span class="n">v</span><span class="p">,</span> <span class="n">z</span><span class="p">):</span>
- <span class="sd">&quot;&quot;&quot;Determine if a d-separating set is minimal.</span>
+<span class="w"> </span><span class="sd">&quot;&quot;&quot;Determine if a d-separating set is minimal.</span>
<span class="sd"> A d-separating set, `z`, in a DAG is a set of nodes that blocks</span>
<span class="sd"> all paths between the two nodes, `u` and `v`. This function</span>
@@ -861,7 +861,7 @@
<span class="nd">@not_implemented_for</span><span class="p">(</span><span class="s2">&quot;directed&quot;</span><span class="p">)</span>
<span class="k">def</span> <span class="nf">_bfs_with_marks</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">start_node</span><span class="p">,</span> <span class="n">check_set</span><span class="p">):</span>
- <span class="sd">&quot;&quot;&quot;Breadth-first-search with markings.</span>
+<span class="w"> </span><span class="sd">&quot;&quot;&quot;Breadth-first-search with markings.</span>
<span class="sd"> Performs BFS starting from ``start_node`` and whenever a node</span>
<span class="sd"> inside ``check_set`` is met, it is &quot;marked&quot;. Once a node is marked,</span>
@@ -953,7 +953,7 @@
<p class="copyright">
- &copy; Copyright 2004-2022, NetworkX Developers.<br>
+ &copy; Copyright 2004-2023, NetworkX Developers.<br>
</p>