diff options
Diffstat (limited to '_modules/networkx/algorithms/flow/shortestaugmentingpath.html')
| -rw-r--r-- | _modules/networkx/algorithms/flow/shortestaugmentingpath.html | 10 |
1 files changed, 5 insertions, 5 deletions
diff --git a/_modules/networkx/algorithms/flow/shortestaugmentingpath.html b/_modules/networkx/algorithms/flow/shortestaugmentingpath.html index 27ebd430..d66305e1 100644 --- a/_modules/networkx/algorithms/flow/shortestaugmentingpath.html +++ b/_modules/networkx/algorithms/flow/shortestaugmentingpath.html @@ -476,7 +476,7 @@ <span class="k">def</span> <span class="nf">shortest_augmenting_path_impl</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">s</span><span class="p">,</span> <span class="n">t</span><span class="p">,</span> <span class="n">capacity</span><span class="p">,</span> <span class="n">residual</span><span class="p">,</span> <span class="n">two_phase</span><span class="p">,</span> <span class="n">cutoff</span><span class="p">):</span> - <span class="sd">"""Implementation of the shortest augmenting path algorithm."""</span> +<span class="w"> </span><span class="sd">"""Implementation of the shortest augmenting path algorithm."""</span> <span class="k">if</span> <span class="n">s</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">G</span><span class="p">:</span> <span class="k">raise</span> <span class="n">nx</span><span class="o">.</span><span class="n">NetworkXError</span><span class="p">(</span><span class="sa">f</span><span class="s2">"node </span><span class="si">{</span><span class="nb">str</span><span class="p">(</span><span class="n">s</span><span class="p">)</span><span class="si">}</span><span class="s2"> not in graph"</span><span class="p">)</span> <span class="k">if</span> <span class="n">t</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">G</span><span class="p">:</span> @@ -531,7 +531,7 @@ <span class="n">inf</span> <span class="o">=</span> <span class="n">R</span><span class="o">.</span><span class="n">graph</span><span class="p">[</span><span class="s2">"inf"</span><span class="p">]</span> <span class="k">def</span> <span class="nf">augment</span><span class="p">(</span><span class="n">path</span><span class="p">):</span> - <span class="sd">"""Augment flow along a path from s to t."""</span> +<span class="w"> </span><span class="sd">"""Augment flow along a path from s to t."""</span> <span class="c1"># Determine the path residual capacity.</span> <span class="n">flow</span> <span class="o">=</span> <span class="n">inf</span> <span class="n">it</span> <span class="o">=</span> <span class="nb">iter</span><span class="p">(</span><span class="n">path</span><span class="p">)</span> @@ -552,7 +552,7 @@ <span class="k">return</span> <span class="n">flow</span> <span class="k">def</span> <span class="nf">relabel</span><span class="p">(</span><span class="n">u</span><span class="p">):</span> - <span class="sd">"""Relabel a node to create an admissible edge."""</span> +<span class="w"> </span><span class="sd">"""Relabel a node to create an admissible edge."""</span> <span class="n">height</span> <span class="o">=</span> <span class="n">n</span> <span class="o">-</span> <span class="mi">1</span> <span class="k">for</span> <span class="n">v</span><span class="p">,</span> <span class="n">attr</span> <span class="ow">in</span> <span class="n">R_succ</span><span class="p">[</span><span class="n">u</span><span class="p">]</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> <span class="k">if</span> <span class="n">attr</span><span class="p">[</span><span class="s2">"flow"</span><span class="p">]</span> <span class="o"><</span> <span class="n">attr</span><span class="p">[</span><span class="s2">"capacity"</span><span class="p">]:</span> @@ -636,7 +636,7 @@ <span class="n">two_phase</span><span class="o">=</span><span class="kc">False</span><span class="p">,</span> <span class="n">cutoff</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="p">):</span> - <span class="sa">r</span><span class="sd">"""Find a maximum single-commodity flow using the shortest augmenting path</span> +<span class="w"> </span><span class="sa">r</span><span class="sd">"""Find a maximum single-commodity flow using the shortest augmenting path</span> <span class="sd"> algorithm.</span> <span class="sd"> This function returns the residual network resulting after computing</span> @@ -810,7 +810,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> |