diff options
Diffstat (limited to '_modules/networkx/algorithms/connectivity')
9 files changed, 232 insertions, 119 deletions
diff --git a/_modules/networkx/algorithms/connectivity/connectivity.html b/_modules/networkx/algorithms/connectivity/connectivity.html index 0d39d855..6a2bd211 100644 --- a/_modules/networkx/algorithms/connectivity/connectivity.html +++ b/_modules/networkx/algorithms/connectivity/connectivity.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.connectivity.connectivity — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.connectivity.connectivity — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/connectivity/connectivity';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/connectivity/connectivity.html" /> <link rel="search" type="application/opensearchdescription+xml" - title="Search within NetworkX 3.0rc2.dev0 documentation" + title="Search within NetworkX 3.1rc1.dev0 documentation" href="../../../../_static/opensearch.xml"/> <link rel="index" title="Index" href="../../../../genindex.html" /> <link rel="search" title="Search" href="../../../../search.html" /> +<script + defer + data-domain="networkx.org" + src="https://views.scientific-python.org/js/script.js" +></script> + <meta name="viewport" content="width=device-width, initial-scale=1" /> - <meta name="docsearch:language" content="en"> + <meta name="docsearch:language" content="en"> </head> @@ -93,6 +99,12 @@ <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> </form> </div> + </div><div class="bd-header-announcement container-fluid" id="header-announcement"> + + + +<div class="bd-header-announcement__content"><p><a href='https://forms.gle/NUGcBxyjx5onbAgc8'> NetworkX User Survey 2023</a> 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!</p></div> + </div> @@ -244,7 +256,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -407,7 +419,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -658,7 +670,7 @@ <span class="k">if</span> <span class="n">mapping</span> <span class="ow">is</span> <span class="kc">None</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="s2">"Invalid auxiliary digraph."</span><span class="p">)</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">flow_func</span><span class="o">=</span><span class="n">flow_func</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">residual</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span><span class="s2">"flow_func"</span><span class="p">:</span> <span class="n">flow_func</span><span class="p">,</span> <span class="s2">"residual"</span><span class="p">:</span> <span class="n">residual</span><span class="p">}</span> <span class="k">if</span> <span class="n">flow_func</span> <span class="ow">is</span> <span class="n">shortest_augmenting_path</span><span class="p">:</span> <span class="n">kwargs</span><span class="p">[</span><span class="s2">"cutoff"</span><span class="p">]</span> <span class="o">=</span> <span class="n">cutoff</span> <span class="n">kwargs</span><span class="p">[</span><span class="s2">"two_phase"</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span> @@ -793,7 +805,7 @@ <span class="c1"># Reuse the auxiliary digraph and the residual network</span> <span class="n">H</span> <span class="o">=</span> <span class="n">build_auxiliary_node_connectivity</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="n">R</span> <span class="o">=</span> <span class="n">build_residual_network</span><span class="p">(</span><span class="n">H</span><span class="p">,</span> <span class="s2">"capacity"</span><span class="p">)</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">flow_func</span><span class="o">=</span><span class="n">flow_func</span><span class="p">,</span> <span class="n">auxiliary</span><span class="o">=</span><span class="n">H</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">R</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span><span class="s2">"flow_func"</span><span class="p">:</span> <span class="n">flow_func</span><span class="p">,</span> <span class="s2">"auxiliary"</span><span class="p">:</span> <span class="n">H</span><span class="p">,</span> <span class="s2">"residual"</span><span class="p">:</span> <span class="n">R</span><span class="p">}</span> <span class="c1"># Pick a node with minimum degree</span> <span class="c1"># Node connectivity is bounded by degree.</span> @@ -868,7 +880,7 @@ <span class="c1"># Reuse the auxiliary digraph and the residual network</span> <span class="n">H</span> <span class="o">=</span> <span class="n">build_auxiliary_node_connectivity</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="n">R</span> <span class="o">=</span> <span class="n">build_residual_network</span><span class="p">(</span><span class="n">H</span><span class="p">,</span> <span class="s2">"capacity"</span><span class="p">)</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">flow_func</span><span class="o">=</span><span class="n">flow_func</span><span class="p">,</span> <span class="n">auxiliary</span><span class="o">=</span><span class="n">H</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">R</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span><span class="s2">"flow_func"</span><span class="p">:</span> <span class="n">flow_func</span><span class="p">,</span> <span class="s2">"auxiliary"</span><span class="p">:</span> <span class="n">H</span><span class="p">,</span> <span class="s2">"residual"</span><span class="p">:</span> <span class="n">R</span><span class="p">}</span> <span class="n">num</span><span class="p">,</span> <span class="n">den</span> <span class="o">=</span> <span class="mi">0</span><span class="p">,</span> <span class="mi">0</span> <span class="k">for</span> <span class="n">u</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">iter_func</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="mi">2</span><span class="p">):</span> @@ -936,7 +948,7 @@ <span class="n">H</span> <span class="o">=</span> <span class="n">build_auxiliary_node_connectivity</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="n">mapping</span> <span class="o">=</span> <span class="n">H</span><span class="o">.</span><span class="n">graph</span><span class="p">[</span><span class="s2">"mapping"</span><span class="p">]</span> <span class="n">R</span> <span class="o">=</span> <span class="n">build_residual_network</span><span class="p">(</span><span class="n">H</span><span class="p">,</span> <span class="s2">"capacity"</span><span class="p">)</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">flow_func</span><span class="o">=</span><span class="n">flow_func</span><span class="p">,</span> <span class="n">auxiliary</span><span class="o">=</span><span class="n">H</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">R</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span><span class="s2">"flow_func"</span><span class="p">:</span> <span class="n">flow_func</span><span class="p">,</span> <span class="s2">"auxiliary"</span><span class="p">:</span> <span class="n">H</span><span class="p">,</span> <span class="s2">"residual"</span><span class="p">:</span> <span class="n">R</span><span class="p">}</span> <span class="k">for</span> <span class="n">u</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">iter_func</span><span class="p">(</span><span class="n">nbunch</span><span class="p">,</span> <span class="mi">2</span><span class="p">):</span> <span class="n">K</span> <span class="o">=</span> <span class="n">local_node_connectivity</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="o">**</span><span class="n">kwargs</span><span class="p">)</span> @@ -1094,7 +1106,7 @@ <span class="k">else</span><span class="p">:</span> <span class="n">H</span> <span class="o">=</span> <span class="n">auxiliary</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">flow_func</span><span class="o">=</span><span class="n">flow_func</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">residual</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span><span class="s2">"flow_func"</span><span class="p">:</span> <span class="n">flow_func</span><span class="p">,</span> <span class="s2">"residual"</span><span class="p">:</span> <span class="n">residual</span><span class="p">}</span> <span class="k">if</span> <span class="n">flow_func</span> <span class="ow">is</span> <span class="n">shortest_augmenting_path</span><span class="p">:</span> <span class="n">kwargs</span><span class="p">[</span><span class="s2">"cutoff"</span><span class="p">]</span> <span class="o">=</span> <span class="n">cutoff</span> <span class="n">kwargs</span><span class="p">[</span><span class="s2">"two_phase"</span><span class="p">]</span> <span class="o">=</span> <span class="kc">True</span> @@ -1223,7 +1235,7 @@ <span class="c1"># reuse auxiliary digraph and residual network</span> <span class="n">H</span> <span class="o">=</span> <span class="n">build_auxiliary_edge_connectivity</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="n">R</span> <span class="o">=</span> <span class="n">build_residual_network</span><span class="p">(</span><span class="n">H</span><span class="p">,</span> <span class="s2">"capacity"</span><span class="p">)</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">flow_func</span><span class="o">=</span><span class="n">flow_func</span><span class="p">,</span> <span class="n">auxiliary</span><span class="o">=</span><span class="n">H</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">R</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span><span class="s2">"flow_func"</span><span class="p">:</span> <span class="n">flow_func</span><span class="p">,</span> <span class="s2">"auxiliary"</span><span class="p">:</span> <span class="n">H</span><span class="p">,</span> <span class="s2">"residual"</span><span class="p">:</span> <span class="n">R</span><span class="p">}</span> <span class="k">if</span> <span class="n">G</span><span class="o">.</span><span class="n">is_directed</span><span class="p">():</span> <span class="c1"># Algorithm 8 in [1]</span> @@ -1287,11 +1299,11 @@ <div class="toc-item"> -<div id="searchbox"></div> -</div> - -<div class="toc-item"> - +<form class="bd-search d-flex align-items-center" action="../../../../search.html" method="get"> + <i class="fa-solid fa-magnifying-glass"></i> + <input type="search" class="form-control" name="q" id="search-input" placeholder="Search the docs ..." aria-label="Search the docs ..." autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false"> + <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> +</form> </div> <div class="toc-item"> diff --git a/_modules/networkx/algorithms/connectivity/cuts.html b/_modules/networkx/algorithms/connectivity/cuts.html index 56616899..c1de8916 100644 --- a/_modules/networkx/algorithms/connectivity/cuts.html +++ b/_modules/networkx/algorithms/connectivity/cuts.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.connectivity.cuts — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.connectivity.cuts — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/connectivity/cuts';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/connectivity/cuts.html" /> <link rel="search" type="application/opensearchdescription+xml" - title="Search within NetworkX 3.0rc2.dev0 documentation" + title="Search within NetworkX 3.1rc1.dev0 documentation" href="../../../../_static/opensearch.xml"/> <link rel="index" title="Index" href="../../../../genindex.html" /> <link rel="search" title="Search" href="../../../../search.html" /> +<script + defer + data-domain="networkx.org" + src="https://views.scientific-python.org/js/script.js" +></script> + <meta name="viewport" content="width=device-width, initial-scale=1" /> - <meta name="docsearch:language" content="en"> + <meta name="docsearch:language" content="en"> </head> @@ -93,6 +99,12 @@ <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> </form> </div> + </div><div class="bd-header-announcement container-fluid" id="header-announcement"> + + + +<div class="bd-header-announcement__content"><p><a href='https://forms.gle/NUGcBxyjx5onbAgc8'> NetworkX User Survey 2023</a> 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!</p></div> + </div> @@ -244,7 +256,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -407,7 +419,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -603,7 +615,7 @@ <span class="k">else</span><span class="p">:</span> <span class="n">H</span> <span class="o">=</span> <span class="n">auxiliary</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">capacity</span><span class="o">=</span><span class="s2">"capacity"</span><span class="p">,</span> <span class="n">flow_func</span><span class="o">=</span><span class="n">flow_func</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">residual</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span><span class="s2">"capacity"</span><span class="p">:</span> <span class="s2">"capacity"</span><span class="p">,</span> <span class="s2">"flow_func"</span><span class="p">:</span> <span class="n">flow_func</span><span class="p">,</span> <span class="s2">"residual"</span><span class="p">:</span> <span class="n">residual</span><span class="p">}</span> <span class="n">cut_value</span><span class="p">,</span> <span class="n">partition</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">minimum_cut</span><span class="p">(</span><span class="n">H</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="o">**</span><span class="n">kwargs</span><span class="p">)</span> <span class="n">reachable</span><span class="p">,</span> <span class="n">non_reachable</span> <span class="o">=</span> <span class="n">partition</span> @@ -744,7 +756,7 @@ <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="s2">"Invalid auxiliary digraph."</span><span class="p">)</span> <span class="k">if</span> <span class="n">G</span><span class="o">.</span><span class="n">has_edge</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="ow">or</span> <span class="n">G</span><span class="o">.</span><span class="n">has_edge</span><span class="p">(</span><span class="n">t</span><span class="p">,</span> <span class="n">s</span><span class="p">):</span> <span class="k">return</span> <span class="p">{}</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">flow_func</span><span class="o">=</span><span class="n">flow_func</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">residual</span><span class="p">,</span> <span class="n">auxiliary</span><span class="o">=</span><span class="n">H</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span><span class="s2">"flow_func"</span><span class="p">:</span> <span class="n">flow_func</span><span class="p">,</span> <span class="s2">"residual"</span><span class="p">:</span> <span class="n">residual</span><span class="p">,</span> <span class="s2">"auxiliary"</span><span class="p">:</span> <span class="n">H</span><span class="p">}</span> <span class="c1"># The edge cut in the auxiliary digraph corresponds to the node cut in the</span> <span class="c1"># original graph.</span> @@ -877,7 +889,7 @@ <span class="c1"># Reuse the auxiliary digraph and the residual network.</span> <span class="n">H</span> <span class="o">=</span> <span class="n">build_auxiliary_node_connectivity</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="n">R</span> <span class="o">=</span> <span class="n">build_residual_network</span><span class="p">(</span><span class="n">H</span><span class="p">,</span> <span class="s2">"capacity"</span><span class="p">)</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">flow_func</span><span class="o">=</span><span class="n">flow_func</span><span class="p">,</span> <span class="n">auxiliary</span><span class="o">=</span><span class="n">H</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">R</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span><span class="s2">"flow_func"</span><span class="p">:</span> <span class="n">flow_func</span><span class="p">,</span> <span class="s2">"auxiliary"</span><span class="p">:</span> <span class="n">H</span><span class="p">,</span> <span class="s2">"residual"</span><span class="p">:</span> <span class="n">R</span><span class="p">}</span> <span class="c1"># Choose a node with minimum degree.</span> <span class="n">v</span> <span class="o">=</span> <span class="nb">min</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">key</span><span class="o">=</span><span class="n">G</span><span class="o">.</span><span class="n">degree</span><span class="p">)</span> @@ -1000,7 +1012,7 @@ <span class="c1"># reuse auxiliary digraph and residual network</span> <span class="n">H</span> <span class="o">=</span> <span class="n">build_auxiliary_edge_connectivity</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="n">R</span> <span class="o">=</span> <span class="n">build_residual_network</span><span class="p">(</span><span class="n">H</span><span class="p">,</span> <span class="s2">"capacity"</span><span class="p">)</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">flow_func</span><span class="o">=</span><span class="n">flow_func</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">R</span><span class="p">,</span> <span class="n">auxiliary</span><span class="o">=</span><span class="n">H</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span><span class="s2">"flow_func"</span><span class="p">:</span> <span class="n">flow_func</span><span class="p">,</span> <span class="s2">"residual"</span><span class="p">:</span> <span class="n">R</span><span class="p">,</span> <span class="s2">"auxiliary"</span><span class="p">:</span> <span class="n">H</span><span class="p">}</span> <span class="c1"># Local minimum edge cut if s and t are not None</span> <span class="k">if</span> <span class="n">s</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span> <span class="ow">and</span> <span class="n">t</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span> @@ -1074,11 +1086,11 @@ <div class="toc-item"> -<div id="searchbox"></div> -</div> - -<div class="toc-item"> - +<form class="bd-search d-flex align-items-center" action="../../../../search.html" method="get"> + <i class="fa-solid fa-magnifying-glass"></i> + <input type="search" class="form-control" name="q" id="search-input" placeholder="Search the docs ..." aria-label="Search the docs ..." autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false"> + <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> +</form> </div> <div class="toc-item"> diff --git a/_modules/networkx/algorithms/connectivity/disjoint_paths.html b/_modules/networkx/algorithms/connectivity/disjoint_paths.html index 9c0471c4..bd7a7c8a 100644 --- a/_modules/networkx/algorithms/connectivity/disjoint_paths.html +++ b/_modules/networkx/algorithms/connectivity/disjoint_paths.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.connectivity.disjoint_paths — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.connectivity.disjoint_paths — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/connectivity/disjoint_paths';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/connectivity/disjoint_paths.html" /> <link rel="search" type="application/opensearchdescription+xml" - title="Search within NetworkX 3.0rc2.dev0 documentation" + title="Search within NetworkX 3.1rc1.dev0 documentation" href="../../../../_static/opensearch.xml"/> <link rel="index" title="Index" href="../../../../genindex.html" /> <link rel="search" title="Search" href="../../../../search.html" /> +<script + defer + data-domain="networkx.org" + src="https://views.scientific-python.org/js/script.js" +></script> + <meta name="viewport" content="width=device-width, initial-scale=1" /> - <meta name="docsearch:language" content="en"> + <meta name="docsearch:language" content="en"> </head> @@ -93,6 +99,12 @@ <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> </form> </div> + </div><div class="bd-header-announcement container-fluid" id="header-announcement"> + + + +<div class="bd-header-announcement__content"><p><a href='https://forms.gle/NUGcBxyjx5onbAgc8'> NetworkX User Survey 2023</a> 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!</p></div> + </div> @@ -244,7 +256,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -407,7 +419,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -464,7 +476,7 @@ <span></span><span class="sd">"""Flow based node and edge disjoint paths."""</span> <span class="kn">import</span> <span class="nn">networkx</span> <span class="k">as</span> <span class="nn">nx</span> -<span class="c1"># Define the default maximum flow function to use for the undelying</span> +<span class="c1"># Define the default maximum flow function to use for the underlying</span> <span class="c1"># maximum flow computations</span> <span class="kn">from</span> <span class="nn">networkx.algorithms.flow</span> <span class="kn">import</span> <span class="p">(</span> <span class="n">edmonds_karp</span><span class="p">,</span> @@ -636,9 +648,12 @@ <span class="c1"># Compute maximum flow between source and target. Flow functions in</span> <span class="c1"># NetworkX return a residual network.</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span> - <span class="n">capacity</span><span class="o">=</span><span class="s2">"capacity"</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">residual</span><span class="p">,</span> <span class="n">cutoff</span><span class="o">=</span><span class="n">cutoff</span><span class="p">,</span> <span class="n">value_only</span><span class="o">=</span><span class="kc">True</span> - <span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span> + <span class="s2">"capacity"</span><span class="p">:</span> <span class="s2">"capacity"</span><span class="p">,</span> + <span class="s2">"residual"</span><span class="p">:</span> <span class="n">residual</span><span class="p">,</span> + <span class="s2">"cutoff"</span><span class="p">:</span> <span class="n">cutoff</span><span class="p">,</span> + <span class="s2">"value_only"</span><span class="p">:</span> <span class="kc">True</span><span class="p">,</span> + <span class="p">}</span> <span class="k">if</span> <span class="n">flow_func</span> <span class="ow">is</span> <span class="n">preflow_push</span><span class="p">:</span> <span class="k">del</span> <span class="n">kwargs</span><span class="p">[</span><span class="s2">"cutoff"</span><span class="p">]</span> <span class="k">if</span> <span class="n">flow_func</span> <span class="ow">is</span> <span class="n">shortest_augmenting_path</span><span class="p">:</span> @@ -832,7 +847,12 @@ <span class="k">else</span><span class="p">:</span> <span class="n">cutoff</span> <span class="o">=</span> <span class="nb">min</span><span class="p">(</span><span class="n">cutoff</span><span class="p">,</span> <span class="n">possible</span><span class="p">)</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">flow_func</span><span class="o">=</span><span class="n">flow_func</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">residual</span><span class="p">,</span> <span class="n">auxiliary</span><span class="o">=</span><span class="n">H</span><span class="p">,</span> <span class="n">cutoff</span><span class="o">=</span><span class="n">cutoff</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span> + <span class="s2">"flow_func"</span><span class="p">:</span> <span class="n">flow_func</span><span class="p">,</span> + <span class="s2">"residual"</span><span class="p">:</span> <span class="n">residual</span><span class="p">,</span> + <span class="s2">"auxiliary"</span><span class="p">:</span> <span class="n">H</span><span class="p">,</span> + <span class="s2">"cutoff"</span><span class="p">:</span> <span class="n">cutoff</span><span class="p">,</span> + <span class="p">}</span> <span class="c1"># The edge disjoint paths in the auxiliary digraph correspond to the node</span> <span class="c1"># disjoint paths in the original graph.</span> @@ -865,11 +885,11 @@ <div class="toc-item"> -<div id="searchbox"></div> -</div> - -<div class="toc-item"> - +<form class="bd-search d-flex align-items-center" action="../../../../search.html" method="get"> + <i class="fa-solid fa-magnifying-glass"></i> + <input type="search" class="form-control" name="q" id="search-input" placeholder="Search the docs ..." aria-label="Search the docs ..." autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false"> + <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> +</form> </div> <div class="toc-item"> diff --git a/_modules/networkx/algorithms/connectivity/edge_augmentation.html b/_modules/networkx/algorithms/connectivity/edge_augmentation.html index 84d8553c..20630df2 100644 --- a/_modules/networkx/algorithms/connectivity/edge_augmentation.html +++ b/_modules/networkx/algorithms/connectivity/edge_augmentation.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.connectivity.edge_augmentation — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.connectivity.edge_augmentation — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/connectivity/edge_augmentation';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/connectivity/edge_augmentation.html" /> <link rel="search" type="application/opensearchdescription+xml" - title="Search within NetworkX 3.0rc2.dev0 documentation" + title="Search within NetworkX 3.1rc1.dev0 documentation" href="../../../../_static/opensearch.xml"/> <link rel="index" title="Index" href="../../../../genindex.html" /> <link rel="search" title="Search" href="../../../../search.html" /> +<script + defer + data-domain="networkx.org" + src="https://views.scientific-python.org/js/script.js" +></script> + <meta name="viewport" content="width=device-width, initial-scale=1" /> - <meta name="docsearch:language" content="en"> + <meta name="docsearch:language" content="en"> </head> @@ -93,6 +99,12 @@ <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> </form> </div> + </div><div class="bd-header-announcement container-fluid" id="header-announcement"> + + + +<div class="bd-header-announcement__content"><p><a href='https://forms.gle/NUGcBxyjx5onbAgc8'> NetworkX User Survey 2023</a> 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!</p></div> + </div> @@ -244,7 +256,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -407,7 +419,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -725,7 +737,7 @@ <span class="n">aug_edges</span> <span class="o">=</span> <span class="n">greedy_k_edge_augmentation</span><span class="p">(</span> <span class="n">G</span><span class="p">,</span> <span class="n">k</span><span class="o">=</span><span class="n">k</span><span class="p">,</span> <span class="n">avail</span><span class="o">=</span><span class="n">avail</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="n">weight</span><span class="p">,</span> <span class="n">seed</span><span class="o">=</span><span class="mi">0</span> <span class="p">)</span> - <span class="c1"># Do eager evaulation so we can catch any exceptions</span> + <span class="c1"># Do eager evaluation so we can catch any exceptions</span> <span class="c1"># Before executing partial code.</span> <span class="k">yield from</span> <span class="nb">list</span><span class="p">(</span><span class="n">aug_edges</span><span class="p">)</span> <span class="k">except</span> <span class="n">nx</span><span class="o">.</span><span class="n">NetworkXUnfeasible</span><span class="p">:</span> @@ -831,13 +843,13 @@ <span class="p">}</span> <span class="c1"># Remove potential augmenting edges</span> <span class="n">C</span><span class="o">.</span><span class="n">remove_edges_from</span><span class="p">(</span><span class="n">sub_avail</span><span class="o">.</span><span class="n">keys</span><span class="p">())</span> - <span class="c1"># Find a subset of these edges that makes the compoment</span> + <span class="c1"># Find a subset of these edges that makes the component</span> <span class="c1"># k-edge-connected and ignore the rest</span> <span class="k">yield from</span> <span class="n">nx</span><span class="o">.</span><span class="n">k_edge_augmentation</span><span class="p">(</span><span class="n">C</span><span class="p">,</span> <span class="n">k</span><span class="o">=</span><span class="n">k</span><span class="p">,</span> <span class="n">avail</span><span class="o">=</span><span class="n">sub_avail</span><span class="p">)</span> <span class="c1"># Generate all edges between CCs that could not be k-edge-connected</span> <span class="k">for</span> <span class="n">cc1</span><span class="p">,</span> <span class="n">cc2</span> <span class="ow">in</span> <span class="n">it</span><span class="o">.</span><span class="n">combinations</span><span class="p">(</span><span class="n">k_edge_subgraphs</span><span class="p">,</span> <span class="mi">2</span><span class="p">):</span> - <span class="k">for</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="ow">in</span> <span class="n">_edges_between_disjoint</span><span class="p">(</span><span class="n">H</span><span class="p">,</span> <span class="n">cc1</span><span class="p">,</span> <span class="n">cc2</span><span class="p">):</span> + <span class="k">for</span> <span class="n">u</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">_edges_between_disjoint</span><span class="p">(</span><span class="n">H</span><span class="p">,</span> <span class="n">cc1</span><span class="p">,</span> <span class="n">cc2</span><span class="p">):</span> <span class="n">d</span> <span class="o">=</span> <span class="n">H</span><span class="o">.</span><span class="n">get_edge_data</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">edge</span> <span class="o">=</span> <span class="n">d</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="s2">"generator"</span><span class="p">,</span> <span class="kc">None</span><span class="p">)</span> <span class="k">if</span> <span class="n">edge</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span> @@ -1005,7 +1017,7 @@ <span class="sd"> -----</span> <span class="sd"> Each node in the metagraph is a k-edge-connected component in the original</span> <span class="sd"> graph. We don't care about any edge within the same k-edge-connected</span> -<span class="sd"> component, so we ignore self edges. We also are only intereseted in the</span> +<span class="sd"> component, so we ignore self edges. We also are only interested in the</span> <span class="sd"> minimum weight edge bridging each k-edge-connected component so, we group</span> <span class="sd"> the edges by meta-edge and take the lightest in each group.</span> @@ -1686,7 +1698,7 @@ <span class="c1"># Incrementally add edges in until we are k-connected</span> <span class="n">H</span> <span class="o">=</span> <span class="n">G</span><span class="o">.</span><span class="n">copy</span><span class="p">()</span> - <span class="k">for</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="ow">in</span> <span class="n">avail_uv</span><span class="p">:</span> + <span class="k">for</span> <span class="n">u</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">avail_uv</span><span class="p">:</span> <span class="n">done</span> <span class="o">=</span> <span class="kc">False</span> <span class="k">if</span> <span class="ow">not</span> <span class="n">is_locally_k_edge_connected</span><span class="p">(</span><span class="n">H</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">k</span><span class="o">=</span><span class="n">k</span><span class="p">):</span> <span class="c1"># Only add edges in parts that are not yet locally k-edge-connected</span> @@ -1704,7 +1716,7 @@ <span class="c1"># Randomized attempt to reduce the size of the solution</span> <span class="n">_compat_shuffle</span><span class="p">(</span><span class="n">seed</span><span class="p">,</span> <span class="n">aug_edges</span><span class="p">)</span> - <span class="k">for</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="ow">in</span> <span class="nb">list</span><span class="p">(</span><span class="n">aug_edges</span><span class="p">):</span> + <span class="k">for</span> <span class="n">u</span><span class="p">,</span> <span class="n">v</span> <span class="ow">in</span> <span class="nb">list</span><span class="p">(</span><span class="n">aug_edges</span><span class="p">):</span> <span class="c1"># Don't remove if we know it would break connectivity</span> <span class="k">if</span> <span class="n">H</span><span class="o">.</span><span class="n">degree</span><span class="p">(</span><span class="n">u</span><span class="p">)</span> <span class="o"><=</span> <span class="n">k</span> <span class="ow">or</span> <span class="n">H</span><span class="o">.</span><span class="n">degree</span><span class="p">(</span><span class="n">v</span><span class="p">)</span> <span class="o"><=</span> <span class="n">k</span><span class="p">:</span> <span class="k">continue</span> @@ -1731,11 +1743,11 @@ <div class="toc-item"> -<div id="searchbox"></div> -</div> - -<div class="toc-item"> - +<form class="bd-search d-flex align-items-center" action="../../../../search.html" method="get"> + <i class="fa-solid fa-magnifying-glass"></i> + <input type="search" class="form-control" name="q" id="search-input" placeholder="Search the docs ..." aria-label="Search the docs ..." autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false"> + <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> +</form> </div> <div class="toc-item"> diff --git a/_modules/networkx/algorithms/connectivity/edge_kcomponents.html b/_modules/networkx/algorithms/connectivity/edge_kcomponents.html index e8794442..28060411 100644 --- a/_modules/networkx/algorithms/connectivity/edge_kcomponents.html +++ b/_modules/networkx/algorithms/connectivity/edge_kcomponents.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.connectivity.edge_kcomponents — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.connectivity.edge_kcomponents — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/connectivity/edge_kcomponents';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/connectivity/edge_kcomponents.html" /> <link rel="search" type="application/opensearchdescription+xml" - title="Search within NetworkX 3.0rc2.dev0 documentation" + title="Search within NetworkX 3.1rc1.dev0 documentation" href="../../../../_static/opensearch.xml"/> <link rel="index" title="Index" href="../../../../genindex.html" /> <link rel="search" title="Search" href="../../../../search.html" /> +<script + defer + data-domain="networkx.org" + src="https://views.scientific-python.org/js/script.js" +></script> + <meta name="viewport" content="width=device-width, initial-scale=1" /> - <meta name="docsearch:language" content="en"> + <meta name="docsearch:language" content="en"> </head> @@ -93,6 +99,12 @@ <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> </form> </div> + </div><div class="bd-header-announcement container-fluid" id="header-announcement"> + + + +<div class="bd-header-announcement__content"><p><a href='https://forms.gle/NUGcBxyjx5onbAgc8'> NetworkX User Survey 2023</a> 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!</p></div> + </div> @@ -244,7 +256,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -407,7 +419,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -1056,11 +1068,11 @@ <div class="toc-item"> -<div id="searchbox"></div> -</div> - -<div class="toc-item"> - +<form class="bd-search d-flex align-items-center" action="../../../../search.html" method="get"> + <i class="fa-solid fa-magnifying-glass"></i> + <input type="search" class="form-control" name="q" id="search-input" placeholder="Search the docs ..." aria-label="Search the docs ..." autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false"> + <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> +</form> </div> <div class="toc-item"> diff --git a/_modules/networkx/algorithms/connectivity/kcomponents.html b/_modules/networkx/algorithms/connectivity/kcomponents.html index 193495fe..045c87f7 100644 --- a/_modules/networkx/algorithms/connectivity/kcomponents.html +++ b/_modules/networkx/algorithms/connectivity/kcomponents.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.connectivity.kcomponents — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.connectivity.kcomponents — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/connectivity/kcomponents';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/connectivity/kcomponents.html" /> <link rel="search" type="application/opensearchdescription+xml" - title="Search within NetworkX 3.0rc2.dev0 documentation" + title="Search within NetworkX 3.1rc1.dev0 documentation" href="../../../../_static/opensearch.xml"/> <link rel="index" title="Index" href="../../../../genindex.html" /> <link rel="search" title="Search" href="../../../../search.html" /> +<script + defer + data-domain="networkx.org" + src="https://views.scientific-python.org/js/script.js" +></script> + <meta name="viewport" content="width=device-width, initial-scale=1" /> - <meta name="docsearch:language" content="en"> + <meta name="docsearch:language" content="en"> </head> @@ -93,6 +99,12 @@ <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> </form> </div> + </div><div class="bd-header-announcement container-fluid" id="header-announcement"> + + + +<div class="bd-header-announcement__content"><p><a href='https://forms.gle/NUGcBxyjx5onbAgc8'> NetworkX User Survey 2023</a> 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!</p></div> + </div> @@ -244,7 +256,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -407,7 +419,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -641,10 +653,7 @@ <span class="k">def</span> <span class="nf">_generate_partition</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">cuts</span><span class="p">,</span> <span class="n">k</span><span class="p">):</span> <span class="k">def</span> <span class="nf">has_nbrs_in_partition</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">node</span><span class="p">,</span> <span class="n">partition</span><span class="p">):</span> - <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">G</span><span class="p">[</span><span class="n">node</span><span class="p">]:</span> - <span class="k">if</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">partition</span><span class="p">:</span> - <span class="k">return</span> <span class="kc">True</span> - <span class="k">return</span> <span class="kc">False</span> + <span class="k">return</span> <span class="nb">any</span><span class="p">(</span><span class="n">n</span> <span class="ow">in</span> <span class="n">partition</span> <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">G</span><span class="p">[</span><span class="n">node</span><span class="p">])</span> <span class="n">components</span> <span class="o">=</span> <span class="p">[]</span> <span class="n">nodes</span> <span class="o">=</span> <span class="p">{</span><span class="n">n</span> <span class="k">for</span> <span class="n">n</span><span class="p">,</span> <span class="n">d</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">degree</span><span class="p">()</span> <span class="k">if</span> <span class="n">d</span> <span class="o">></span> <span class="n">k</span><span class="p">}</span> <span class="o">-</span> <span class="p">{</span><span class="n">n</span> <span class="k">for</span> <span class="n">cut</span> <span class="ow">in</span> <span class="n">cuts</span> <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">cut</span><span class="p">}</span> @@ -661,7 +670,7 @@ <span class="k">def</span> <span class="nf">_reconstruct_k_components</span><span class="p">(</span><span class="n">k_comps</span><span class="p">):</span> - <span class="n">result</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span> + <span class="n">result</span> <span class="o">=</span> <span class="p">{}</span> <span class="n">max_k</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">k_comps</span><span class="p">)</span> <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="nb">reversed</span><span class="p">(</span><span class="nb">range</span><span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="n">max_k</span> <span class="o">+</span> <span class="mi">1</span><span class="p">)):</span> <span class="k">if</span> <span class="n">k</span> <span class="o">==</span> <span class="n">max_k</span><span class="p">:</span> @@ -699,11 +708,11 @@ <div class="toc-item"> -<div id="searchbox"></div> -</div> - -<div class="toc-item"> - +<form class="bd-search d-flex align-items-center" action="../../../../search.html" method="get"> + <i class="fa-solid fa-magnifying-glass"></i> + <input type="search" class="form-control" name="q" id="search-input" placeholder="Search the docs ..." aria-label="Search the docs ..." autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false"> + <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> +</form> </div> <div class="toc-item"> diff --git a/_modules/networkx/algorithms/connectivity/kcutsets.html b/_modules/networkx/algorithms/connectivity/kcutsets.html index c9190cb6..6d17298c 100644 --- a/_modules/networkx/algorithms/connectivity/kcutsets.html +++ b/_modules/networkx/algorithms/connectivity/kcutsets.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.connectivity.kcutsets — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.connectivity.kcutsets — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/connectivity/kcutsets';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/connectivity/kcutsets.html" /> <link rel="search" type="application/opensearchdescription+xml" - title="Search within NetworkX 3.0rc2.dev0 documentation" + title="Search within NetworkX 3.1rc1.dev0 documentation" href="../../../../_static/opensearch.xml"/> <link rel="index" title="Index" href="../../../../genindex.html" /> <link rel="search" title="Search" href="../../../../search.html" /> +<script + defer + data-domain="networkx.org" + src="https://views.scientific-python.org/js/script.js" +></script> + <meta name="viewport" content="width=device-width, initial-scale=1" /> - <meta name="docsearch:language" content="en"> + <meta name="docsearch:language" content="en"> </head> @@ -93,6 +99,12 @@ <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> </form> </div> + </div><div class="bd-header-announcement container-fluid" id="header-announcement"> + + + +<div class="bd-header-announcement__content"><p><a href='https://forms.gle/NUGcBxyjx5onbAgc8'> NetworkX User Survey 2023</a> 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!</p></div> + </div> @@ -244,7 +256,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -407,7 +419,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -571,7 +583,7 @@ <span class="c1"># Shallow copy is enough.</span> <span class="n">original_H_pred</span> <span class="o">=</span> <span class="n">copy</span><span class="o">.</span><span class="n">copy</span><span class="p">(</span><span class="n">H</span><span class="o">.</span><span class="n">_pred</span><span class="p">)</span> <span class="n">R</span> <span class="o">=</span> <span class="n">build_residual_network</span><span class="p">(</span><span class="n">H</span><span class="p">,</span> <span class="s2">"capacity"</span><span class="p">)</span> - <span class="n">kwargs</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">capacity</span><span class="o">=</span><span class="s2">"capacity"</span><span class="p">,</span> <span class="n">residual</span><span class="o">=</span><span class="n">R</span><span class="p">)</span> + <span class="n">kwargs</span> <span class="o">=</span> <span class="p">{</span><span class="s2">"capacity"</span><span class="p">:</span> <span class="s2">"capacity"</span><span class="p">,</span> <span class="s2">"residual"</span><span class="p">:</span> <span class="n">R</span><span class="p">}</span> <span class="c1"># Define default flow function</span> <span class="k">if</span> <span class="n">flow_func</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span> <span class="n">flow_func</span> <span class="o">=</span> <span class="n">default_flow_func</span> @@ -707,11 +719,11 @@ <div class="toc-item"> -<div id="searchbox"></div> -</div> - -<div class="toc-item"> - +<form class="bd-search d-flex align-items-center" action="../../../../search.html" method="get"> + <i class="fa-solid fa-magnifying-glass"></i> + <input type="search" class="form-control" name="q" id="search-input" placeholder="Search the docs ..." aria-label="Search the docs ..." autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false"> + <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> +</form> </div> <div class="toc-item"> diff --git a/_modules/networkx/algorithms/connectivity/stoerwagner.html b/_modules/networkx/algorithms/connectivity/stoerwagner.html index f46c1ec0..dc71fff0 100644 --- a/_modules/networkx/algorithms/connectivity/stoerwagner.html +++ b/_modules/networkx/algorithms/connectivity/stoerwagner.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.connectivity.stoerwagner — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.connectivity.stoerwagner — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/connectivity/stoerwagner';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/connectivity/stoerwagner.html" /> <link rel="search" type="application/opensearchdescription+xml" - title="Search within NetworkX 3.0rc2.dev0 documentation" + title="Search within NetworkX 3.1rc1.dev0 documentation" href="../../../../_static/opensearch.xml"/> <link rel="index" title="Index" href="../../../../genindex.html" /> <link rel="search" title="Search" href="../../../../search.html" /> +<script + defer + data-domain="networkx.org" + src="https://views.scientific-python.org/js/script.js" +></script> + <meta name="viewport" content="width=device-width, initial-scale=1" /> - <meta name="docsearch:language" content="en"> + <meta name="docsearch:language" content="en"> </head> @@ -93,6 +99,12 @@ <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> </form> </div> + </div><div class="bd-header-announcement container-fluid" id="header-announcement"> + + + +<div class="bd-header-announcement__content"><p><a href='https://forms.gle/NUGcBxyjx5onbAgc8'> NetworkX User Survey 2023</a> 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!</p></div> + </div> @@ -244,7 +256,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -407,7 +419,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -624,11 +636,11 @@ <div class="toc-item"> -<div id="searchbox"></div> -</div> - -<div class="toc-item"> - +<form class="bd-search d-flex align-items-center" action="../../../../search.html" method="get"> + <i class="fa-solid fa-magnifying-glass"></i> + <input type="search" class="form-control" name="q" id="search-input" placeholder="Search the docs ..." aria-label="Search the docs ..." autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false"> + <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> +</form> </div> <div class="toc-item"> diff --git a/_modules/networkx/algorithms/connectivity/utils.html b/_modules/networkx/algorithms/connectivity/utils.html index a1a59b07..80647d80 100644 --- a/_modules/networkx/algorithms/connectivity/utils.html +++ b/_modules/networkx/algorithms/connectivity/utils.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.connectivity.utils — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.connectivity.utils — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/connectivity/utils';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/connectivity/utils.html" /> <link rel="search" type="application/opensearchdescription+xml" - title="Search within NetworkX 3.0rc2.dev0 documentation" + title="Search within NetworkX 3.1rc1.dev0 documentation" href="../../../../_static/opensearch.xml"/> <link rel="index" title="Index" href="../../../../genindex.html" /> <link rel="search" title="Search" href="../../../../search.html" /> +<script + defer + data-domain="networkx.org" + src="https://views.scientific-python.org/js/script.js" +></script> + <meta name="viewport" content="width=device-width, initial-scale=1" /> - <meta name="docsearch:language" content="en"> + <meta name="docsearch:language" content="en"> </head> @@ -93,6 +99,12 @@ <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> </form> </div> + </div><div class="bd-header-announcement container-fluid" id="header-announcement"> + + + +<div class="bd-header-announcement__content"><p><a href='https://forms.gle/NUGcBxyjx5onbAgc8'> NetworkX User Survey 2023</a> 🎉 Fill out the survey to tell us about your ideas, complaints, praises of NetworkX!</p></div> + </div> @@ -244,7 +256,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -407,7 +419,7 @@ id="dLabelMore" data-toggle="dropdown" > - v3.0rc2.dev0 + v3.1rc1.dev0 <span class="caret"></span> </button> <ul class="dropdown-menu" aria-labelledby="dLabelMore"> @@ -510,7 +522,7 @@ <span class="n">H</span><span class="o">.</span><span class="n">add_edge</span><span class="p">(</span><span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">i</span><span class="si">}</span><span class="s2">A"</span><span class="p">,</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">i</span><span class="si">}</span><span class="s2">B"</span><span class="p">,</span> <span class="n">capacity</span><span class="o">=</span><span class="mi">1</span><span class="p">)</span> <span class="n">edges</span> <span class="o">=</span> <span class="p">[]</span> - <span class="k">for</span> <span class="p">(</span><span class="n">source</span><span class="p">,</span> <span class="n">target</span><span class="p">)</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">():</span> + <span class="k">for</span> <span class="n">source</span><span class="p">,</span> <span class="n">target</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">():</span> <span class="n">edges</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">mapping</span><span class="p">[</span><span class="n">source</span><span class="p">]</span><span class="si">}</span><span class="s2">B"</span><span class="p">,</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">mapping</span><span class="p">[</span><span class="n">target</span><span class="p">]</span><span class="si">}</span><span class="s2">A"</span><span class="p">))</span> <span class="k">if</span> <span class="ow">not</span> <span class="n">directed</span><span class="p">:</span> <span class="n">edges</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">mapping</span><span class="p">[</span><span class="n">target</span><span class="p">]</span><span class="si">}</span><span class="s2">B"</span><span class="p">,</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">mapping</span><span class="p">[</span><span class="n">source</span><span class="p">]</span><span class="si">}</span><span class="s2">A"</span><span class="p">))</span> @@ -543,7 +555,7 @@ <span class="k">else</span><span class="p">:</span> <span class="n">H</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">DiGraph</span><span class="p">()</span> <span class="n">H</span><span class="o">.</span><span class="n">add_nodes_from</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">nodes</span><span class="p">())</span> - <span class="k">for</span> <span class="p">(</span><span class="n">source</span><span class="p">,</span> <span class="n">target</span><span class="p">)</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">():</span> + <span class="k">for</span> <span class="n">source</span><span class="p">,</span> <span class="n">target</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">():</span> <span class="n">H</span><span class="o">.</span><span class="n">add_edges_from</span><span class="p">([(</span><span class="n">source</span><span class="p">,</span> <span class="n">target</span><span class="p">),</span> <span class="p">(</span><span class="n">target</span><span class="p">,</span> <span class="n">source</span><span class="p">)],</span> <span class="n">capacity</span><span class="o">=</span><span class="mi">1</span><span class="p">)</span> <span class="k">return</span> <span class="n">H</span></div> </pre></div> @@ -560,11 +572,11 @@ <div class="toc-item"> -<div id="searchbox"></div> -</div> - -<div class="toc-item"> - +<form class="bd-search d-flex align-items-center" action="../../../../search.html" method="get"> + <i class="fa-solid fa-magnifying-glass"></i> + <input type="search" class="form-control" name="q" id="search-input" placeholder="Search the docs ..." aria-label="Search the docs ..." autocomplete="off" autocorrect="off" autocapitalize="off" spellcheck="false"> + <span class="search-button__kbd-shortcut"><kbd class="kbd-shortcut__modifier">Ctrl</kbd>+<kbd>K</kbd></span> +</form> </div> <div class="toc-item"> |