diff options
| author | MridulS <mail@mriduls.com> | 2023-02-23 15:31:06 +0000 |
|---|---|---|
| committer | MridulS <mail@mriduls.com> | 2023-02-23 15:31:06 +0000 |
| commit | 9e48ac05060c8f42de0e92d4e7e5b157b1c38978 (patch) | |
| tree | b4f03a4dd4b6454e7a31e6692d1b35dffcc806f4 /_modules/networkx/algorithms | |
| parent | 5aa1fdf768771b57f057c25a320c034cb59644ca (diff) | |
| download | networkx-9e48ac05060c8f42de0e92d4e7e5b157b1c38978.tar.gz | |
Deploying to gh-pages from @ networkx/networkx@0b0a5fc5c512c2cbacd374860e47742e48a8dcfe 🚀
Diffstat (limited to '_modules/networkx/algorithms')
169 files changed, 5495 insertions, 1942 deletions
diff --git a/_modules/networkx/algorithms/approximation/clique.html b/_modules/networkx/algorithms/approximation/clique.html index 2ecec5e1..0d75d5eb 100644 --- a/_modules/networkx/algorithms/approximation/clique.html +++ b/_modules/networkx/algorithms/approximation/clique.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.approximation.clique — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.clique — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/clique';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/clique.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"> @@ -708,11 +720,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/approximation/clustering_coefficient.html b/_modules/networkx/algorithms/approximation/clustering_coefficient.html index c494aa3f..b8e40dc8 100644 --- a/_modules/networkx/algorithms/approximation/clustering_coefficient.html +++ b/_modules/networkx/algorithms/approximation/clustering_coefficient.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.approximation.clustering_coefficient — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.clustering_coefficient — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/clustering_coefficient';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/clustering_coefficient.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"> @@ -539,11 +551,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/approximation/connectivity.html b/_modules/networkx/algorithms/approximation/connectivity.html index 218de1e1..f9f577a8 100644 --- a/_modules/networkx/algorithms/approximation/connectivity.html +++ b/_modules/networkx/algorithms/approximation/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.approximation.connectivity — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.connectivity — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/connectivity';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/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"> @@ -850,7 +862,7 @@ <span class="c1"># thus source and target will only trigger "found path" when they are</span> <span class="c1"># adjacent and then they can be safely included in the container 'exclude'</span> <span class="n">level</span> <span class="o">+=</span> <span class="mi">1</span> - <span class="k">if</span> <span class="ow">not</span> <span class="n">level</span> <span class="o">%</span> <span class="mi">2</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span> + <span class="k">if</span> <span class="n">level</span> <span class="o">%</span> <span class="mi">2</span> <span class="o">!=</span> <span class="mi">0</span><span class="p">:</span> <span class="n">this_level</span> <span class="o">=</span> <span class="n">forward_fringe</span> <span class="n">forward_fringe</span> <span class="o">=</span> <span class="p">[]</span> <span class="k">for</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">this_level</span><span class="p">:</span> @@ -890,11 +902,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/approximation/distance_measures.html b/_modules/networkx/algorithms/approximation/distance_measures.html index 550b00be..ec365a83 100644 --- a/_modules/networkx/algorithms/approximation/distance_measures.html +++ b/_modules/networkx/algorithms/approximation/distance_measures.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.approximation.distance_measures — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.distance_measures — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/distance_measures';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/distance_measures.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"> @@ -615,11 +627,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/approximation/dominating_set.html b/_modules/networkx/algorithms/approximation/dominating_set.html index 2a533abd..559058c3 100644 --- a/_modules/networkx/algorithms/approximation/dominating_set.html +++ b/_modules/networkx/algorithms/approximation/dominating_set.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.approximation.dominating_set — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.dominating_set — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/dominating_set';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/dominating_set.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"> @@ -598,11 +610,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/approximation/kcomponents.html b/_modules/networkx/algorithms/approximation/kcomponents.html index 045c2762..99533b70 100644 --- a/_modules/networkx/algorithms/approximation/kcomponents.html +++ b/_modules/networkx/algorithms/approximation/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.approximation.kcomponents — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.kcomponents — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/kcomponents';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/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"> @@ -675,7 +687,7 @@ <span class="k">def</span> <span class="nf">single_edge_dict</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span> <span class="k">return</span> <span class="bp">self</span><span class="o">.</span><span class="n">all_edge_dict</span> - <span class="n">edge_attr_dict_factory</span> <span class="o">=</span> <span class="n">single_edge_dict</span> <span class="c1"># type: ignore</span> + <span class="n">edge_attr_dict_factory</span> <span class="o">=</span> <span class="n">single_edge_dict</span> <span class="c1"># type: ignore[assignment]</span> <span class="k">def</span> <span class="fm">__getitem__</span><span class="p">(</span><span class="bp">self</span><span class="p">,</span> <span class="n">n</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Returns a dict of neighbors of node n in the dense graph.</span> @@ -843,11 +855,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/approximation/matching.html b/_modules/networkx/algorithms/approximation/matching.html index 48d5f4de..233e664d 100644 --- a/_modules/networkx/algorithms/approximation/matching.html +++ b/_modules/networkx/algorithms/approximation/matching.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.approximation.matching — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.matching — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/matching';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/matching.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"> @@ -517,11 +529,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/approximation/maxcut.html b/_modules/networkx/algorithms/approximation/maxcut.html index e7d40048..e45ad90d 100644 --- a/_modules/networkx/algorithms/approximation/maxcut.html +++ b/_modules/networkx/algorithms/approximation/maxcut.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.approximation.maxcut — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.maxcut — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/maxcut';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/maxcut.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"> @@ -586,11 +598,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/approximation/ramsey.html b/_modules/networkx/algorithms/approximation/ramsey.html index bd83ea28..565af84d 100644 --- a/_modules/networkx/algorithms/approximation/ramsey.html +++ b/_modules/networkx/algorithms/approximation/ramsey.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.approximation.ramsey — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.ramsey — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/ramsey';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/ramsey.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"> @@ -526,11 +538,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/approximation/steinertree.html b/_modules/networkx/algorithms/approximation/steinertree.html index cb5de8d6..65a75015 100644 --- a/_modules/networkx/algorithms/approximation/steinertree.html +++ b/_modules/networkx/algorithms/approximation/steinertree.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.approximation.steinertree — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.steinertree — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/steinertree';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/steinertree.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"> @@ -597,21 +609,21 @@ <span class="sd"> The approximation algorithm is specified with the `method` keyword</span> <span class="sd"> argument. All three available algorithms produce a tree whose weight is</span> -<span class="sd"> within a (2 - (2 / l)) factor of the weight of the optimal Steiner tree,</span> -<span class="sd"> where *l* is the minimum number of leaf nodes across all possible Steiner</span> +<span class="sd"> within a ``(2 - (2 / l))`` factor of the weight of the optimal Steiner tree,</span> +<span class="sd"> where ``l`` is the minimum number of leaf nodes across all possible Steiner</span> <span class="sd"> trees.</span> -<span class="sd"> * `kou` [2]_ (runtime $O(|S| |V|^2)$) computes the minimum spanning tree of</span> -<span class="sd"> the subgraph of the metric closure of *G* induced by the terminal nodes,</span> -<span class="sd"> where the metric closure of *G* is the complete graph in which each edge is</span> -<span class="sd"> weighted by the shortest path distance between the nodes in *G*.</span> +<span class="sd"> * ``"kou"`` [2]_ (runtime $O(|S| |V|^2)$) computes the minimum spanning tree of</span> +<span class="sd"> the subgraph of the metric closure of *G* induced by the terminal nodes,</span> +<span class="sd"> where the metric closure of *G* is the complete graph in which each edge is</span> +<span class="sd"> weighted by the shortest path distance between the nodes in *G*.</span> -<span class="sd"> * `mehlhorn` [3]_ (runtime $O(|E|+|V|\log|V|)$) modifies Kou et al.'s</span> -<span class="sd"> algorithm, beginning by finding the closest terminal node for each</span> -<span class="sd"> non-terminal. This data is used to create a complete graph containing only</span> -<span class="sd"> the terminal nodes, in which edge is weighted with the shortest path</span> -<span class="sd"> distance between them. The algorithm then proceeds in the same way as Kou</span> -<span class="sd"> et al..</span> +<span class="sd"> * ``"mehlhorn"`` [3]_ (runtime $O(|E|+|V|\log|V|)$) modifies Kou et al.'s</span> +<span class="sd"> algorithm, beginning by finding the closest terminal node for each</span> +<span class="sd"> non-terminal. This data is used to create a complete graph containing only</span> +<span class="sd"> the terminal nodes, in which edge is weighted with the shortest path</span> +<span class="sd"> distance between them. The algorithm then proceeds in the same way as Kou</span> +<span class="sd"> et al..</span> <span class="sd"> Parameters</span> <span class="sd"> ----------</span> @@ -693,11 +705,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/approximation/traveling_salesman.html b/_modules/networkx/algorithms/approximation/traveling_salesman.html index e3c284cf..26b8592c 100644 --- a/_modules/networkx/algorithms/approximation/traveling_salesman.html +++ b/_modules/networkx/algorithms/approximation/traveling_salesman.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.approximation.traveling_salesman — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.traveling_salesman — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/traveling_salesman';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/traveling_salesman.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"> @@ -993,7 +1005,7 @@ <span class="sd"> pp.1138-1162</span> <span class="sd"> """</span> <span class="kn">import</span> <span class="nn">numpy</span> <span class="k">as</span> <span class="nn">np</span> - <span class="kn">import</span> <span class="nn">scipy.optimize</span> <span class="k">as</span> <span class="nn">optimize</span> + <span class="kn">from</span> <span class="nn">scipy</span> <span class="kn">import</span> <span class="n">optimize</span> <span class="k">def</span> <span class="nf">k_pi</span><span class="p">():</span> <span class="w"> </span><span class="sd">"""</span> @@ -1248,7 +1260,7 @@ <span class="c1"># reference [1]</span> <span class="n">z_star</span> <span class="o">=</span> <span class="p">{}</span> <span class="n">scale_factor</span> <span class="o">=</span> <span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">order</span><span class="p">()</span> <span class="o">-</span> <span class="mi">1</span><span class="p">)</span> <span class="o">/</span> <span class="n">G</span><span class="o">.</span><span class="n">order</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">x_star</span><span class="o">.</span><span class="n">keys</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">x_star</span><span class="p">:</span> <span class="n">frequency</span> <span class="o">=</span> <span class="n">x_star</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">x_star</span><span class="p">[(</span><span class="n">v</span><span class="p">,</span> <span class="n">u</span><span class="p">)]</span> <span class="k">if</span> <span class="n">frequency</span> <span class="o">></span> <span class="mi">0</span><span class="p">:</span> <span class="n">z_star</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">scale_factor</span> <span class="o">*</span> <span class="n">frequency</span> @@ -1909,11 +1921,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/approximation/treewidth.html b/_modules/networkx/algorithms/approximation/treewidth.html index 025036ae..749e83d2 100644 --- a/_modules/networkx/algorithms/approximation/treewidth.html +++ b/_modules/networkx/algorithms/approximation/treewidth.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.approximation.treewidth — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.treewidth — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/treewidth';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/treewidth.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"> @@ -724,11 +736,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/approximation/vertex_cover.html b/_modules/networkx/algorithms/approximation/vertex_cover.html index fb5b7d8f..9ce18ca6 100644 --- a/_modules/networkx/algorithms/approximation/vertex_cover.html +++ b/_modules/networkx/algorithms/approximation/vertex_cover.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.approximation.vertex_cover — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.approximation.vertex_cover — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/approximation/vertex_cover';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/approximation/vertex_cover.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"> @@ -555,11 +567,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/assortativity/connectivity.html b/_modules/networkx/algorithms/assortativity/connectivity.html index a9bab070..16559b55 100644 --- a/_modules/networkx/algorithms/assortativity/connectivity.html +++ b/_modules/networkx/algorithms/assortativity/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.assortativity.connectivity — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.assortativity.connectivity — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/assortativity/connectivity';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/assortativity/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"> @@ -596,11 +608,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/assortativity/correlation.html b/_modules/networkx/algorithms/assortativity/correlation.html index b0b215ac..c3994737 100644 --- a/_modules/networkx/algorithms/assortativity/correlation.html +++ b/_modules/networkx/algorithms/assortativity/correlation.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.assortativity.correlation — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.assortativity.correlation — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/assortativity/correlation';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/assortativity/correlation.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"> @@ -773,11 +785,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/assortativity/mixing.html b/_modules/networkx/algorithms/assortativity/mixing.html index 181cf0f3..24a9c7fd 100644 --- a/_modules/networkx/algorithms/assortativity/mixing.html +++ b/_modules/networkx/algorithms/assortativity/mixing.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.assortativity.mixing — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.assortativity.mixing — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/assortativity/mixing';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/assortativity/mixing.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"> @@ -720,11 +732,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/assortativity/neighbor_degree.html b/_modules/networkx/algorithms/assortativity/neighbor_degree.html index 08f5bafa..80c6c21f 100644 --- a/_modules/networkx/algorithms/assortativity/neighbor_degree.html +++ b/_modules/networkx/algorithms/assortativity/neighbor_degree.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.assortativity.neighbor_degree — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.assortativity.neighbor_degree — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/assortativity/neighbor_degree';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/assortativity/neighbor_degree.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"> @@ -634,11 +646,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/assortativity/pairs.html b/_modules/networkx/algorithms/assortativity/pairs.html index 7690d519..852a8fd9 100644 --- a/_modules/networkx/algorithms/assortativity/pairs.html +++ b/_modules/networkx/algorithms/assortativity/pairs.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.assortativity.pairs — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.assortativity.pairs — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/assortativity/pairs';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/assortativity/pairs.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"> @@ -589,11 +601,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/asteroidal.html b/_modules/networkx/algorithms/asteroidal.html index 4bbc0066..3eff4d42 100644 --- a/_modules/networkx/algorithms/asteroidal.html +++ b/_modules/networkx/algorithms/asteroidal.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.asteroidal — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.asteroidal — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/asteroidal';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/asteroidal.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"> @@ -642,11 +654,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/bipartite/basic.html b/_modules/networkx/algorithms/bipartite/basic.html index fa01367b..f4f0f6e9 100644 --- a/_modules/networkx/algorithms/bipartite/basic.html +++ b/_modules/networkx/algorithms/bipartite/basic.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bipartite.basic — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bipartite.basic — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bipartite/basic';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bipartite/basic.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"> @@ -791,11 +803,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/bipartite/centrality.html b/_modules/networkx/algorithms/bipartite/centrality.html index dc8ca164..0391b0cf 100644 --- a/_modules/networkx/algorithms/bipartite/centrality.html +++ b/_modules/networkx/algorithms/bipartite/centrality.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bipartite.centrality — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bipartite.centrality — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bipartite/centrality';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bipartite/centrality.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"> @@ -741,11 +753,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/bipartite/cluster.html b/_modules/networkx/algorithms/bipartite/cluster.html index 8c9687f5..c16e2aa8 100644 --- a/_modules/networkx/algorithms/bipartite/cluster.html +++ b/_modules/networkx/algorithms/bipartite/cluster.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bipartite.cluster — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bipartite.cluster — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bipartite/cluster';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bipartite/cluster.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"> @@ -752,11 +764,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/bipartite/covering.html b/_modules/networkx/algorithms/bipartite/covering.html index 5c11d584..88aa9f29 100644 --- a/_modules/networkx/algorithms/bipartite/covering.html +++ b/_modules/networkx/algorithms/bipartite/covering.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bipartite.covering — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bipartite.covering — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bipartite/covering';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bipartite/covering.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"> @@ -530,11 +542,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/bipartite/edgelist.html b/_modules/networkx/algorithms/bipartite/edgelist.html index 012ee0a2..09eea953 100644 --- a/_modules/networkx/algorithms/bipartite/edgelist.html +++ b/_modules/networkx/algorithms/bipartite/edgelist.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bipartite.edgelist — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bipartite.edgelist — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bipartite/edgelist';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bipartite/edgelist.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"> @@ -832,11 +844,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/bipartite/generators.html b/_modules/networkx/algorithms/bipartite/generators.html index b3cdb41c..9871bfd8 100644 --- a/_modules/networkx/algorithms/bipartite/generators.html +++ b/_modules/networkx/algorithms/bipartite/generators.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bipartite.generators — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bipartite.generators — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bipartite/generators';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bipartite/generators.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"> @@ -1070,11 +1082,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/bipartite/matching.html b/_modules/networkx/algorithms/bipartite/matching.html index f3e29806..1f83a2ef 100644 --- a/_modules/networkx/algorithms/bipartite/matching.html +++ b/_modules/networkx/algorithms/bipartite/matching.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bipartite.matching — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bipartite.matching — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bipartite/matching';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bipartite/matching.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"> @@ -578,6 +590,7 @@ <span class="sd"> 2.4 (1973), pp. 225--231. <https://doi.org/10.1137/0202019>.</span> <span class="sd"> """</span> + <span class="c1"># First we define some auxiliary search functions.</span> <span class="c1">#</span> <span class="c1"># If you are a human reading these auxiliary search functions, the "global"</span> @@ -732,12 +745,17 @@ <span class="c1"># did we finish layering without finding any alternating paths?</span> <span class="k">if</span> <span class="ow">not</span> <span class="n">unmatched</span><span class="p">:</span> - <span class="n">unlayered</span> <span class="o">=</span> <span class="p">{}</span> - <span class="k">for</span> <span class="n">u</span> <span class="ow">in</span> <span class="n">G</span><span class="p">:</span> - <span class="c1"># TODO Why is extra inner loop necessary?</span> - <span class="k">for</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">G</span><span class="p">[</span><span class="n">u</span><span class="p">]:</span> - <span class="k">if</span> <span class="n">v</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">preds</span><span class="p">:</span> - <span class="n">unlayered</span><span class="p">[</span><span class="n">v</span><span class="p">]</span> <span class="o">=</span> <span class="kc">None</span> + <span class="c1"># TODO - The lines between --- were unused and were thus commented</span> + <span class="c1"># out. This whole commented chunk should be reviewed to determine</span> + <span class="c1"># whether it should be built upon or completely removed.</span> + <span class="c1"># ---</span> + <span class="c1"># unlayered = {}</span> + <span class="c1"># for u in G:</span> + <span class="c1"># # TODO Why is extra inner loop necessary?</span> + <span class="c1"># for v in G[u]:</span> + <span class="c1"># if v not in preds:</span> + <span class="c1"># unlayered[v] = None</span> + <span class="c1"># ---</span> <span class="c1"># TODO Originally, this function returned a three-tuple:</span> <span class="c1">#</span> <span class="c1"># return (matching, list(pred), list(unlayered))</span> @@ -1054,11 +1072,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/bipartite/matrix.html b/_modules/networkx/algorithms/bipartite/matrix.html index 0c132da5..ab9d4aed 100644 --- a/_modules/networkx/algorithms/bipartite/matrix.html +++ b/_modules/networkx/algorithms/bipartite/matrix.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bipartite.matrix — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bipartite.matrix — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bipartite/matrix';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bipartite/matrix.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,11 +653,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/bipartite/projection.html b/_modules/networkx/algorithms/bipartite/projection.html index 657548a1..86eb3298 100644 --- a/_modules/networkx/algorithms/bipartite/projection.html +++ b/_modules/networkx/algorithms/bipartite/projection.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bipartite.projection — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bipartite.projection — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bipartite/projection';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bipartite/projection.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"> @@ -998,11 +1010,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/bipartite/redundancy.html b/_modules/networkx/algorithms/bipartite/redundancy.html index 325e602a..4f8a629e 100644 --- a/_modules/networkx/algorithms/bipartite/redundancy.html +++ b/_modules/networkx/algorithms/bipartite/redundancy.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bipartite.redundancy — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bipartite.redundancy — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bipartite/redundancy';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bipartite/redundancy.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"> @@ -584,11 +596,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/bipartite/spectral.html b/_modules/networkx/algorithms/bipartite/spectral.html index d3693f38..4781efbc 100644 --- a/_modules/networkx/algorithms/bipartite/spectral.html +++ b/_modules/networkx/algorithms/bipartite/spectral.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bipartite.spectral — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bipartite.spectral — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bipartite/spectral';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bipartite/spectral.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"> @@ -543,11 +555,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/boundary.html b/_modules/networkx/algorithms/boundary.html index 20e3d891..ce87245d 100644 --- a/_modules/networkx/algorithms/boundary.html +++ b/_modules/networkx/algorithms/boundary.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.boundary — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.boundary — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/boundary';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/boundary.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"> @@ -614,11 +626,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/bridges.html b/_modules/networkx/algorithms/bridges.html index 9daee3f1..a4f79dcc 100644 --- a/_modules/networkx/algorithms/bridges.html +++ b/_modules/networkx/algorithms/bridges.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.bridges — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.bridges — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/bridges';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/bridges.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"> @@ -677,11 +689,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/centrality/betweenness.html b/_modules/networkx/algorithms/centrality/betweenness.html index a9474c72..42b3e605 100644 --- a/_modules/networkx/algorithms/centrality/betweenness.html +++ b/_modules/networkx/algorithms/centrality/betweenness.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.betweenness — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.betweenness — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/betweenness';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/betweenness.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"> @@ -687,7 +699,7 @@ <span class="k">if</span> <span class="n">k</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span> <span class="n">nodes</span> <span class="o">=</span> <span class="n">G</span> <span class="k">else</span><span class="p">:</span> - <span class="n">nodes</span> <span class="o">=</span> <span class="n">seed</span><span class="o">.</span><span class="n">sample</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="n">k</span><span class="p">)</span> + <span class="n">nodes</span> <span class="o">=</span> <span class="n">seed</span><span class="o">.</span><span class="n">sample</span><span class="p">(</span><span class="nb">list</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="n">k</span><span class="p">)</span> <span class="k">for</span> <span class="n">s</span> <span class="ow">in</span> <span class="n">nodes</span><span class="p">:</span> <span class="c1"># single source shortest paths</span> <span class="k">if</span> <span class="n">weight</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span> <span class="c1"># use BFS</span> @@ -905,11 +917,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/centrality/betweenness_subset.html b/_modules/networkx/algorithms/centrality/betweenness_subset.html index 60b79a6d..3673631d 100644 --- a/_modules/networkx/algorithms/centrality/betweenness_subset.html +++ b/_modules/networkx/algorithms/centrality/betweenness_subset.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.betweenness_subset — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.betweenness_subset — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/betweenness_subset';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/betweenness_subset.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"> @@ -744,11 +756,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/centrality/closeness.html b/_modules/networkx/algorithms/centrality/closeness.html index 6dec3eaa..1cdaaa9c 100644 --- a/_modules/networkx/algorithms/centrality/closeness.html +++ b/_modules/networkx/algorithms/centrality/closeness.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.closeness — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.closeness — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/closeness';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/closeness.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"> @@ -754,11 +766,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/centrality/current_flow_betweenness.html b/_modules/networkx/algorithms/centrality/current_flow_betweenness.html index 03b9bad5..0b9054c3 100644 --- a/_modules/networkx/algorithms/centrality/current_flow_betweenness.html +++ b/_modules/networkx/algorithms/centrality/current_flow_betweenness.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.current_flow_betweenness — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.current_flow_betweenness — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/current_flow_betweenness';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/current_flow_betweenness.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"> @@ -815,11 +827,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/centrality/current_flow_betweenness_subset.html b/_modules/networkx/algorithms/centrality/current_flow_betweenness_subset.html index 61eb3e7a..5be44d5b 100644 --- a/_modules/networkx/algorithms/centrality/current_flow_betweenness_subset.html +++ b/_modules/networkx/algorithms/centrality/current_flow_betweenness_subset.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.current_flow_betweenness_subset — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.current_flow_betweenness_subset — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/current_flow_betweenness_subset';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/current_flow_betweenness_subset.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"> @@ -699,11 +711,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/centrality/current_flow_closeness.html b/_modules/networkx/algorithms/centrality/current_flow_closeness.html index abcee6a3..9587cff0 100644 --- a/_modules/networkx/algorithms/centrality/current_flow_closeness.html +++ b/_modules/networkx/algorithms/centrality/current_flow_closeness.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.current_flow_closeness — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.current_flow_closeness — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/current_flow_closeness';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/current_flow_closeness.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,11 +583,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/centrality/degree_alg.html b/_modules/networkx/algorithms/centrality/degree_alg.html index b6b2850a..87d237d8 100644 --- a/_modules/networkx/algorithms/centrality/degree_alg.html +++ b/_modules/networkx/algorithms/centrality/degree_alg.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.degree_alg — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.degree_alg — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/degree_alg';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/degree_alg.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/centrality/dispersion.html b/_modules/networkx/algorithms/centrality/dispersion.html index 9149c300..515eec23 100644 --- a/_modules/networkx/algorithms/centrality/dispersion.html +++ b/_modules/networkx/algorithms/centrality/dispersion.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.dispersion — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.dispersion — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/dispersion';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/dispersion.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"> @@ -522,7 +534,7 @@ <span class="c1"># all possible ties of connections that u and b share</span> <span class="n">possib</span> <span class="o">=</span> <span class="n">combinations</span><span class="p">(</span><span class="n">ST</span><span class="p">,</span> <span class="mi">2</span><span class="p">)</span> <span class="n">total</span> <span class="o">=</span> <span class="mi">0</span> - <span class="k">for</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">in</span> <span class="n">possib</span><span class="p">:</span> + <span class="k">for</span> <span class="n">s</span><span class="p">,</span> <span class="n">t</span> <span class="ow">in</span> <span class="n">possib</span><span class="p">:</span> <span class="c1"># neighbors of s that are in G_u, not including u and v</span> <span class="n">nbrs_s</span> <span class="o">=</span> <span class="n">u_nbrs</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G_u</span><span class="p">[</span><span class="n">s</span><span class="p">])</span> <span class="o">-</span> <span class="n">set_uv</span> <span class="c1"># s and t are not directly connected</span> @@ -579,11 +591,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/centrality/eigenvector.html b/_modules/networkx/algorithms/centrality/eigenvector.html index 2aebe6e1..b6d6daa3 100644 --- a/_modules/networkx/algorithms/centrality/eigenvector.html +++ b/_modules/networkx/algorithms/centrality/eigenvector.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.eigenvector — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.eigenvector — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/eigenvector';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/eigenvector.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"> @@ -705,11 +717,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/centrality/group.html b/_modules/networkx/algorithms/centrality/group.html index 97e6518b..8fa8faaf 100644 --- a/_modules/networkx/algorithms/centrality/group.html +++ b/_modules/networkx/algorithms/centrality/group.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.group — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.group — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/group';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/group.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"> @@ -670,7 +682,7 @@ <span class="k">else</span><span class="p">:</span> <span class="c1"># use Dijkstra's algorithm</span> <span class="n">S</span><span class="p">,</span> <span class="n">P</span><span class="p">,</span> <span class="n">sigma</span><span class="p">[</span><span class="n">s</span><span class="p">],</span> <span class="n">D</span><span class="p">[</span><span class="n">s</span><span class="p">]</span> <span class="o">=</span> <span class="n">_single_source_dijkstra_path_basic</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">weight</span><span class="p">)</span> <span class="n">betweenness</span><span class="p">,</span> <span class="n">delta</span><span class="p">[</span><span class="n">s</span><span class="p">]</span> <span class="o">=</span> <span class="n">_accumulate_endpoints</span><span class="p">(</span><span class="n">betweenness</span><span class="p">,</span> <span class="n">S</span><span class="p">,</span> <span class="n">P</span><span class="p">,</span> <span class="n">sigma</span><span class="p">[</span><span class="n">s</span><span class="p">],</span> <span class="n">s</span><span class="p">)</span> - <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">delta</span><span class="p">[</span><span class="n">s</span><span class="p">]</span><span class="o">.</span><span class="n">keys</span><span class="p">():</span> <span class="c1"># add the paths from s to i and rescale sigma</span> + <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">delta</span><span class="p">[</span><span class="n">s</span><span class="p">]:</span> <span class="c1"># add the paths from s to i and rescale sigma</span> <span class="k">if</span> <span class="n">s</span> <span class="o">!=</span> <span class="n">i</span><span class="p">:</span> <span class="n">delta</span><span class="p">[</span><span class="n">s</span><span class="p">][</span><span class="n">i</span><span class="p">]</span> <span class="o">+=</span> <span class="mi">1</span> <span class="k">if</span> <span class="n">weight</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span> @@ -1145,7 +1157,7 @@ <span class="sd"> Journal of Mathematical Sociology. 23(3): 181-201. 1999.</span> <span class="sd"> http://www.analytictech.com/borgatti/group_centrality.htm</span> <span class="sd"> """</span> - <span class="n">centrality</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="nb">set</span><span class="p">()</span><span class="o">.</span><span class="n">union</span><span class="p">(</span><span class="o">*</span><span class="nb">list</span><span class="p">(</span><span class="nb">set</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">neighbors</span><span class="p">(</span><span class="n">i</span><span class="p">))</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">S</span><span class="p">))</span> <span class="o">-</span> <span class="nb">set</span><span class="p">(</span><span class="n">S</span><span class="p">))</span> + <span class="n">centrality</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="nb">set</span><span class="p">()</span><span class="o">.</span><span class="n">union</span><span class="p">(</span><span class="o">*</span><span class="p">[</span><span class="nb">set</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">neighbors</span><span class="p">(</span><span class="n">i</span><span class="p">))</span> <span class="k">for</span> <span class="n">i</span> <span class="ow">in</span> <span class="n">S</span><span class="p">])</span> <span class="o">-</span> <span class="nb">set</span><span class="p">(</span><span class="n">S</span><span class="p">))</span> <span class="n">centrality</span> <span class="o">/=</span> <span class="nb">len</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="o">-</span> <span class="nb">len</span><span class="p">(</span><span class="n">S</span><span class="p">)</span> <span class="k">return</span> <span class="n">centrality</span></div> @@ -1254,11 +1266,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/centrality/harmonic.html b/_modules/networkx/algorithms/centrality/harmonic.html index 6abdf215..a28375a5 100644 --- a/_modules/networkx/algorithms/centrality/harmonic.html +++ b/_modules/networkx/algorithms/centrality/harmonic.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.harmonic — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.harmonic — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/harmonic';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/harmonic.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"> @@ -554,11 +566,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/centrality/katz.html b/_modules/networkx/algorithms/centrality/katz.html index 6535b2aa..4bbfedc1 100644 --- a/_modules/networkx/algorithms/centrality/katz.html +++ b/_modules/networkx/algorithms/centrality/katz.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.katz — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.katz — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/katz';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/katz.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"> @@ -809,11 +821,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/centrality/laplacian.html b/_modules/networkx/algorithms/centrality/laplacian.html new file mode 100644 index 00000000..77e632e3 --- /dev/null +++ b/_modules/networkx/algorithms/centrality/laplacian.html @@ -0,0 +1,690 @@ + +<!DOCTYPE html> + +<html lang="en"> + <head> + <meta charset="utf-8" /> + <meta name="viewport" content="width=device-width, initial-scale=1.0" /> + <title>networkx.algorithms.centrality.laplacian — NetworkX 3.1rc1.dev0 documentation</title> + + + + <script data-cfasync="false"> + document.documentElement.dataset.mode = localStorage.getItem("mode") || "light"; + document.documentElement.dataset.theme = localStorage.getItem("theme") || "light"; + </script> + + <!-- Loaded before other Sphinx assets --> + <link href="../../../../_static/styles/theme.css?digest=796348d33e8b1d947c94" rel="stylesheet"> +<link href="../../../../_static/styles/bootstrap.css?digest=796348d33e8b1d947c94" rel="stylesheet"> +<link href="../../../../_static/styles/pydata-sphinx-theme.css?digest=796348d33e8b1d947c94" rel="stylesheet"> + + + <link href="../../../../_static/vendor/fontawesome/6.1.2/css/all.min.css?digest=796348d33e8b1d947c94" rel="stylesheet"> + <link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../_static/vendor/fontawesome/6.1.2/webfonts/fa-solid-900.woff2"> +<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../_static/vendor/fontawesome/6.1.2/webfonts/fa-brands-400.woff2"> +<link rel="preload" as="font" type="font/woff2" crossorigin href="../../../../_static/vendor/fontawesome/6.1.2/webfonts/fa-regular-400.woff2"> + + <link rel="stylesheet" type="text/css" href="../../../../_static/pygments.css" /> + <link rel="stylesheet" type="text/css" href="../../../../_static/custom.css" /> + <link rel="stylesheet" type="text/css" href="../../../../_static/sg_gallery.css" /> + <link rel="stylesheet" type="text/css" href="../../../../_static/sg_gallery-binder.css" /> + <link rel="stylesheet" type="text/css" href="../../../../_static/sg_gallery-dataframe.css" /> + <link rel="stylesheet" type="text/css" href="../../../../_static/sg_gallery-rendered-html.css" /> + + <!-- Pre-loaded scripts that we'll load fully later --> + <link rel="preload" as="script" href="../../../../_static/scripts/bootstrap.js?digest=796348d33e8b1d947c94"> +<link rel="preload" as="script" href="../../../../_static/scripts/pydata-sphinx-theme.js?digest=796348d33e8b1d947c94"> + + <script data-url_root="../../../../" id="documentation_options" src="../../../../_static/documentation_options.js"></script> + <script src="../../../../_static/jquery.js"></script> + <script src="../../../../_static/underscore.js"></script> + <script src="../../../../_static/_sphinx_javascript_frameworks_compat.js"></script> + <script src="../../../../_static/doctools.js"></script> + <script src="../../../../_static/sphinx_highlight.js"></script> + <script src="../../../../_static/copybutton.js"></script> + <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/laplacian';</script> + <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/laplacian.html" /> + <link rel="search" type="application/opensearchdescription+xml" + 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"> + </head> + + + <body data-spy="scroll" data-target="#bd-toc-nav" data-offset="180" data-default-mode="light"> + + + + <a class="skip-link" href="#main-content">Skip to main content</a> +<div class="container-fluid version-alert devbar"> + <div class="row no-gutters"> + <div class="col-12 text-center"> + This page is documentation for a DEVELOPMENT / PRE-RELEASE version. + <a + class="btn version-stable font-weight-bold ml-3 my-3 align-baseline" + href="https://networkx.org/documentation/stable/" + >Switch to stable version</a + > + </div> + </div> +</div> + + + + <input type="checkbox" class="sidebar-toggle" name="__primary" id="__primary"> + <label class="overlay overlay-primary" for="__primary"></label> + + + <input type="checkbox" class="sidebar-toggle" name="__secondary" id="__secondary"> + <label class="overlay overlay-secondary" for="__secondary"></label> + + + <div class="search-button__wrapper"> + <div class="search-button__overlay"></div> + <div class="search-button__search-container"> + +<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><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> + + + <nav class="bd-header navbar navbar-expand-lg bd-navbar" id="navbar-main"><div class="bd-header__inner bd-page-width"> + <label class="sidebar-toggle primary-toggle" for="__primary"> + <span class="fa-solid fa-bars"></span> + </label> + <div id="navbar-start"> + + + + + +<a class="navbar-brand logo" href="../../../../index.html"> + + + + + + + + + + + <img src="../../../../_static/networkx_banner.svg" class="logo__image only-light" alt="Logo image"> + <img src="../../../../_static/networkx_banner.svg" class="logo__image only-dark" alt="Logo image"> + + +</a> + + </div> + + + <div class="col-lg-9 navbar-header-items"> + <div id="navbar-center" class="mr-auto"> + + <div class="navbar-center-item"> + <nav class="navbar-nav"> + <p class="sidebar-header-items__title" role="heading" aria-level="1" aria-label="Site Navigation"> + Site Navigation + </p> + <ul id="navbar-main-elements" class="navbar-nav"> + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../install.html"> + Install + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../tutorial.html"> + Tutorial + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../reference/index.html"> + Reference + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../auto_examples/index.html"> + Gallery + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../developer/index.html"> + Developer + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../release/index.html"> + Releases + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-external" href="https://networkx.org/nx-guides/"> + Guides + </a> + </li> + + </ul> +</nav> + </div> + + </div> + + <div id="navbar-end"> + + <div class="navbar-end-item navbar-persistent--container"> + +<button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-toggle="tooltip"> + <i class="fa-solid fa-magnifying-glass"></i> +</button> + </div> + + + <div class="navbar-end-item"> + <button class="theme-switch-button btn btn-sm btn-outline-primary navbar-btn rounded-circle" title="light/dark" aria-label="light/dark" data-toggle="tooltip"> + <span class="theme-switch" data-mode="light"><i class="fa-solid fa-sun"></i></span> + <span class="theme-switch" data-mode="dark"><i class="fa-solid fa-moon"></i></span> + <span class="theme-switch" data-mode="auto"><i class="fa-solid fa-circle-half-stroke"></i></span> +</button> + </div> + + <div class="navbar-end-item"> + <ul id="navbar-icon-links" class="navbar-nav" aria-label="Icon Links"> + <li class="nav-item"> + + + + + + + + <a href="https://networkx.org" title="Home Page" class="nav-link" rel="noopener" target="_blank" data-toggle="tooltip"><span><i class="fas fa-home"></i></span> + <label class="sr-only">Home Page</label></a> + </li> + <li class="nav-item"> + + + + + + + + <a href="https://github.com/networkx/networkx" title="GitHub" class="nav-link" rel="noopener" target="_blank" data-toggle="tooltip"><span><i class="fab fa-github-square"></i></span> + <label class="sr-only">GitHub</label></a> + </li> + </ul> + </div> + + <div class="navbar-end-item"> + <ul class="navbar-nav"> + <li class="mr-2 dropdown"> + <button + type="button" + class="btn btn-version btn-sm navbar-btn dropdown-toggle" + id="dLabelMore" + data-toggle="dropdown" + > + v3.1rc1.dev0 + <span class="caret"></span> + </button> + <ul class="dropdown-menu" aria-labelledby="dLabelMore"> + <li> + <a href="https://networkx.org/documentation/latest/index.html" + >devel (latest)</a + > + </li> + <li> + <a href="https://networkx.org/documentation/stable/index.html" + >current (stable)</a + > + </li> + </ul> + </li> +</ul> + </div> + + </div> + </div> + + + + + <div class="navbar-persistent--mobile"> +<button class="btn btn-sm navbar-btn search-button search-button__button" title="Search" aria-label="Search" data-toggle="tooltip"> + <i class="fa-solid fa-magnifying-glass"></i> +</button> + </div> + + + + <label class="sidebar-toggle secondary-toggle" for="__secondary"> + <span class="fa-solid fa-outdent"></span> + </label> + + +</div> + </nav> + + + <div class="bd-container"> + <div class="bd-container__inner bd-page-width"> + + <div class="bd-sidebar-primary bd-sidebar"> + + + <div class="sidebar-header-items sidebar-primary__section"> + + + <div class="sidebar-header-items__center"> + + <div class="navbar-center-item"> + <nav class="navbar-nav"> + <p class="sidebar-header-items__title" role="heading" aria-level="1" aria-label="Site Navigation"> + Site Navigation + </p> + <ul id="navbar-main-elements" class="navbar-nav"> + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../install.html"> + Install + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../tutorial.html"> + Tutorial + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../reference/index.html"> + Reference + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../auto_examples/index.html"> + Gallery + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../developer/index.html"> + Developer + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-internal" href="../../../../release/index.html"> + Releases + </a> + </li> + + + <li class="nav-item"> + <a class="nav-link nav-external" href="https://networkx.org/nx-guides/"> + Guides + </a> + </li> + + </ul> +</nav> + </div> + + </div> + + + + + <div class="sidebar-header-items__end"> + + <div class="navbar-end-item"> + <button class="theme-switch-button btn btn-sm btn-outline-primary navbar-btn rounded-circle" title="light/dark" aria-label="light/dark" data-toggle="tooltip"> + <span class="theme-switch" data-mode="light"><i class="fa-solid fa-sun"></i></span> + <span class="theme-switch" data-mode="dark"><i class="fa-solid fa-moon"></i></span> + <span class="theme-switch" data-mode="auto"><i class="fa-solid fa-circle-half-stroke"></i></span> +</button> + </div> + + <div class="navbar-end-item"> + <ul id="navbar-icon-links" class="navbar-nav" aria-label="Icon Links"> + <li class="nav-item"> + + + + + + + + <a href="https://networkx.org" title="Home Page" class="nav-link" rel="noopener" target="_blank" data-toggle="tooltip"><span><i class="fas fa-home"></i></span> + <label class="sr-only">Home Page</label></a> + </li> + <li class="nav-item"> + + + + + + + + <a href="https://github.com/networkx/networkx" title="GitHub" class="nav-link" rel="noopener" target="_blank" data-toggle="tooltip"><span><i class="fab fa-github-square"></i></span> + <label class="sr-only">GitHub</label></a> + </li> + </ul> + </div> + + <div class="navbar-end-item"> + <ul class="navbar-nav"> + <li class="mr-2 dropdown"> + <button + type="button" + class="btn btn-version btn-sm navbar-btn dropdown-toggle" + id="dLabelMore" + data-toggle="dropdown" + > + v3.1rc1.dev0 + <span class="caret"></span> + </button> + <ul class="dropdown-menu" aria-labelledby="dLabelMore"> + <li> + <a href="https://networkx.org/documentation/latest/index.html" + >devel (latest)</a + > + </li> + <li> + <a href="https://networkx.org/documentation/stable/index.html" + >current (stable)</a + > + </li> + </ul> + </li> +</ul> + </div> + + </div> + + </div> + + + <div class="sidebar-start-items sidebar-primary__section"> + <div class="sidebar-start-items__item"> + </div> + </div> + + + + <div class="sidebar-end-items sidebar-primary__section"> + <div class="sidebar-end-items__item"> + </div> + </div> + + + <div id="rtd-footer-container"></div> + + </div> + <main id="main-content" class="bd-main"> + + + <div class="bd-content"> + <div class="bd-article-container"> + + <div class="bd-header-article"> + + </div> + + + <article class="bd-article" role="main"> + + <h1>Source code for networkx.algorithms.centrality.laplacian</h1><div class="highlight"><pre> +<span></span><span class="sd">"""</span> +<span class="sd">Laplacian centrality measures.</span> +<span class="sd">"""</span> +<span class="kn">import</span> <span class="nn">networkx</span> <span class="k">as</span> <span class="nn">nx</span> + +<span class="n">__all__</span> <span class="o">=</span> <span class="p">[</span><span class="s2">"laplacian_centrality"</span><span class="p">]</span> + + +<div class="viewcode-block" id="laplacian_centrality"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.centrality.laplacian_centrality.html#networkx.algorithms.centrality.laplacian_centrality">[docs]</a><span class="k">def</span> <span class="nf">laplacian_centrality</span><span class="p">(</span> + <span class="n">G</span><span class="p">,</span> <span class="n">normalized</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span> <span class="n">nodelist</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">,</span> <span class="n">walk_type</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">alpha</span><span class="o">=</span><span class="mf">0.95</span> +<span class="p">):</span> +<span class="w"> </span><span class="sa">r</span><span class="sd">"""Compute the Laplacian centrality for nodes in the graph `G`.</span> + +<span class="sd"> The Laplacian Centrality of a node ``i`` is measured by the drop in the</span> +<span class="sd"> Laplacian Energy after deleting node ``i`` from the graph. The Laplacian Energy</span> +<span class="sd"> is the sum of the squared eigenvalues of a graph's Laplacian matrix.</span> + +<span class="sd"> .. math::</span> + +<span class="sd"> C_L(u_i,G) = \frac{(\Delta E)_i}{E_L (G)} = \frac{E_L (G)-E_L (G_i)}{E_L (G)}</span> + +<span class="sd"> E_L (G) = \sum_{i=0}^n \lambda_i^2</span> + +<span class="sd"> Where $E_L (G)$ is the Laplacian energy of graph `G`,</span> +<span class="sd"> E_L (G_i) is the Laplacian energy of graph `G` after deleting node ``i``</span> +<span class="sd"> and $\lambda_i$ are the eigenvalues of `G`'s Laplacian matrix.</span> +<span class="sd"> This formula shows the normalized value. Without normalization,</span> +<span class="sd"> the numerator on the right side is returned.</span> + +<span class="sd"> Parameters</span> +<span class="sd"> ----------</span> +<span class="sd"> G : graph</span> +<span class="sd"> A networkx graph</span> + +<span class="sd"> normalized : bool (default = True)</span> +<span class="sd"> If True the centrality score is scaled so the sum over all nodes is 1.</span> +<span class="sd"> If False the centrality score for each node is the drop in Laplacian</span> +<span class="sd"> energy when that node is removed.</span> + +<span class="sd"> nodelist : list, optional (default = None)</span> +<span class="sd"> The rows and columns are ordered according to the nodes in nodelist.</span> +<span class="sd"> If nodelist is None, then the ordering is produced by G.nodes().</span> + +<span class="sd"> weight: string or None, optional (default=`weight`)</span> +<span class="sd"> Optional parameter `weight` to compute the Laplacian matrix.</span> +<span class="sd"> The edge data key used to compute each value in the matrix.</span> +<span class="sd"> If None, then each edge has weight 1.</span> + +<span class="sd"> walk_type : string or None, optional (default=None)</span> +<span class="sd"> Optional parameter `walk_type` used when calling</span> +<span class="sd"> :func:`directed_laplacian_matrix <networkx.directed_laplacian_matrix>`.</span> +<span class="sd"> If None, the transition matrix is selected depending on the properties</span> +<span class="sd"> of the graph. Otherwise can be `random`, `lazy`, or `pagerank`.</span> + +<span class="sd"> alpha : real (default = 0.95)</span> +<span class="sd"> Optional parameter `alpha` used when calling</span> +<span class="sd"> :func:`directed_laplacian_matrix <networkx.directed_laplacian_matrix>`.</span> +<span class="sd"> (1 - alpha) is the teleportation probability used with pagerank.</span> + +<span class="sd"> Returns</span> +<span class="sd"> -------</span> +<span class="sd"> nodes : dictionary</span> +<span class="sd"> Dictionary of nodes with Laplacian centrality as the value.</span> + +<span class="sd"> Examples</span> +<span class="sd"> --------</span> +<span class="sd"> >>> G = nx.Graph()</span> +<span class="sd"> >>> edges = [(0, 1, 4), (0, 2, 2), (2, 1, 1), (1, 3, 2), (1, 4, 2), (4, 5, 1)]</span> +<span class="sd"> >>> G.add_weighted_edges_from(edges)</span> +<span class="sd"> >>> sorted((v, f"{c:0.2f}") for v, c in laplacian_centrality(G).items())</span> +<span class="sd"> [(0, '0.70'), (1, '0.90'), (2, '0.28'), (3, '0.22'), (4, '0.26'), (5, '0.04')]</span> + +<span class="sd"> Notes</span> +<span class="sd"> -----</span> +<span class="sd"> The algorithm is implemented based on [1]_ with an extension to directed graphs</span> +<span class="sd"> using the ``directed_laplacian_matrix`` function.</span> + +<span class="sd"> Raises</span> +<span class="sd"> ------</span> +<span class="sd"> NetworkXPointlessConcept</span> +<span class="sd"> If the graph `G` is the null graph.</span> + +<span class="sd"> References</span> +<span class="sd"> ----------</span> +<span class="sd"> .. [1] Qi, X., Fuller, E., Wu, Q., Wu, Y., and Zhang, C.-Q. (2012).</span> +<span class="sd"> Laplacian centrality: A new centrality measure for weighted networks.</span> +<span class="sd"> Information Sciences, 194:240-253.</span> +<span class="sd"> https://math.wvu.edu/~cqzhang/Publication-files/my-paper/INS-2012-Laplacian-W.pdf</span> + +<span class="sd"> See Also</span> +<span class="sd"> --------</span> +<span class="sd"> directed_laplacian_matrix</span> +<span class="sd"> laplacian_matrix</span> +<span class="sd"> """</span> + <span class="kn">import</span> <span class="nn">numpy</span> <span class="k">as</span> <span class="nn">np</span> + <span class="kn">import</span> <span class="nn">scipy</span> <span class="k">as</span> <span class="nn">sp</span> + <span class="kn">import</span> <span class="nn">scipy.linalg</span> <span class="c1"># call as sp.linalg</span> + + <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span> + <span class="k">raise</span> <span class="n">nx</span><span class="o">.</span><span class="n">NetworkXPointlessConcept</span><span class="p">(</span><span class="s2">"null graph has no centrality defined"</span><span class="p">)</span> + + <span class="k">if</span> <span class="n">nodelist</span> <span class="o">!=</span> <span class="kc">None</span><span class="p">:</span> + <span class="n">nodeset</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">nbunch_iter</span><span class="p">(</span><span class="n">nodelist</span><span class="p">))</span> + <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">nodeset</span><span class="p">)</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">nodelist</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">"nodelist has duplicate nodes or nodes not in G"</span><span class="p">)</span> + <span class="n">nodes</span> <span class="o">=</span> <span class="n">nodelist</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="ow">in</span> <span class="n">G</span> <span class="k">if</span> <span class="n">n</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">nodeset</span><span class="p">]</span> + <span class="k">else</span><span class="p">:</span> + <span class="n">nodelist</span> <span class="o">=</span> <span class="n">nodes</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">G</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="n">lap_matrix</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">directed_laplacian_matrix</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">nodes</span><span class="p">,</span> <span class="n">weight</span><span class="p">,</span> <span class="n">walk_type</span><span class="p">,</span> <span class="n">alpha</span><span class="p">)</span> + <span class="k">else</span><span class="p">:</span> + <span class="n">lap_matrix</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">laplacian_matrix</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">nodes</span><span class="p">,</span> <span class="n">weight</span><span class="p">)</span><span class="o">.</span><span class="n">toarray</span><span class="p">()</span> + + <span class="n">full_energy</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">power</span><span class="p">(</span><span class="n">sp</span><span class="o">.</span><span class="n">linalg</span><span class="o">.</span><span class="n">eigh</span><span class="p">(</span><span class="n">lap_matrix</span><span class="p">,</span> <span class="n">eigvals_only</span><span class="o">=</span><span class="kc">True</span><span class="p">),</span> <span class="mi">2</span><span class="p">)</span><span class="o">.</span><span class="n">sum</span><span class="p">()</span> + + <span class="c1"># calculate laplacian centrality</span> + <span class="n">laplace_centralities_dict</span> <span class="o">=</span> <span class="p">{}</span> + <span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="n">node</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">nodelist</span><span class="p">):</span> + <span class="c1"># remove row and col i from lap_matrix</span> + <span class="n">all_but_i</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">np</span><span class="o">.</span><span class="n">arange</span><span class="p">(</span><span class="n">lap_matrix</span><span class="o">.</span><span class="n">shape</span><span class="p">[</span><span class="mi">0</span><span class="p">]))</span> + <span class="n">all_but_i</span><span class="o">.</span><span class="n">remove</span><span class="p">(</span><span class="n">i</span><span class="p">)</span> + <span class="n">A_2</span> <span class="o">=</span> <span class="n">lap_matrix</span><span class="p">[</span><span class="n">all_but_i</span><span class="p">,</span> <span class="p">:][:,</span> <span class="n">all_but_i</span><span class="p">]</span> + + <span class="c1"># Adjust diagonal for removed row</span> + <span class="n">new_diag</span> <span class="o">=</span> <span class="n">lap_matrix</span><span class="o">.</span><span class="n">diagonal</span><span class="p">()</span> <span class="o">-</span> <span class="nb">abs</span><span class="p">(</span><span class="n">lap_matrix</span><span class="p">[:,</span> <span class="n">i</span><span class="p">])</span> + <span class="n">np</span><span class="o">.</span><span class="n">fill_diagonal</span><span class="p">(</span><span class="n">A_2</span><span class="p">,</span> <span class="n">new_diag</span><span class="p">[</span><span class="n">all_but_i</span><span class="p">])</span> + + <span class="n">new_energy</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">power</span><span class="p">(</span><span class="n">sp</span><span class="o">.</span><span class="n">linalg</span><span class="o">.</span><span class="n">eigh</span><span class="p">(</span><span class="n">A_2</span><span class="p">,</span> <span class="n">eigvals_only</span><span class="o">=</span><span class="kc">True</span><span class="p">),</span> <span class="mi">2</span><span class="p">)</span><span class="o">.</span><span class="n">sum</span><span class="p">()</span> + <span class="n">lapl_cent</span> <span class="o">=</span> <span class="n">full_energy</span> <span class="o">-</span> <span class="n">new_energy</span> + <span class="k">if</span> <span class="n">normalized</span><span class="p">:</span> + <span class="n">lapl_cent</span> <span class="o">=</span> <span class="n">lapl_cent</span> <span class="o">/</span> <span class="n">full_energy</span> + + <span class="n">laplace_centralities_dict</span><span class="p">[</span><span class="n">node</span><span class="p">]</span> <span class="o">=</span> <span class="n">lapl_cent</span> + + <span class="k">return</span> <span class="n">laplace_centralities_dict</span></div> +</pre></div> + + </article> + + + + </div> + + + + <div class="bd-sidebar-secondary bd-toc"> + +<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"> + +</div> + + </div> + + + </div> + <footer class="bd-footer-content"> + <div class="bd-footer-content__inner"> + + </div> + </footer> + + </main> + </div> + </div> + + + + <!-- Scripts loaded after <body> so the DOM is not blocked --> + <script src="../../../../_static/scripts/bootstrap.js?digest=796348d33e8b1d947c94"></script> +<script src="../../../../_static/scripts/pydata-sphinx-theme.js?digest=796348d33e8b1d947c94"></script> + + <footer class="bd-footer"><div class="bd-footer__inner container"> + + <div class="footer-item"> + +<p class="copyright"> + + © Copyright 2004-2023, NetworkX Developers.<br> + +</p> + + </div> + + <div class="footer-item"> + <p class="theme-version"> + Built with the + <a href="https://pydata-sphinx-theme.readthedocs.io/en/stable/index.html"> + PyData Sphinx Theme + </a> + 0.12.0. +</p> + </div> + + <div class="footer-item"> + +<p class="sphinx-version"> +Created using <a href="http://sphinx-doc.org/">Sphinx</a> 5.2.3.<br> +</p> + + </div> + +</div> + </footer> + </body> +</html>
\ No newline at end of file diff --git a/_modules/networkx/algorithms/centrality/load.html b/_modules/networkx/algorithms/centrality/load.html index 50ba5326..3d837f03 100644 --- a/_modules/networkx/algorithms/centrality/load.html +++ b/_modules/networkx/algorithms/centrality/load.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.load — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.load — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/load';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/load.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"> @@ -672,11 +684,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/centrality/percolation.html b/_modules/networkx/algorithms/centrality/percolation.html index 6f084a9b..6802479a 100644 --- a/_modules/networkx/algorithms/centrality/percolation.html +++ b/_modules/networkx/algorithms/centrality/percolation.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.percolation — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.percolation — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/percolation';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/percolation.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"> @@ -525,7 +537,7 @@ <span class="sd"> -----</span> <span class="sd"> The algorithm is from Mahendra Piraveenan, Mikhail Prokopenko, and</span> <span class="sd"> Liaquat Hossain [1]_</span> -<span class="sd"> Pair dependecies are calculated and accumulated using [2]_</span> +<span class="sd"> Pair dependencies are calculated and accumulated using [2]_</span> <span class="sd"> For weighted graphs the edge weights must be greater than zero.</span> <span class="sd"> Zero edge weights can produce an infinite number of equal length</span> @@ -599,11 +611,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/centrality/reaching.html b/_modules/networkx/algorithms/centrality/reaching.html index 382c159a..35f03a30 100644 --- a/_modules/networkx/algorithms/centrality/reaching.html +++ b/_modules/networkx/algorithms/centrality/reaching.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.reaching — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.reaching — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/reaching';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/reaching.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"> @@ -679,11 +691,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/centrality/second_order.html b/_modules/networkx/algorithms/centrality/second_order.html index 175c0eed..a62c2e9f 100644 --- a/_modules/networkx/algorithms/centrality/second_order.html +++ b/_modules/networkx/algorithms/centrality/second_order.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.second_order — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.second_order — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/second_order';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/second_order.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"> @@ -608,11 +620,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/centrality/subgraph_alg.html b/_modules/networkx/algorithms/centrality/subgraph_alg.html index dbf1aed1..0ec85dbf 100644 --- a/_modules/networkx/algorithms/centrality/subgraph_alg.html +++ b/_modules/networkx/algorithms/centrality/subgraph_alg.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.subgraph_alg — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.subgraph_alg — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/subgraph_alg';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/subgraph_alg.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"> @@ -813,11 +825,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/centrality/trophic.html b/_modules/networkx/algorithms/centrality/trophic.html index 257a3141..86c075e8 100644 --- a/_modules/networkx/algorithms/centrality/trophic.html +++ b/_modules/networkx/algorithms/centrality/trophic.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.trophic — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.trophic — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/trophic';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/trophic.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"> @@ -634,11 +646,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/centrality/voterank_alg.html b/_modules/networkx/algorithms/centrality/voterank_alg.html index dd8f0c2f..4e4d9f6a 100644 --- a/_modules/networkx/algorithms/centrality/voterank_alg.html +++ b/_modules/networkx/algorithms/centrality/voterank_alg.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.centrality.voterank_alg — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.centrality.voterank_alg — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/centrality/voterank_alg';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/centrality/voterank_alg.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"> @@ -567,11 +579,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/chains.html b/_modules/networkx/algorithms/chains.html index 29396974..43c7f25a 100644 --- a/_modules/networkx/algorithms/chains.html +++ b/_modules/networkx/algorithms/chains.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.chains — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.chains — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/chains';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/chains.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"> @@ -646,11 +658,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/chordal.html b/_modules/networkx/algorithms/chordal.html index f8f39247..47ca3460 100644 --- a/_modules/networkx/algorithms/chordal.html +++ b/_modules/networkx/algorithms/chordal.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.chordal — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.chordal — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/chordal';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/chordal.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"> @@ -904,11 +916,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/clique.html b/_modules/networkx/algorithms/clique.html index 5e97ead2..6f2bf732 100644 --- a/_modules/networkx/algorithms/clique.html +++ b/_modules/networkx/algorithms/clique.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.clique — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.clique — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/clique';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/clique.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"> @@ -600,6 +612,67 @@ <span class="sd"> ValueError</span> <span class="sd"> If `nodes` is not a clique.</span> +<span class="sd"> Examples</span> +<span class="sd"> --------</span> +<span class="sd"> >>> from pprint import pprint # For nice dict formatting</span> +<span class="sd"> >>> G = nx.karate_club_graph()</span> +<span class="sd"> >>> sum(1 for c in nx.find_cliques(G)) # The number of maximal cliques in G</span> +<span class="sd"> 36</span> +<span class="sd"> >>> max(nx.find_cliques(G), key=len) # The largest maximal clique in G</span> +<span class="sd"> [0, 1, 2, 3, 13]</span> + +<span class="sd"> The size of the largest maximal clique is known as the *clique number* of</span> +<span class="sd"> the graph, which can be found directly with:</span> + +<span class="sd"> >>> max(len(c) for c in nx.find_cliques(G))</span> +<span class="sd"> 5</span> + +<span class="sd"> One can also compute the number of maximal cliques in `G` that contain a given</span> +<span class="sd"> node. The following produces a dictionary keyed by node whose</span> +<span class="sd"> values are the number of maximal cliques in `G` that contain the node:</span> + +<span class="sd"> >>> pprint({n: sum(1 for c in nx.find_cliques(G) if n in c) for n in G})</span> +<span class="sd"> {0: 13,</span> +<span class="sd"> 1: 6,</span> +<span class="sd"> 2: 7,</span> +<span class="sd"> 3: 3,</span> +<span class="sd"> 4: 2,</span> +<span class="sd"> 5: 3,</span> +<span class="sd"> 6: 3,</span> +<span class="sd"> 7: 1,</span> +<span class="sd"> 8: 3,</span> +<span class="sd"> 9: 2,</span> +<span class="sd"> 10: 2,</span> +<span class="sd"> 11: 1,</span> +<span class="sd"> 12: 1,</span> +<span class="sd"> 13: 2,</span> +<span class="sd"> 14: 1,</span> +<span class="sd"> 15: 1,</span> +<span class="sd"> 16: 1,</span> +<span class="sd"> 17: 1,</span> +<span class="sd"> 18: 1,</span> +<span class="sd"> 19: 2,</span> +<span class="sd"> 20: 1,</span> +<span class="sd"> 21: 1,</span> +<span class="sd"> 22: 1,</span> +<span class="sd"> 23: 3,</span> +<span class="sd"> 24: 2,</span> +<span class="sd"> 25: 2,</span> +<span class="sd"> 26: 1,</span> +<span class="sd"> 27: 3,</span> +<span class="sd"> 28: 2,</span> +<span class="sd"> 29: 2,</span> +<span class="sd"> 30: 2,</span> +<span class="sd"> 31: 4,</span> +<span class="sd"> 32: 9,</span> +<span class="sd"> 33: 14}</span> + +<span class="sd"> Or, similarly, the maximal cliques in `G` that contain a given node.</span> +<span class="sd"> For example, the 4 maximal cliques that contain node 31:</span> + +<span class="sd"> >>> [c for c in nx.find_cliques(G) if 31 in c]</span> +<span class="sd"> [[0, 31], [33, 32, 31], [33, 28, 31], [24, 25, 31]]</span> + <span class="sd"> See Also</span> <span class="sd"> --------</span> <span class="sd"> find_cliques_recursive</span> @@ -737,7 +810,7 @@ <span class="sd"> See Also</span> <span class="sd"> --------</span> <span class="sd"> find_cliques</span> -<span class="sd"> An iterative version of the same algorithm.</span> +<span class="sd"> An iterative version of the same algorithm. See docstring for examples.</span> <span class="sd"> Notes</span> <span class="sd"> -----</span> @@ -914,6 +987,14 @@ <span class="sd"> The *clique number* of a graph is the size of the largest clique in</span> <span class="sd"> the graph.</span> +<span class="sd"> .. deprecated:: 3.0</span> + +<span class="sd"> graph_clique_number is deprecated in NetworkX 3.0 and will be removed</span> +<span class="sd"> in v3.2. The graph clique number can be computed directly with::</span> + +<span class="sd"> max(len(c) for c in nx.find_cliques(G))</span> + + <span class="sd"> Parameters</span> <span class="sd"> ----------</span> <span class="sd"> G : NetworkX graph</span> @@ -936,6 +1017,16 @@ <span class="sd"> maximal cliques.</span> <span class="sd"> """</span> + <span class="kn">import</span> <span class="nn">warnings</span> + + <span class="n">warnings</span><span class="o">.</span><span class="n">warn</span><span class="p">(</span> + <span class="p">(</span> + <span class="s2">"</span><span class="se">\n\n</span><span class="s2">graph_clique_number is deprecated and will be removed.</span><span class="se">\n</span><span class="s2">"</span> + <span class="s2">"Use: ``max(len(c) for c in nx.find_cliques(G))`` instead."</span> + <span class="p">),</span> + <span class="ne">DeprecationWarning</span><span class="p">,</span> + <span class="n">stacklevel</span><span class="o">=</span><span class="mi">2</span><span class="p">,</span> + <span class="p">)</span> <span class="k">if</span> <span class="nb">len</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="o"><</span> <span class="mi">1</span><span class="p">:</span> <span class="k">return</span> <span class="mi">0</span> <span class="k">if</span> <span class="n">cliques</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span> @@ -946,6 +1037,13 @@ <div class="viewcode-block" id="graph_number_of_cliques"><a class="viewcode-back" href="../../../reference/algorithms/generated/networkx.algorithms.clique.graph_number_of_cliques.html#networkx.algorithms.clique.graph_number_of_cliques">[docs]</a><span class="k">def</span> <span class="nf">graph_number_of_cliques</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">cliques</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Returns the number of maximal cliques in the graph.</span> +<span class="sd"> .. deprecated:: 3.0</span> + +<span class="sd"> graph_number_of_cliques is deprecated and will be removed in v3.2.</span> +<span class="sd"> The number of maximal cliques can be computed directly with::</span> + +<span class="sd"> sum(1 for _ in nx.find_cliques(G))</span> + <span class="sd"> Parameters</span> <span class="sd"> ----------</span> <span class="sd"> G : NetworkX graph</span> @@ -968,6 +1066,16 @@ <span class="sd"> maximal cliques.</span> <span class="sd"> """</span> + <span class="kn">import</span> <span class="nn">warnings</span> + + <span class="n">warnings</span><span class="o">.</span><span class="n">warn</span><span class="p">(</span> + <span class="p">(</span> + <span class="s2">"</span><span class="se">\n\n</span><span class="s2">graph_number_of_cliques is deprecated and will be removed.</span><span class="se">\n</span><span class="s2">"</span> + <span class="s2">"Use: ``sum(1 for _ in nx.find_cliques(G))`` instead."</span> + <span class="p">),</span> + <span class="ne">DeprecationWarning</span><span class="p">,</span> + <span class="n">stacklevel</span><span class="o">=</span><span class="mi">2</span><span class="p">,</span> + <span class="p">)</span> <span class="k">if</span> <span class="n">cliques</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span> <span class="n">cliques</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">find_cliques</span><span class="p">(</span><span class="n">G</span><span class="p">))</span> <span class="k">return</span> <span class="nb">len</span><span class="p">(</span><span class="n">cliques</span><span class="p">)</span></div> @@ -1039,9 +1147,29 @@ <div class="viewcode-block" id="number_of_cliques"><a class="viewcode-back" href="../../../reference/algorithms/generated/networkx.algorithms.clique.number_of_cliques.html#networkx.algorithms.clique.number_of_cliques">[docs]</a><span class="k">def</span> <span class="nf">number_of_cliques</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">nodes</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">cliques</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Returns the number of maximal cliques for each node.</span> +<span class="sd"> .. deprecated:: 3.0</span> + +<span class="sd"> number_of_cliques is deprecated and will be removed in v3.2.</span> +<span class="sd"> Use the result of `find_cliques` directly to compute the number of</span> +<span class="sd"> cliques containing each node::</span> + +<span class="sd"> {n: sum(1 for c in nx.find_cliques(G) if n in c) for n in G}</span> + <span class="sd"> Returns a single or list depending on input nodes.</span> <span class="sd"> Optional list of cliques can be input if already computed.</span> <span class="sd"> """</span> + <span class="kn">import</span> <span class="nn">warnings</span> + + <span class="n">warnings</span><span class="o">.</span><span class="n">warn</span><span class="p">(</span> + <span class="p">(</span> + <span class="s2">"</span><span class="se">\n\n</span><span class="s2">number_of_cliques is deprecated and will be removed.</span><span class="se">\n</span><span class="s2">"</span> + <span class="s2">"Use the result of find_cliques directly to compute the number</span><span class="se">\n</span><span class="s2">"</span> + <span class="s2">"of cliques containing each node:</span><span class="se">\n\n</span><span class="s2">"</span> + <span class="s2">" {n: sum(1 for c in nx.find_cliques(G) if n in c) for n in G}</span><span class="se">\n\n</span><span class="s2">"</span> + <span class="p">),</span> + <span class="ne">DeprecationWarning</span><span class="p">,</span> + <span class="n">stacklevel</span><span class="o">=</span><span class="mi">2</span><span class="p">,</span> + <span class="p">)</span> <span class="k">if</span> <span class="n">cliques</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span> <span class="n">cliques</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">find_cliques</span><span class="p">(</span><span class="n">G</span><span class="p">))</span> @@ -1062,9 +1190,29 @@ <div class="viewcode-block" id="cliques_containing_node"><a class="viewcode-back" href="../../../reference/algorithms/generated/networkx.algorithms.clique.cliques_containing_node.html#networkx.algorithms.clique.cliques_containing_node">[docs]</a><span class="k">def</span> <span class="nf">cliques_containing_node</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">nodes</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">cliques</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Returns a list of cliques containing the given node.</span> +<span class="sd"> .. deprecated:: 3.0</span> + +<span class="sd"> cliques_containing_node is deprecated and will be removed in 3.2.</span> +<span class="sd"> Use the result of `find_cliques` directly to compute the cliques that</span> +<span class="sd"> contain each node::</span> + +<span class="sd"> {n: [c for c in nx.find_cliques(G) if n in c] for n in G}</span> + <span class="sd"> Returns a single list or list of lists depending on input nodes.</span> <span class="sd"> Optional list of cliques can be input if already computed.</span> <span class="sd"> """</span> + <span class="kn">import</span> <span class="nn">warnings</span> + + <span class="n">warnings</span><span class="o">.</span><span class="n">warn</span><span class="p">(</span> + <span class="p">(</span> + <span class="s2">"</span><span class="se">\n\n</span><span class="s2">cliques_containing_node is deprecated and will be removed.</span><span class="se">\n</span><span class="s2">"</span> + <span class="s2">"Use the result of find_cliques directly to compute maximal cliques</span><span class="se">\n</span><span class="s2">"</span> + <span class="s2">"containing each node:</span><span class="se">\n\n</span><span class="s2">"</span> + <span class="s2">" {n: [c for c in nx.find_cliques(G) if n in c] for n in G}</span><span class="se">\n\n</span><span class="s2">"</span> + <span class="p">),</span> + <span class="ne">DeprecationWarning</span><span class="p">,</span> + <span class="n">stacklevel</span><span class="o">=</span><span class="mi">2</span><span class="p">,</span> + <span class="p">)</span> <span class="k">if</span> <span class="n">cliques</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span> <span class="n">cliques</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">find_cliques</span><span class="p">(</span><span class="n">G</span><span class="p">))</span> @@ -1251,11 +1399,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/cluster.html b/_modules/networkx/algorithms/cluster.html index cf2fed2b..ab23f601 100644 --- a/_modules/networkx/algorithms/cluster.html +++ b/_modules/networkx/algorithms/cluster.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.cluster — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.cluster — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/cluster';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/cluster.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"> @@ -779,8 +791,7 @@ <span class="sd"> .. math::</span> -<span class="sd"> c_u = \frac{2}{deg^{tot}(u)(deg^{tot}(u)-1) - 2deg^{\leftrightarrow}(u)}</span> -<span class="sd"> T(u),</span> +<span class="sd"> c_u = \frac{T(u)}{2(deg^{tot}(u)(deg^{tot}(u)-1) - 2deg^{\leftrightarrow}(u))},</span> <span class="sd"> where :math:`T(u)` is the number of directed triangles through node</span> <span class="sd"> :math:`u`, :math:`deg^{tot}(u)` is the sum of in degree and out degree of</span> @@ -792,8 +803,10 @@ <span class="sd"> ----------</span> <span class="sd"> G : graph</span> -<span class="sd"> nodes : container of nodes, optional (default=all nodes in G)</span> -<span class="sd"> Compute clustering for nodes in this container.</span> +<span class="sd"> nodes : node, iterable of nodes, or None (default=None)</span> +<span class="sd"> If a singleton node, return the number of triangles for that node.</span> +<span class="sd"> If an iterable, compute the number of triangles for each of those nodes.</span> +<span class="sd"> If `None` (the default) compute the number of triangles for all nodes in `G`.</span> <span class="sd"> weight : string or None, optional (default=None)</span> <span class="sd"> The edge attribute that holds the numerical value used as a weight.</span> @@ -1016,7 +1029,7 @@ <span class="sd"> Notes</span> <span class="sd"> -----</span> -<span class="sd"> In a network of N nodes, the highest triangle multiplicty an edge can have</span> +<span class="sd"> In a network of N nodes, the highest triangle multiplicity an edge can have</span> <span class="sd"> is N-2.</span> <span class="sd"> The return value does not include a `zero` entry if no edges of a</span> @@ -1050,11 +1063,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/coloring/equitable_coloring.html b/_modules/networkx/algorithms/coloring/equitable_coloring.html index a5c4df25..99a6cdbd 100644 --- a/_modules/networkx/algorithms/coloring/equitable_coloring.html +++ b/_modules/networkx/algorithms/coloring/equitable_coloring.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.coloring.equitable_coloring — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.coloring.equitable_coloring — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/coloring/equitable_coloring';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/coloring/equitable_coloring.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"> @@ -475,10 +487,7 @@ <span class="k">def</span> <span class="nf">is_coloring</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">coloring</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Determine if the coloring is a valid coloring for the graph G."""</span> <span class="c1"># Verify that the coloring is valid.</span> - <span class="k">for</span> <span class="p">(</span><span class="n">s</span><span class="p">,</span> <span class="n">d</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">if</span> <span class="n">coloring</span><span class="p">[</span><span class="n">s</span><span class="p">]</span> <span class="o">==</span> <span class="n">coloring</span><span class="p">[</span><span class="n">d</span><span class="p">]:</span> - <span class="k">return</span> <span class="kc">False</span> - <span class="k">return</span> <span class="kc">True</span> + <span class="k">return</span> <span class="nb">all</span><span class="p">(</span><span class="n">coloring</span><span class="p">[</span><span class="n">s</span><span class="p">]</span> <span class="o">!=</span> <span class="n">coloring</span><span class="p">[</span><span class="n">d</span><span class="p">]</span> <span class="k">for</span> <span class="n">s</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">edges</span><span class="p">)</span> <span class="k">def</span> <span class="nf">is_equitable</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">coloring</span><span class="p">,</span> <span class="n">num_colors</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> @@ -512,7 +521,7 @@ <span class="k">def</span> <span class="nf">make_C_from_F</span><span class="p">(</span><span class="n">F</span><span class="p">):</span> - <span class="n">C</span> <span class="o">=</span> <span class="n">defaultdict</span><span class="p">(</span><span class="k">lambda</span><span class="p">:</span> <span class="p">[])</span> + <span class="n">C</span> <span class="o">=</span> <span class="n">defaultdict</span><span class="p">(</span><span class="nb">list</span><span class="p">)</span> <span class="k">for</span> <span class="n">node</span><span class="p">,</span> <span class="n">color</span> <span class="ow">in</span> <span class="n">F</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> <span class="n">C</span><span class="p">[</span><span class="n">color</span><span class="p">]</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">node</span><span class="p">)</span> @@ -531,9 +540,7 @@ <span class="k">def</span> <span class="nf">make_H_from_C_N</span><span class="p">(</span><span class="n">C</span><span class="p">,</span> <span class="n">N</span><span class="p">):</span> <span class="k">return</span> <span class="p">{</span> - <span class="p">(</span><span class="n">c1</span><span class="p">,</span> <span class="n">c2</span><span class="p">):</span> <span class="nb">sum</span><span class="p">(</span><span class="mi">1</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">C</span><span class="p">[</span><span class="n">c1</span><span class="p">]</span> <span class="k">if</span> <span class="n">N</span><span class="p">[(</span><span class="n">node</span><span class="p">,</span> <span class="n">c2</span><span class="p">)]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> - <span class="k">for</span> <span class="n">c1</span> <span class="ow">in</span> <span class="n">C</span><span class="o">.</span><span class="n">keys</span><span class="p">()</span> - <span class="k">for</span> <span class="n">c2</span> <span class="ow">in</span> <span class="n">C</span><span class="o">.</span><span class="n">keys</span><span class="p">()</span> + <span class="p">(</span><span class="n">c1</span><span class="p">,</span> <span class="n">c2</span><span class="p">):</span> <span class="nb">sum</span><span class="p">(</span><span class="mi">1</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">C</span><span class="p">[</span><span class="n">c1</span><span class="p">]</span> <span class="k">if</span> <span class="n">N</span><span class="p">[(</span><span class="n">node</span><span class="p">,</span> <span class="n">c2</span><span class="p">)]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="k">for</span> <span class="n">c1</span> <span class="ow">in</span> <span class="n">C</span> <span class="k">for</span> <span class="n">c2</span> <span class="ow">in</span> <span class="n">C</span> <span class="p">}</span> @@ -544,7 +551,7 @@ <span class="c1"># Change the class of 'u' from X to Y</span> <span class="n">F</span><span class="p">[</span><span class="n">u</span><span class="p">]</span> <span class="o">=</span> <span class="n">Y</span> - <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span><span class="o">.</span><span class="n">keys</span><span class="p">():</span> + <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span><span class="p">:</span> <span class="c1"># 'u' witnesses an edge from k -> Y instead of from k -> X now.</span> <span class="k">if</span> <span class="n">N</span><span class="p">[</span><span class="n">u</span><span class="p">,</span> <span class="n">k</span><span class="p">]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">:</span> <span class="n">H</span><span class="p">[(</span><span class="n">X</span><span class="p">,</span> <span class="n">k</span><span class="p">)]</span> <span class="o">-=</span> <span class="mi">1</span> @@ -629,7 +636,7 @@ <span class="c1"># using a look-up table instead of testing for membership in a set by a</span> <span class="c1"># logarithmic factor.</span> <span class="n">next_layer</span> <span class="o">=</span> <span class="p">[]</span> - <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span><span class="o">.</span><span class="n">keys</span><span class="p">():</span> + <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span><span class="p">:</span> <span class="k">if</span> <span class="p">(</span> <span class="n">H</span><span class="p">[(</span><span class="n">k</span><span class="p">,</span> <span class="n">pop</span><span class="p">)]</span> <span class="o">></span> <span class="mi">0</span> <span class="ow">and</span> <span class="n">k</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">A_cal</span> @@ -664,11 +671,10 @@ <span class="n">made_equitable</span> <span class="o">=</span> <span class="kc">False</span> <span class="k">for</span> <span class="n">W_1</span> <span class="ow">in</span> <span class="n">R_cal</span><span class="p">[::</span><span class="o">-</span><span class="mi">1</span><span class="p">]:</span> - <span class="k">for</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">C</span><span class="p">[</span><span class="n">W_1</span><span class="p">]:</span> <span class="n">X</span> <span class="o">=</span> <span class="kc">None</span> - <span class="k">for</span> <span class="n">U</span> <span class="ow">in</span> <span class="n">C</span><span class="o">.</span><span class="n">keys</span><span class="p">():</span> + <span class="k">for</span> <span class="n">U</span> <span class="ow">in</span> <span class="n">C</span><span class="p">:</span> <span class="k">if</span> <span class="n">N</span><span class="p">[(</span><span class="n">v</span><span class="p">,</span> <span class="n">U</span><span class="p">)]</span> <span class="o">==</span> <span class="mi">0</span> <span class="ow">and</span> <span class="n">U</span> <span class="ow">in</span> <span class="n">A_cal</span> <span class="ow">and</span> <span class="n">U</span> <span class="o">!=</span> <span class="n">W_1</span><span class="p">:</span> <span class="n">X</span> <span class="o">=</span> <span class="n">U</span> @@ -676,7 +682,7 @@ <span class="k">if</span> <span class="n">X</span> <span class="ow">is</span> <span class="kc">None</span><span class="p">:</span> <span class="k">continue</span> - <span class="k">for</span> <span class="n">U</span> <span class="ow">in</span> <span class="n">C</span><span class="o">.</span><span class="n">keys</span><span class="p">():</span> + <span class="k">for</span> <span class="n">U</span> <span class="ow">in</span> <span class="n">C</span><span class="p">:</span> <span class="c1"># Note: Departing from the paper here.</span> <span class="k">if</span> <span class="n">N</span><span class="p">[(</span><span class="n">v</span><span class="p">,</span> <span class="n">U</span><span class="p">)]</span> <span class="o">>=</span> <span class="mi">1</span> <span class="ow">and</span> <span class="n">U</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">A_cal</span><span class="p">:</span> <span class="n">X_prime</span> <span class="o">=</span> <span class="n">U</span> @@ -757,7 +763,7 @@ <span class="c1"># they only exclude colors from A_cal</span> <span class="n">next_layer</span> <span class="o">=</span> <span class="p">[</span> <span class="n">k</span> - <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span><span class="o">.</span><span class="n">keys</span><span class="p">()</span> + <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span> <span class="k">if</span> <span class="n">H</span><span class="p">[(</span><span class="n">pop</span><span class="p">,</span> <span class="n">k</span><span class="p">)]</span> <span class="o">></span> <span class="mi">0</span> <span class="ow">and</span> <span class="n">k</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">B_cal_prime</span> <span class="ow">and</span> <span class="n">k</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">marked</span> <span class="p">]</span> @@ -781,7 +787,7 @@ <span class="n">I_set</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">z</span><span class="p">)</span> <span class="n">I_covered</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">z</span><span class="p">)</span> - <span class="n">I_covered</span><span class="o">.</span><span class="n">update</span><span class="p">([</span><span class="n">nbr</span> <span class="k">for</span> <span class="n">nbr</span> <span class="ow">in</span> <span class="n">L</span><span class="p">[</span><span class="n">z</span><span class="p">]])</span> + <span class="n">I_covered</span><span class="o">.</span><span class="n">update</span><span class="p">(</span><span class="nb">list</span><span class="p">(</span><span class="n">L</span><span class="p">[</span><span class="n">z</span><span class="p">]))</span> <span class="k">for</span> <span class="n">w</span> <span class="ow">in</span> <span class="n">L</span><span class="p">[</span><span class="n">z</span><span class="p">]:</span> <span class="k">if</span> <span class="n">F</span><span class="p">[</span><span class="n">w</span><span class="p">]</span> <span class="ow">in</span> <span class="n">A_cal_0</span> <span class="ow">and</span> <span class="n">N</span><span class="p">[(</span><span class="n">z</span><span class="p">,</span> <span class="n">F</span><span class="p">[</span><span class="n">w</span><span class="p">])]</span> <span class="o">==</span> <span class="mi">1</span><span class="p">:</span> @@ -818,19 +824,13 @@ <span class="c1"># change color of w to some color in B_cal</span> <span class="n">W_plus</span> <span class="o">=</span> <span class="nb">next</span><span class="p">(</span> - <span class="n">k</span> - <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span><span class="o">.</span><span class="n">keys</span><span class="p">()</span> - <span class="k">if</span> <span class="n">N</span><span class="p">[(</span><span class="n">w</span><span class="p">,</span> <span class="n">k</span><span class="p">)]</span> <span class="o">==</span> <span class="mi">0</span> <span class="ow">and</span> <span class="n">k</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">A_cal</span> + <span class="n">k</span> <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span> <span class="k">if</span> <span class="n">N</span><span class="p">[(</span><span class="n">w</span><span class="p">,</span> <span class="n">k</span><span class="p">)]</span> <span class="o">==</span> <span class="mi">0</span> <span class="ow">and</span> <span class="n">k</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">A_cal</span> <span class="p">)</span> <span class="n">change_color</span><span class="p">(</span><span class="n">w</span><span class="p">,</span> <span class="n">W</span><span class="p">,</span> <span class="n">W_plus</span><span class="p">,</span> <span class="n">N</span><span class="o">=</span><span class="n">N</span><span class="p">,</span> <span class="n">H</span><span class="o">=</span><span class="n">H</span><span class="p">,</span> <span class="n">F</span><span class="o">=</span><span class="n">F</span><span class="p">,</span> <span class="n">C</span><span class="o">=</span><span class="n">C</span><span class="p">,</span> <span class="n">L</span><span class="o">=</span><span class="n">L</span><span class="p">)</span> <span class="c1"># recurse with G[B \cup W*]</span> <span class="n">excluded_colors</span><span class="o">.</span><span class="n">update</span><span class="p">(</span> - <span class="p">[</span> - <span class="n">k</span> - <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span><span class="o">.</span><span class="n">keys</span><span class="p">()</span> - <span class="k">if</span> <span class="n">k</span> <span class="o">!=</span> <span class="n">W</span> <span class="ow">and</span> <span class="n">k</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">B_cal_prime</span> - <span class="p">]</span> + <span class="p">[</span><span class="n">k</span> <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span> <span class="k">if</span> <span class="n">k</span> <span class="o">!=</span> <span class="n">W</span> <span class="ow">and</span> <span class="n">k</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">B_cal_prime</span><span class="p">]</span> <span class="p">)</span> <span class="n">procedure_P</span><span class="p">(</span> <span class="n">V_minus</span><span class="o">=</span><span class="n">W</span><span class="p">,</span> @@ -945,7 +945,6 @@ <span class="k">for</span> <span class="n">u</span> <span class="ow">in</span> <span class="nb">sorted</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="n">v</span> <span class="ow">in</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">neighbors</span><span class="p">(</span><span class="n">u</span><span class="p">)):</span> - <span class="c1"># Do not double count edges if (v, u) has already been seen.</span> <span class="k">if</span> <span class="p">(</span><span class="n">v</span><span class="p">,</span> <span class="n">u</span><span class="p">)</span> <span class="ow">in</span> <span class="n">edges_seen</span><span class="p">:</span> <span class="k">continue</span> @@ -968,7 +967,7 @@ <span class="k">if</span> <span class="n">N</span><span class="p">[(</span><span class="n">u</span><span class="p">,</span> <span class="n">F</span><span class="p">[</span><span class="n">u</span><span class="p">])]</span> <span class="o">!=</span> <span class="mi">0</span><span class="p">:</span> <span class="c1"># Find the first color where 'u' does not have any neighbors.</span> - <span class="n">Y</span> <span class="o">=</span> <span class="nb">next</span><span class="p">(</span><span class="n">k</span> <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span><span class="o">.</span><span class="n">keys</span><span class="p">()</span> <span class="k">if</span> <span class="n">N</span><span class="p">[(</span><span class="n">u</span><span class="p">,</span> <span class="n">k</span><span class="p">)]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> + <span class="n">Y</span> <span class="o">=</span> <span class="nb">next</span><span class="p">(</span><span class="n">k</span> <span class="k">for</span> <span class="n">k</span> <span class="ow">in</span> <span class="n">C</span> <span class="k">if</span> <span class="n">N</span><span class="p">[(</span><span class="n">u</span><span class="p">,</span> <span class="n">k</span><span class="p">)]</span> <span class="o">==</span> <span class="mi">0</span><span class="p">)</span> <span class="n">X</span> <span class="o">=</span> <span class="n">F</span><span class="p">[</span><span class="n">u</span><span class="p">]</span> <span class="n">change_color</span><span class="p">(</span><span class="n">u</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">N</span><span class="o">=</span><span class="n">N</span><span class="p">,</span> <span class="n">H</span><span class="o">=</span><span class="n">H</span><span class="p">,</span> <span class="n">F</span><span class="o">=</span><span class="n">F</span><span class="p">,</span> <span class="n">C</span><span class="o">=</span><span class="n">C</span><span class="p">,</span> <span class="n">L</span><span class="o">=</span><span class="n">L_</span><span class="p">)</span> @@ -990,11 +989,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/coloring/greedy_coloring.html b/_modules/networkx/algorithms/coloring/greedy_coloring.html index 56f93c01..e471de37 100644 --- a/_modules/networkx/algorithms/coloring/greedy_coloring.html +++ b/_modules/networkx/algorithms/coloring/greedy_coloring.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.coloring.greedy_coloring — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.coloring.greedy_coloring — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/coloring/greedy_coloring';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/coloring/greedy_coloring.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"> @@ -659,7 +671,7 @@ <span class="c1"># Yield the source node, then all the nodes in the specified</span> <span class="c1"># traversal order.</span> <span class="k">yield</span> <span class="n">source</span> - <span class="k">for</span> <span class="p">(</span><span class="n">_</span><span class="p">,</span> <span class="n">end</span><span class="p">)</span> <span class="ow">in</span> <span class="n">traverse</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">subgraph</span><span class="p">(</span><span class="n">component</span><span class="p">),</span> <span class="n">source</span><span class="p">):</span> + <span class="k">for</span> <span class="n">_</span><span class="p">,</span> <span class="n">end</span> <span class="ow">in</span> <span class="n">traverse</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">subgraph</span><span class="p">(</span><span class="n">component</span><span class="p">),</span> <span class="n">source</span><span class="p">):</span> <span class="k">yield</span> <span class="n">end</span></div> @@ -695,7 +707,7 @@ <span class="k">for</span> <span class="n">v</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">distinct_colors</span><span class="p">[</span><span class="n">v</span><span class="p">]</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="mi">0</span><span class="p">)</span> - <span class="k">while</span> <span class="ow">not</span> <span class="nb">len</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="o">==</span> <span class="nb">len</span><span class="p">(</span><span class="n">colors</span><span class="p">):</span> + <span class="k">while</span> <span class="nb">len</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">colors</span><span class="p">):</span> <span class="c1"># Update the distinct color sets for the neighbors.</span> <span class="k">for</span> <span class="n">node</span><span class="p">,</span> <span class="n">color</span> <span class="ow">in</span> <span class="n">colors</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">G</span><span class="p">[</span><span class="n">node</span><span class="p">]:</span> @@ -933,7 +945,7 @@ <span class="n">graph</span> <span class="o">=</span> <span class="p">{</span><span class="n">node</span><span class="p">:</span> <span class="n">_Node</span><span class="p">(</span><span class="n">node</span><span class="p">,</span> <span class="n">n</span><span class="p">)</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">G</span><span class="p">}</span> - <span class="k">for</span> <span class="p">(</span><span class="n">node1</span><span class="p">,</span> <span class="n">node2</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">node1</span><span class="p">,</span> <span class="n">node2</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">adj_entry1</span> <span class="o">=</span> <span class="n">_AdjEntry</span><span class="p">(</span><span class="n">node2</span><span class="p">)</span> <span class="n">adj_entry2</span> <span class="o">=</span> <span class="n">_AdjEntry</span><span class="p">(</span><span class="n">node1</span><span class="p">)</span> <span class="n">adj_entry1</span><span class="o">.</span><span class="n">mate</span> <span class="o">=</span> <span class="n">adj_entry2</span> @@ -962,7 +974,7 @@ <span class="k">while</span> <span class="n">connected</span> <span class="ow">and</span> <span class="n">col1</span> <span class="o"><</span> <span class="n">k</span><span class="p">:</span> <span class="n">col1</span> <span class="o">+=</span> <span class="mi">1</span> <span class="n">neighbor_cols</span> <span class="o">=</span> <span class="n">graph</span><span class="p">[</span><span class="n">node</span><span class="p">]</span><span class="o">.</span><span class="n">iter_neighbors_color</span><span class="p">(</span><span class="n">col1</span><span class="p">)</span> - <span class="n">col1_adj</span> <span class="o">=</span> <span class="p">[</span><span class="n">it</span> <span class="k">for</span> <span class="n">it</span> <span class="ow">in</span> <span class="n">neighbor_cols</span><span class="p">]</span> + <span class="n">col1_adj</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">neighbor_cols</span><span class="p">)</span> <span class="n">col2</span> <span class="o">=</span> <span class="n">col1</span> <span class="k">while</span> <span class="n">connected</span> <span class="ow">and</span> <span class="n">col2</span> <span class="o"><</span> <span class="n">k</span><span class="p">:</span> @@ -1038,11 +1050,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/communicability_alg.html b/_modules/networkx/algorithms/communicability_alg.html index 1dfc1f31..07ead247 100644 --- a/_modules/networkx/algorithms/communicability_alg.html +++ b/_modules/networkx/algorithms/communicability_alg.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.communicability_alg — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.communicability_alg — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/communicability_alg';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/communicability_alg.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"> @@ -499,7 +511,7 @@ <span class="sd"> Communicability between all pairs of nodes in G using spectral</span> <span class="sd"> decomposition.</span> <span class="sd"> communicability_betweenness_centrality:</span> -<span class="sd"> Communicability betweeness centrality for each node in G.</span> +<span class="sd"> Communicability betweenness centrality for each node in G.</span> <span class="sd"> Notes</span> <span class="sd"> -----</span> @@ -579,7 +591,7 @@ <span class="sd"> communicability:</span> <span class="sd"> Communicability between pairs of nodes in G.</span> <span class="sd"> communicability_betweenness_centrality:</span> -<span class="sd"> Communicability betweeness centrality for each node in G.</span> +<span class="sd"> Communicability betweenness centrality for each node in G.</span> <span class="sd"> Notes</span> <span class="sd"> -----</span> @@ -636,11 +648,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/community/asyn_fluid.html b/_modules/networkx/algorithms/community/asyn_fluid.html index 20e96907..899a97f3 100644 --- a/_modules/networkx/algorithms/community/asyn_fluid.html +++ b/_modules/networkx/algorithms/community/asyn_fluid.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.community.asyn_fluid — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.community.asyn_fluid — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/community/asyn_fluid';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/community/asyn_fluid.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"> @@ -542,7 +554,7 @@ <span class="n">communities</span> <span class="o">=</span> <span class="p">{</span><span class="n">n</span><span class="p">:</span> <span class="n">i</span> <span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="n">n</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">vertices</span><span class="p">[:</span><span class="n">k</span><span class="p">])}</span> <span class="n">density</span> <span class="o">=</span> <span class="p">{}</span> <span class="n">com_to_numvertices</span> <span class="o">=</span> <span class="p">{}</span> - <span class="k">for</span> <span class="n">vertex</span> <span class="ow">in</span> <span class="n">communities</span><span class="o">.</span><span class="n">keys</span><span class="p">():</span> + <span class="k">for</span> <span class="n">vertex</span> <span class="ow">in</span> <span class="n">communities</span><span class="p">:</span> <span class="n">com_to_numvertices</span><span class="p">[</span><span class="n">communities</span><span class="p">[</span><span class="n">vertex</span><span class="p">]]</span> <span class="o">=</span> <span class="mi">1</span> <span class="n">density</span><span class="p">[</span><span class="n">communities</span><span class="p">[</span><span class="n">vertex</span><span class="p">]]</span> <span class="o">=</span> <span class="n">max_density</span> <span class="c1"># Set up control variables and start iterating</span> @@ -622,11 +634,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/community/centrality.html b/_modules/networkx/algorithms/community/centrality.html index 9b254f8f..38390274 100644 --- a/_modules/networkx/algorithms/community/centrality.html +++ b/_modules/networkx/algorithms/community/centrality.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.community.centrality — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.community.centrality — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/community/centrality';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/community/centrality.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"> @@ -645,11 +657,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/community/community_utils.html b/_modules/networkx/algorithms/community/community_utils.html index 6fd1f51c..6f8b6696 100644 --- a/_modules/networkx/algorithms/community/community_utils.html +++ b/_modules/networkx/algorithms/community/community_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.community.community_utils — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.community.community_utils — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/community/community_utils';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/community/community_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"> @@ -502,11 +514,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/community/kclique.html b/_modules/networkx/algorithms/community/kclique.html index 22546db6..85ae7f2b 100644 --- a/_modules/networkx/algorithms/community/kclique.html +++ b/_modules/networkx/algorithms/community/kclique.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.community.kclique — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.community.kclique — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/community/kclique';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/community/kclique.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"> @@ -554,11 +566,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/community/kernighan_lin.html b/_modules/networkx/algorithms/community/kernighan_lin.html index 19f3c947..1f5a62fe 100644 --- a/_modules/networkx/algorithms/community/kernighan_lin.html +++ b/_modules/networkx/algorithms/community/kernighan_lin.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.community.kernighan_lin — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.community.kernighan_lin — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/community/kernighan_lin';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/community/kernighan_lin.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"> @@ -612,11 +624,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/community/label_propagation.html b/_modules/networkx/algorithms/community/label_propagation.html index 31376342..ec65c8ac 100644 --- a/_modules/networkx/algorithms/community/label_propagation.html +++ b/_modules/networkx/algorithms/community/label_propagation.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.community.label_propagation — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.community.label_propagation — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/community/label_propagation';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/community/label_propagation.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"> @@ -532,7 +544,6 @@ <span class="n">seed</span><span class="o">.</span><span class="n">shuffle</span><span class="p">(</span><span class="n">nodes</span><span class="p">)</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">nodes</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="n">G</span><span class="p">[</span><span class="n">node</span><span class="p">]:</span> <span class="k">continue</span> @@ -618,7 +629,7 @@ <span class="sd"> Returns a dict keyed by color to a set of nodes with that color.</span> <span class="sd"> """</span> - <span class="n">coloring</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span> <span class="c1"># color => set(node)</span> + <span class="n">coloring</span> <span class="o">=</span> <span class="p">{}</span> <span class="c1"># color => set(node)</span> <span class="n">colors</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">coloring</span><span class="o">.</span><span class="n">greedy_color</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="k">for</span> <span class="n">node</span><span class="p">,</span> <span class="n">color</span> <span class="ow">in</span> <span class="n">colors</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> <span class="k">if</span> <span class="n">color</span> <span class="ow">in</span> <span class="n">coloring</span><span class="p">:</span> @@ -684,11 +695,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/community/louvain.html b/_modules/networkx/algorithms/community/louvain.html index 89674161..7b2225c3 100644 --- a/_modules/networkx/algorithms/community/louvain.html +++ b/_modules/networkx/algorithms/community/louvain.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.community.louvain — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.community.louvain — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/community/louvain';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/community/louvain.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"> @@ -588,7 +600,7 @@ <span class="sd"> A dendrogram is a diagram representing a tree and each level represents</span> <span class="sd"> a partition of the G graph. The top level contains the smallest communities</span> <span class="sd"> and as you traverse to the bottom of the tree the communities get bigger</span> -<span class="sd"> and the overal modularity increases making the partition better.</span> +<span class="sd"> and the overall modularity increases making the partition better.</span> <span class="sd"> Each level is generated by executing the two phases of the Louvain Community</span> <span class="sd"> Detection Algorithm.</span> @@ -681,8 +693,8 @@ <span class="k">if</span> <span class="n">is_directed</span><span class="p">:</span> <span class="n">in_degrees</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">in_degree</span><span class="p">(</span><span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">))</span> <span class="n">out_degrees</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">out_degree</span><span class="p">(</span><span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">))</span> - <span class="n">Stot_in</span> <span class="o">=</span> <span class="p">[</span><span class="n">deg</span> <span class="k">for</span> <span class="n">deg</span> <span class="ow">in</span> <span class="n">in_degrees</span><span class="o">.</span><span class="n">values</span><span class="p">()]</span> - <span class="n">Stot_out</span> <span class="o">=</span> <span class="p">[</span><span class="n">deg</span> <span class="k">for</span> <span class="n">deg</span> <span class="ow">in</span> <span class="n">out_degrees</span><span class="o">.</span><span class="n">values</span><span class="p">()]</span> + <span class="n">Stot_in</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">in_degrees</span><span class="o">.</span><span class="n">values</span><span class="p">())</span> + <span class="n">Stot_out</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">out_degrees</span><span class="o">.</span><span class="n">values</span><span class="p">())</span> <span class="c1"># Calculate weights for both in and out neighbours</span> <span class="n">nbrs</span> <span class="o">=</span> <span class="p">{}</span> <span class="k">for</span> <span class="n">u</span> <span class="ow">in</span> <span class="n">G</span><span class="p">:</span> @@ -693,7 +705,7 @@ <span class="n">nbrs</span><span class="p">[</span><span class="n">u</span><span class="p">][</span><span class="n">n</span><span class="p">]</span> <span class="o">+=</span> <span class="n">wt</span> <span class="k">else</span><span class="p">:</span> <span class="n">degrees</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">degree</span><span class="p">(</span><span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">))</span> - <span class="n">Stot</span> <span class="o">=</span> <span class="p">[</span><span class="n">deg</span> <span class="k">for</span> <span class="n">deg</span> <span class="ow">in</span> <span class="n">degrees</span><span class="o">.</span><span class="n">values</span><span class="p">()]</span> + <span class="n">Stot</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">degrees</span><span class="o">.</span><span class="n">values</span><span class="p">())</span> <span class="n">nbrs</span> <span class="o">=</span> <span class="p">{</span><span class="n">u</span><span class="p">:</span> <span class="p">{</span><span class="n">v</span><span class="p">:</span> <span class="n">data</span><span class="p">[</span><span class="s2">"weight"</span><span class="p">]</span> <span class="k">for</span> <span class="n">v</span><span class="p">,</span> <span class="n">data</span> <span class="ow">in</span> <span class="n">G</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">v</span> <span class="o">!=</span> <span class="n">u</span><span class="p">}</span> <span class="k">for</span> <span class="n">u</span> <span class="ow">in</span> <span class="n">G</span><span class="p">}</span> <span class="n">rand_nodes</span> <span class="o">=</span> <span class="nb">list</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="n">seed</span><span class="o">.</span><span class="n">shuffle</span><span class="p">(</span><span class="n">rand_nodes</span><span class="p">)</span> @@ -795,7 +807,7 @@ <span class="n">com1</span> <span class="o">=</span> <span class="n">node2com</span><span class="p">[</span><span class="n">node1</span><span class="p">]</span> <span class="n">com2</span> <span class="o">=</span> <span class="n">node2com</span><span class="p">[</span><span class="n">node2</span><span class="p">]</span> <span class="n">temp</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">com1</span><span class="p">,</span> <span class="n">com2</span><span class="p">,</span> <span class="p">{</span><span class="s2">"weight"</span><span class="p">:</span> <span class="mi">0</span><span class="p">})[</span><span class="s2">"weight"</span><span class="p">]</span> - <span class="n">H</span><span class="o">.</span><span class="n">add_edge</span><span class="p">(</span><span class="n">com1</span><span class="p">,</span> <span class="n">com2</span><span class="p">,</span> <span class="o">**</span><span class="p">{</span><span class="s2">"weight"</span><span class="p">:</span> <span class="n">wt</span> <span class="o">+</span> <span class="n">temp</span><span class="p">})</span> + <span class="n">H</span><span class="o">.</span><span class="n">add_edge</span><span class="p">(</span><span class="n">com1</span><span class="p">,</span> <span class="n">com2</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="n">wt</span> <span class="o">+</span> <span class="n">temp</span><span class="p">)</span> <span class="k">return</span> <span class="n">H</span> @@ -826,11 +838,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/community/lukes.html b/_modules/networkx/algorithms/community/lukes.html index a5912a24..5e3d74db 100644 --- a/_modules/networkx/algorithms/community/lukes.html +++ b/_modules/networkx/algorithms/community/lukes.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.community.lukes — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.community.lukes — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/community/lukes';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/community/lukes.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"> @@ -489,7 +501,6 @@ <div class="viewcode-block" id="lukes_partitioning"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.community.lukes.lukes_partitioning.html#networkx.algorithms.community.lukes.lukes_partitioning">[docs]</a><span class="k">def</span> <span class="nf">lukes_partitioning</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">max_size</span><span class="p">,</span> <span class="n">node_weight</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">edge_weight</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> - <span class="w"> </span><span class="sd">"""Optimal partitioning of a weighted tree using the Lukes algorithm.</span> <span class="sd"> This algorithm partitions a connected, acyclic graph featuring integer</span> @@ -610,7 +621,6 @@ <span class="k">return</span> <span class="n">ccx</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="k">def</span> <span class="nf">_concatenate_or_merge</span><span class="p">(</span><span class="n">partition_1</span><span class="p">,</span> <span class="n">partition_2</span><span class="p">,</span> <span class="n">x</span><span class="p">,</span> <span class="n">i</span><span class="p">,</span> <span class="n">ref_weigth</span><span class="p">):</span> - <span class="n">ccx</span> <span class="o">=</span> <span class="n">_pivot</span><span class="p">(</span><span class="n">partition_1</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="n">cci</span> <span class="o">=</span> <span class="n">_pivot</span><span class="p">(</span><span class="n">partition_2</span><span class="p">,</span> <span class="n">i</span><span class="p">)</span> <span class="n">merged_xi</span> <span class="o">=</span> <span class="n">ccx</span><span class="o">.</span><span class="n">union</span><span class="p">(</span><span class="n">cci</span><span class="p">)</span> @@ -630,13 +640,13 @@ <span class="c1"># INITIALIZATION -----------------------</span> <span class="n">leaves</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">_leaves</span><span class="p">(</span><span class="n">t_G</span><span class="p">))</span> <span class="k">for</span> <span class="n">lv</span> <span class="ow">in</span> <span class="n">leaves</span><span class="p">:</span> - <span class="n">t_G</span><span class="o">.</span><span class="n">nodes</span><span class="p">[</span><span class="n">lv</span><span class="p">][</span><span class="n">PKEY</span><span class="p">]</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span> + <span class="n">t_G</span><span class="o">.</span><span class="n">nodes</span><span class="p">[</span><span class="n">lv</span><span class="p">][</span><span class="n">PKEY</span><span class="p">]</span> <span class="o">=</span> <span class="p">{}</span> <span class="n">slot</span> <span class="o">=</span> <span class="n">safe_G</span><span class="o">.</span><span class="n">nodes</span><span class="p">[</span><span class="n">lv</span><span class="p">][</span><span class="n">node_weight</span><span class="p">]</span> <span class="n">t_G</span><span class="o">.</span><span class="n">nodes</span><span class="p">[</span><span class="n">lv</span><span class="p">][</span><span class="n">PKEY</span><span class="p">][</span><span class="n">slot</span><span class="p">]</span> <span class="o">=</span> <span class="p">[{</span><span class="n">lv</span><span class="p">}]</span> <span class="n">t_G</span><span class="o">.</span><span class="n">nodes</span><span class="p">[</span><span class="n">lv</span><span class="p">][</span><span class="n">PKEY</span><span class="p">][</span><span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="p">[{</span><span class="n">lv</span><span class="p">}]</span> <span class="k">for</span> <span class="n">inner</span> <span class="ow">in</span> <span class="p">[</span><span class="n">x</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">t_G</span><span class="o">.</span><span class="n">nodes</span> <span class="k">if</span> <span class="n">x</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">leaves</span><span class="p">]:</span> - <span class="n">t_G</span><span class="o">.</span><span class="n">nodes</span><span class="p">[</span><span class="n">inner</span><span class="p">][</span><span class="n">PKEY</span><span class="p">]</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span> + <span class="n">t_G</span><span class="o">.</span><span class="n">nodes</span><span class="p">[</span><span class="n">inner</span><span class="p">][</span><span class="n">PKEY</span><span class="p">]</span> <span class="o">=</span> <span class="p">{}</span> <span class="n">slot</span> <span class="o">=</span> <span class="n">safe_G</span><span class="o">.</span><span class="n">nodes</span><span class="p">[</span><span class="n">inner</span><span class="p">][</span><span class="n">node_weight</span><span class="p">]</span> <span class="n">t_G</span><span class="o">.</span><span class="n">nodes</span><span class="p">[</span><span class="n">inner</span><span class="p">][</span><span class="n">PKEY</span><span class="p">][</span><span class="n">slot</span><span class="p">]</span> <span class="o">=</span> <span class="p">[{</span><span class="n">inner</span><span class="p">}]</span> @@ -646,7 +656,7 @@ <span class="n">weight_of_x</span> <span class="o">=</span> <span class="n">safe_G</span><span class="o">.</span><span class="n">nodes</span><span class="p">[</span><span class="n">x_node</span><span class="p">][</span><span class="n">node_weight</span><span class="p">]</span> <span class="n">best_value</span> <span class="o">=</span> <span class="mi">0</span> <span class="n">best_partition</span> <span class="o">=</span> <span class="kc">None</span> - <span class="n">bp_buffer</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span> + <span class="n">bp_buffer</span> <span class="o">=</span> <span class="p">{}</span> <span class="n">x_descendants</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">descendants</span><span class="p">(</span><span class="n">t_G</span><span class="p">,</span> <span class="n">x_node</span><span class="p">)</span> <span class="k">for</span> <span class="n">i_node</span> <span class="ow">in</span> <span class="n">x_descendants</span><span class="p">:</span> <span class="k">for</span> <span class="n">j</span> <span class="ow">in</span> <span class="nb">range</span><span class="p">(</span><span class="n">weight_of_x</span><span class="p">,</span> <span class="n">max_size</span> <span class="o">+</span> <span class="mi">1</span><span class="p">):</span> @@ -702,11 +712,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/community/modularity_max.html b/_modules/networkx/algorithms/community/modularity_max.html index 5d49fa9a..24e38cb6 100644 --- a/_modules/networkx/algorithms/community/modularity_max.html +++ b/_modules/networkx/algorithms/community/modularity_max.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.community.modularity_max — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.community.modularity_max — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/community/modularity_max';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/community/modularity_max.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"> @@ -700,7 +712,7 @@ <span class="sd"> Greedy modularity maximization begins with each node in its own community</span> <span class="sd"> and repeatedly joins the pair of communities that lead to the largest</span> -<span class="sd"> modularity until no futher increase in modularity is possible (a maximum).</span> +<span class="sd"> modularity until no further increase in modularity is possible (a maximum).</span> <span class="sd"> Two keyword arguments adjust the stopping condition. `cutoff` is a lower</span> <span class="sd"> limit on the number of communities so you can stop the process before</span> <span class="sd"> reaching a maximum (used to save computation time). `best_n` is an upper</span> @@ -864,7 +876,7 @@ <span class="sd"> modularity</span> <span class="sd"> """</span> <span class="c1"># First create one community for each node</span> - <span class="n">communities</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="nb">frozenset</span><span class="p">([</span><span class="n">u</span><span class="p">])</span> <span class="k">for</span> <span class="n">u</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">nodes</span><span class="p">())</span> + <span class="n">communities</span> <span class="o">=</span> <span class="p">[</span><span class="nb">frozenset</span><span class="p">([</span><span class="n">u</span><span class="p">])</span> <span class="k">for</span> <span class="n">u</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">nodes</span><span class="p">()]</span> <span class="c1"># Track merges</span> <span class="n">merges</span> <span class="o">=</span> <span class="p">[]</span> <span class="c1"># Greedily merge communities until no improvement is possible</span> @@ -923,11 +935,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/community/quality.html b/_modules/networkx/algorithms/community/quality.html index 42b8008b..8f3e2cfb 100644 --- a/_modules/networkx/algorithms/community/quality.html +++ b/_modules/networkx/algorithms/community/quality.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.community.quality — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.community.quality — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/community/quality';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/community/quality.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"> @@ -656,7 +668,7 @@ <span class="sd"> Returns</span> <span class="sd"> -------</span> <span class="sd"> Q : float</span> -<span class="sd"> The modularity of the paritition.</span> +<span class="sd"> The modularity of the partition.</span> <span class="sd"> Raises</span> <span class="sd"> ------</span> @@ -817,11 +829,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/components/attracting.html b/_modules/networkx/algorithms/components/attracting.html index d994b60b..d28002e2 100644 --- a/_modules/networkx/algorithms/components/attracting.html +++ b/_modules/networkx/algorithms/components/attracting.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.components.attracting — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.components.attracting — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/components/attracting';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/components/attracting.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"> @@ -586,11 +598,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/components/biconnected.html b/_modules/networkx/algorithms/components/biconnected.html index 61be38ad..2cc460cb 100644 --- a/_modules/networkx/algorithms/components/biconnected.html +++ b/_modules/networkx/algorithms/components/biconnected.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.components.biconnected — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.components.biconnected — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/components/biconnected';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/components/biconnected.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"> @@ -863,11 +875,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/components/connected.html b/_modules/networkx/algorithms/components/connected.html index 59ae2a4d..57fb7690 100644 --- a/_modules/networkx/algorithms/components/connected.html +++ b/_modules/networkx/algorithms/components/connected.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.components.connected — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.components.connected — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/components/connected';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/components/connected.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"> @@ -676,11 +688,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/components/semiconnected.html b/_modules/networkx/algorithms/components/semiconnected.html index 8ceab779..c9200a41 100644 --- a/_modules/networkx/algorithms/components/semiconnected.html +++ b/_modules/networkx/algorithms/components/semiconnected.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.components.semiconnected — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.components.semiconnected — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/components/semiconnected';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/components/semiconnected.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"> @@ -539,11 +551,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/components/strongly_connected.html b/_modules/networkx/algorithms/components/strongly_connected.html index 1232f536..b5819c99 100644 --- a/_modules/networkx/algorithms/components/strongly_connected.html +++ b/_modules/networkx/algorithms/components/strongly_connected.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.components.strongly_connected — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.components.strongly_connected — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/components/strongly_connected';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/components/strongly_connected.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"> @@ -913,11 +925,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/components/weakly_connected.html b/_modules/networkx/algorithms/components/weakly_connected.html index 3e1b4d94..1a2a71c5 100644 --- a/_modules/networkx/algorithms/components/weakly_connected.html +++ b/_modules/networkx/algorithms/components/weakly_connected.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.components.weakly_connected — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.components.weakly_connected — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/components/weakly_connected';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/components/weakly_connected.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"> @@ -660,11 +672,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/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"> diff --git a/_modules/networkx/algorithms/core.html b/_modules/networkx/algorithms/core.html index 68607fce..744e681a 100644 --- a/_modules/networkx/algorithms/core.html +++ b/_modules/networkx/algorithms/core.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.core — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.core — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/core';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/core.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"> @@ -964,7 +976,7 @@ <span class="n">current_core</span> <span class="o">=</span> <span class="mi">1</span> <span class="n">current_layer</span> <span class="o">=</span> <span class="mi">1</span> <span class="c1"># Sets vertices of degree 0 to layer 1, if any.</span> - <span class="n">isolated_nodes</span> <span class="o">=</span> <span class="p">[</span><span class="n">v</span> <span class="k">for</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">nx</span><span class="o">.</span><span class="n">isolates</span><span class="p">(</span><span class="n">G</span><span class="p">)]</span> + <span class="n">isolated_nodes</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">nx</span><span class="o">.</span><span class="n">isolates</span><span class="p">(</span><span class="n">G</span><span class="p">))</span> <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">isolated_nodes</span><span class="p">)</span> <span class="o">></span> <span class="mi">0</span><span class="p">:</span> <span class="k">for</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">isolated_nodes</span><span class="p">:</span> <span class="n">od_layers</span><span class="p">[</span><span class="n">v</span><span class="p">]</span> <span class="o">=</span> <span class="n">current_layer</span> @@ -1009,11 +1021,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/covering.html b/_modules/networkx/algorithms/covering.html index e8efd5fe..30aef4ec 100644 --- a/_modules/networkx/algorithms/covering.html +++ b/_modules/networkx/algorithms/covering.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.covering — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.covering — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/covering';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/covering.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"> @@ -615,11 +627,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/cuts.html b/_modules/networkx/algorithms/cuts.html index 1dfbeef8..ab64bfd1 100644 --- a/_modules/networkx/algorithms/cuts.html +++ b/_modules/networkx/algorithms/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.cuts — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.cuts — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/cuts';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/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"> @@ -875,11 +887,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/cycles.html b/_modules/networkx/algorithms/cycles.html index 591aa56e..a645326c 100644 --- a/_modules/networkx/algorithms/cycles.html +++ b/_modules/networkx/algorithms/cycles.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.cycles — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.cycles — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/cycles';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/cycles.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"> @@ -732,6 +744,7 @@ <span class="sd"> --------</span> <span class="sd"> simple_cycles, cycle_basis</span> <span class="sd"> """</span> + <span class="c1"># Jon Olav Vik, 2010-08-09</span> <span class="k">def</span> <span class="nf">_unblock</span><span class="p">(</span><span class="n">thisnode</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Recursively unblock and remove nodes from B[thisnode]."""</span> @@ -992,7 +1005,7 @@ <span class="sd"> --------</span> <span class="sd"> simple_cycles, cycle_basis</span> <span class="sd"> """</span> - <span class="c1"># We first split the graph in commected subgraphs</span> + <span class="c1"># We first split the graph in connected subgraphs</span> <span class="k">return</span> <span class="nb">sum</span><span class="p">(</span> <span class="p">(</span><span class="n">_min_cycle_basis</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">subgraph</span><span class="p">(</span><span class="n">c</span><span class="p">),</span> <span class="n">weight</span><span class="p">)</span> <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="n">nx</span><span class="o">.</span><span class="n">connected_components</span><span class="p">(</span><span class="n">G</span><span class="p">)),</span> <span class="p">[],</span> @@ -1092,11 +1105,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/d_separation.html b/_modules/networkx/algorithms/d_separation.html index f95c23cb..f9120206 100644 --- a/_modules/networkx/algorithms/d_separation.html +++ b/_modules/networkx/algorithms/d_separation.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.d_separation — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.d_separation — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/d_separation';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/d_separation.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"> @@ -882,7 +894,7 @@ <span class="sd"> marked : set</span> <span class="sd"> A set of nodes that were marked.</span> <span class="sd"> """</span> - <span class="n">visited</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span> + <span class="n">visited</span> <span class="o">=</span> <span class="p">{}</span> <span class="n">marked</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span> <span class="n">queue</span> <span class="o">=</span> <span class="p">[]</span> @@ -916,11 +928,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/dag.html b/_modules/networkx/algorithms/dag.html index 6cf6ed34..2ae88154 100644 --- a/_modules/networkx/algorithms/dag.html +++ b/_modules/networkx/algorithms/dag.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.dag — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.dag — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/dag';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/dag.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"> @@ -1546,7 +1558,7 @@ <span class="n">i</span> <span class="o">=</span> <span class="nb">max</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">key</span><span class="o">=</span><span class="k">lambda</span> <span class="n">x</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">x</span><span class="p">]</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">weight</span><span class="p">,</span> <span class="n">default_weight</span><span class="p">))</span> <span class="n">path_length</span> <span class="o">+=</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">i</span><span class="p">]</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">weight</span><span class="p">,</span> <span class="n">default_weight</span><span class="p">)</span> <span class="k">else</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">pairwise</span><span class="p">(</span><span class="n">path</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">pairwise</span><span class="p">(</span><span class="n">path</span><span class="p">):</span> <span class="n">path_length</span> <span class="o">+=</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">get</span><span class="p">(</span><span class="n">weight</span><span class="p">,</span> <span class="n">default_weight</span><span class="p">)</span> <span class="k">return</span> <span class="n">path_length</span></div> @@ -1710,11 +1722,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/distance_measures.html b/_modules/networkx/algorithms/distance_measures.html index b67c0356..b720b931 100644 --- a/_modules/networkx/algorithms/distance_measures.html +++ b/_modules/networkx/algorithms/distance_measures.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.distance_measures — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.distance_measures — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/distance_measures';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/distance_measures.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"> @@ -1184,15 +1196,15 @@ <span class="k">if</span> <span class="n">invert_weight</span> <span class="ow">and</span> <span class="n">weight</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span> <span class="k">if</span> <span class="n">G</span><span class="o">.</span><span class="n">is_multigraph</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="n">k</span><span class="p">,</span> <span class="n">d</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="n">keys</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span> <span class="n">data</span><span class="o">=</span><span class="kc">True</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="p">,</span> <span class="n">k</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">edges</span><span class="p">(</span><span class="n">keys</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span> <span class="n">data</span><span class="o">=</span><span class="kc">True</span><span class="p">):</span> <span class="n">d</span><span class="p">[</span><span class="n">weight</span><span class="p">]</span> <span class="o">=</span> <span class="mi">1</span> <span class="o">/</span> <span class="n">d</span><span class="p">[</span><span class="n">weight</span><span class="p">]</span> <span class="k">else</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="n">d</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="n">data</span><span class="o">=</span><span class="kc">True</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="p">,</span> <span class="n">d</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">data</span><span class="o">=</span><span class="kc">True</span><span class="p">):</span> <span class="n">d</span><span class="p">[</span><span class="n">weight</span><span class="p">]</span> <span class="o">=</span> <span class="mi">1</span> <span class="o">/</span> <span class="n">d</span><span class="p">[</span><span class="n">weight</span><span class="p">]</span> <span class="c1"># Replace with collapsing topology or approximated zero?</span> <span class="c1"># Using determinants to compute the effective resistance is more memory</span> - <span class="c1"># efficent than directly calculating the psuedo-inverse</span> + <span class="c1"># efficient than directly calculating the psuedo-inverse</span> <span class="n">L</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">laplacian_matrix</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">node_list</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="o">.</span><span class="n">asformat</span><span class="p">(</span><span class="s2">"csc"</span><span class="p">)</span> <span class="n">indices</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="nb">range</span><span class="p">(</span><span class="n">L</span><span class="o">.</span><span class="n">shape</span><span class="p">[</span><span class="mi">0</span><span class="p">]))</span> <span class="c1"># w/ nodeA removed</span> @@ -1205,7 +1217,7 @@ <span class="c1"># Factorize Laplacian submatrixes and extract diagonals</span> <span class="c1"># Order the diagonals to minimize the likelihood over overflows</span> <span class="c1"># during computing the determinant</span> - <span class="n">lu_a</span> <span class="o">=</span> <span class="n">sp</span><span class="o">.</span><span class="n">sparse</span><span class="o">.</span><span class="n">linalg</span><span class="o">.</span><span class="n">splu</span><span class="p">(</span><span class="n">L_a</span><span class="p">,</span> <span class="n">options</span><span class="o">=</span><span class="nb">dict</span><span class="p">(</span><span class="n">SymmetricMode</span><span class="o">=</span><span class="kc">True</span><span class="p">))</span> + <span class="n">lu_a</span> <span class="o">=</span> <span class="n">sp</span><span class="o">.</span><span class="n">sparse</span><span class="o">.</span><span class="n">linalg</span><span class="o">.</span><span class="n">splu</span><span class="p">(</span><span class="n">L_a</span><span class="p">,</span> <span class="n">options</span><span class="o">=</span><span class="p">{</span><span class="s2">"SymmetricMode"</span><span class="p">:</span> <span class="kc">True</span><span class="p">})</span> <span class="n">LdiagA</span> <span class="o">=</span> <span class="n">lu_a</span><span class="o">.</span><span class="n">U</span><span class="o">.</span><span class="n">diagonal</span><span class="p">()</span> <span class="n">LdiagA_s</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">product</span><span class="p">(</span><span class="n">np</span><span class="o">.</span><span class="n">sign</span><span class="p">(</span><span class="n">LdiagA</span><span class="p">))</span> <span class="o">*</span> <span class="n">np</span><span class="o">.</span><span class="n">product</span><span class="p">(</span><span class="n">lu_a</span><span class="o">.</span><span class="n">L</span><span class="o">.</span><span class="n">diagonal</span><span class="p">())</span> <span class="n">LdiagA_s</span> <span class="o">*=</span> <span class="p">(</span><span class="o">-</span><span class="mi">1</span><span class="p">)</span> <span class="o">**</span> <span class="n">_count_lu_permutations</span><span class="p">(</span><span class="n">lu_a</span><span class="o">.</span><span class="n">perm_r</span><span class="p">)</span> @@ -1213,7 +1225,7 @@ <span class="n">LdiagA</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">absolute</span><span class="p">(</span><span class="n">LdiagA</span><span class="p">)</span> <span class="n">LdiagA</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">sort</span><span class="p">(</span><span class="n">LdiagA</span><span class="p">)</span> - <span class="n">lu_ab</span> <span class="o">=</span> <span class="n">sp</span><span class="o">.</span><span class="n">sparse</span><span class="o">.</span><span class="n">linalg</span><span class="o">.</span><span class="n">splu</span><span class="p">(</span><span class="n">L_ab</span><span class="p">,</span> <span class="n">options</span><span class="o">=</span><span class="nb">dict</span><span class="p">(</span><span class="n">SymmetricMode</span><span class="o">=</span><span class="kc">True</span><span class="p">))</span> + <span class="n">lu_ab</span> <span class="o">=</span> <span class="n">sp</span><span class="o">.</span><span class="n">sparse</span><span class="o">.</span><span class="n">linalg</span><span class="o">.</span><span class="n">splu</span><span class="p">(</span><span class="n">L_ab</span><span class="p">,</span> <span class="n">options</span><span class="o">=</span><span class="p">{</span><span class="s2">"SymmetricMode"</span><span class="p">:</span> <span class="kc">True</span><span class="p">})</span> <span class="n">LdiagAB</span> <span class="o">=</span> <span class="n">lu_ab</span><span class="o">.</span><span class="n">U</span><span class="o">.</span><span class="n">diagonal</span><span class="p">()</span> <span class="n">LdiagAB_s</span> <span class="o">=</span> <span class="n">np</span><span class="o">.</span><span class="n">product</span><span class="p">(</span><span class="n">np</span><span class="o">.</span><span class="n">sign</span><span class="p">(</span><span class="n">LdiagAB</span><span class="p">))</span> <span class="o">*</span> <span class="n">np</span><span class="o">.</span><span class="n">product</span><span class="p">(</span><span class="n">lu_ab</span><span class="o">.</span><span class="n">L</span><span class="o">.</span><span class="n">diagonal</span><span class="p">())</span> <span class="n">LdiagAB_s</span> <span class="o">*=</span> <span class="p">(</span><span class="o">-</span><span class="mi">1</span><span class="p">)</span> <span class="o">**</span> <span class="n">_count_lu_permutations</span><span class="p">(</span><span class="n">lu_ab</span><span class="o">.</span><span class="n">perm_r</span><span class="p">)</span> @@ -1240,11 +1252,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/distance_regular.html b/_modules/networkx/algorithms/distance_regular.html index d4909128..e9e66922 100644 --- a/_modules/networkx/algorithms/distance_regular.html +++ b/_modules/networkx/algorithms/distance_regular.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.distance_regular — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.distance_regular — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/distance_regular';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/distance_regular.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"> @@ -706,11 +718,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/dominance.html b/_modules/networkx/algorithms/dominance.html index 9085730b..cf295b95 100644 --- a/_modules/networkx/algorithms/dominance.html +++ b/_modules/networkx/algorithms/dominance.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.dominance — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.dominance — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/dominance';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/dominance.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"> @@ -608,11 +620,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/dominating.html b/_modules/networkx/algorithms/dominating.html index 123655a1..e31d68b6 100644 --- a/_modules/networkx/algorithms/dominating.html +++ b/_modules/networkx/algorithms/dominating.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.dominating — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.dominating — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/dominating';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/dominating.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"> @@ -568,11 +580,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/efficiency_measures.html b/_modules/networkx/algorithms/efficiency_measures.html index 652ce0b2..fb74eaf3 100644 --- a/_modules/networkx/algorithms/efficiency_measures.html +++ b/_modules/networkx/algorithms/efficiency_measures.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.efficiency_measures — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.efficiency_measures — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/efficiency_measures';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/efficiency_measures.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"> @@ -640,11 +652,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/euler.html b/_modules/networkx/algorithms/euler.html index 0afa0b74..3a935c9d 100644 --- a/_modules/networkx/algorithms/euler.html +++ b/_modules/networkx/algorithms/euler.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.euler — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.euler — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/euler';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/euler.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"> @@ -938,11 +950,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/flow/boykovkolmogorov.html b/_modules/networkx/algorithms/flow/boykovkolmogorov.html index f456aad0..fc8379b4 100644 --- a/_modules/networkx/algorithms/flow/boykovkolmogorov.html +++ b/_modules/networkx/algorithms/flow/boykovkolmogorov.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.flow.boykovkolmogorov — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.flow.boykovkolmogorov — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/flow/boykovkolmogorov';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/flow/boykovkolmogorov.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"> @@ -780,7 +792,7 @@ <span class="n">v</span> <span class="o">=</span> <span class="n">n</span> <span class="k">while</span> <span class="n">v</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span> <span class="n">path</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">v</span><span class="p">)</span> - <span class="k">if</span> <span class="n">v</span> <span class="o">==</span> <span class="n">s</span> <span class="ow">or</span> <span class="n">v</span> <span class="o">==</span> <span class="n">t</span><span class="p">:</span> + <span class="k">if</span> <span class="n">v</span> <span class="ow">in</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">base_dist</span> <span class="o">=</span> <span class="mi">0</span> <span class="k">break</span> <span class="k">elif</span> <span class="n">timestamp</span><span class="p">[</span><span class="n">v</span><span class="p">]</span> <span class="o">==</span> <span class="n">time</span><span class="p">:</span> @@ -842,11 +854,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/flow/capacityscaling.html b/_modules/networkx/algorithms/flow/capacityscaling.html index dbf60083..648c58ed 100644 --- a/_modules/networkx/algorithms/flow/capacityscaling.html +++ b/_modules/networkx/algorithms/flow/capacityscaling.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.flow.capacityscaling — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.flow.capacityscaling — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/flow/capacityscaling';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/flow/capacityscaling.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"> @@ -753,7 +765,7 @@ <span class="k">for</span> <span class="n">u</span><span class="p">,</span> <span class="n">v</span><span class="p">,</span> <span class="n">e</span> <span class="ow">in</span> <span class="n">nx</span><span class="o">.</span><span class="n">selfloop_edges</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">data</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span> <span class="p">)</span> - <span class="c1"># Determine the maxmimum edge capacity.</span> + <span class="c1"># Determine the maximum edge capacity.</span> <span class="n">wmax</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">chain</span><span class="p">([</span><span class="o">-</span><span class="n">inf</span><span class="p">],</span> <span class="p">(</span><span class="n">e</span><span class="p">[</span><span class="s2">"capacity"</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="p">,</span> <span class="n">e</span> <span class="ow">in</span> <span class="n">R</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">data</span><span class="o">=</span><span class="kc">True</span><span class="p">))))</span> <span class="k">if</span> <span class="n">wmax</span> <span class="o">==</span> <span class="o">-</span><span class="n">inf</span><span class="p">:</span> <span class="c1"># Residual network has no edges.</span> @@ -879,11 +891,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/flow/dinitz_alg.html b/_modules/networkx/algorithms/flow/dinitz_alg.html index 28f39557..8ef4f744 100644 --- a/_modules/networkx/algorithms/flow/dinitz_alg.html +++ b/_modules/networkx/algorithms/flow/dinitz_alg.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.flow.dinitz_alg — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.flow.dinitz_alg — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/flow/dinitz_alg';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/flow/dinitz_alg.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"> @@ -686,11 +698,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/flow/edmondskarp.html b/_modules/networkx/algorithms/flow/edmondskarp.html index 8c2ee927..f686d9f8 100644 --- a/_modules/networkx/algorithms/flow/edmondskarp.html +++ b/_modules/networkx/algorithms/flow/edmondskarp.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.flow.edmondskarp — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.flow.edmondskarp — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/flow/edmondskarp';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/flow/edmondskarp.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"> @@ -714,11 +726,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/flow/gomory_hu.html b/_modules/networkx/algorithms/flow/gomory_hu.html index 03d2775a..268e531d 100644 --- a/_modules/networkx/algorithms/flow/gomory_hu.html +++ b/_modules/networkx/algorithms/flow/gomory_hu.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.flow.gomory_hu — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.flow.gomory_hu — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/flow/gomory_hu';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/flow/gomory_hu.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"> @@ -651,11 +663,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/flow/maxflow.html b/_modules/networkx/algorithms/flow/maxflow.html index 7c1a0fdc..8dcc91ee 100644 --- a/_modules/networkx/algorithms/flow/maxflow.html +++ b/_modules/networkx/algorithms/flow/maxflow.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.flow.maxflow — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.flow.maxflow — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/flow/maxflow';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/flow/maxflow.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"> @@ -1078,11 +1090,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/flow/mincost.html b/_modules/networkx/algorithms/flow/mincost.html index 8bfc9daf..c57bf299 100644 --- a/_modules/networkx/algorithms/flow/mincost.html +++ b/_modules/networkx/algorithms/flow/mincost.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.flow.mincost — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.flow.mincost — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/flow/mincost';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/flow/mincost.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"> @@ -806,11 +818,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/flow/networksimplex.html b/_modules/networkx/algorithms/flow/networksimplex.html index e125a490..0fe5e2f3 100644 --- a/_modules/networkx/algorithms/flow/networksimplex.html +++ b/_modules/networkx/algorithms/flow/networksimplex.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.flow.networksimplex — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.flow.networksimplex — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/flow/networksimplex';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/flow/networksimplex.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"> @@ -478,7 +490,6 @@ <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span> <span class="bp">self</span><span class="p">,</span> <span class="n">G</span><span class="p">,</span> <span class="n">multigraph</span><span class="p">,</span> <span class="n">demand</span><span class="o">=</span><span class="s2">"demand"</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">weight</span><span class="o">=</span><span class="s2">"weight"</span> <span class="p">):</span> - <span class="c1"># Number all nodes and edges and hereafter reference them using ONLY their numbers</span> <span class="bp">self</span><span class="o">.</span><span class="n">node_list</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">G</span><span class="p">)</span> <span class="c1"># nodes</span> <span class="bp">self</span><span class="o">.</span><span class="n">node_indices</span> <span class="o">=</span> <span class="p">{</span><span class="n">u</span><span class="p">:</span> <span class="n">i</span> <span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="n">u</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">node_list</span><span class="p">)}</span> <span class="c1"># node indices</span> @@ -1139,11 +1150,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/flow/preflowpush.html b/_modules/networkx/algorithms/flow/preflowpush.html index eac762cc..12d6a9d6 100644 --- a/_modules/networkx/algorithms/flow/preflowpush.html +++ b/_modules/networkx/algorithms/flow/preflowpush.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.flow.preflowpush — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.flow.preflowpush — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/flow/preflowpush';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/flow/preflowpush.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"> @@ -898,11 +910,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/flow/shortestaugmentingpath.html b/_modules/networkx/algorithms/flow/shortestaugmentingpath.html index d66305e1..ab7822b6 100644 --- a/_modules/networkx/algorithms/flow/shortestaugmentingpath.html +++ b/_modules/networkx/algorithms/flow/shortestaugmentingpath.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.flow.shortestaugmentingpath — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.flow.shortestaugmentingpath — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/flow/shortestaugmentingpath';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/flow/shortestaugmentingpath.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"> @@ -773,11 +785,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/flow/utils.html b/_modules/networkx/algorithms/flow/utils.html index 5d37c97e..56d7f30e 100644 --- a/_modules/networkx/algorithms/flow/utils.html +++ b/_modules/networkx/algorithms/flow/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.flow.utils — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.flow.utils — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/flow/utils';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/flow/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"> @@ -656,11 +668,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/graph_hashing.html b/_modules/networkx/algorithms/graph_hashing.html index b94e024d..04740b3b 100644 --- a/_modules/networkx/algorithms/graph_hashing.html +++ b/_modules/networkx/algorithms/graph_hashing.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.graph_hashing — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.graph_hashing — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/graph_hashing';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/graph_hashing.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"> @@ -779,11 +791,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/graphical.html b/_modules/networkx/algorithms/graphical.html index b7fce3d7..f186a519 100644 --- a/_modules/networkx/algorithms/graphical.html +++ b/_modules/networkx/algorithms/graphical.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.graphical — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.graphical — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/graphical';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/graphical.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"> @@ -880,11 +892,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/hierarchy.html b/_modules/networkx/algorithms/hierarchy.html index 48a0787f..72be687c 100644 --- a/_modules/networkx/algorithms/hierarchy.html +++ b/_modules/networkx/algorithms/hierarchy.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.hierarchy — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.hierarchy — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/hierarchy';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/hierarchy.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"> @@ -522,11 +534,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/hybrid.html b/_modules/networkx/algorithms/hybrid.html index 71d62f62..882a5ed6 100644 --- a/_modules/networkx/algorithms/hybrid.html +++ b/_modules/networkx/algorithms/hybrid.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.hybrid — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.hybrid — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/hybrid';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/hybrid.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"> @@ -668,11 +680,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/isolate.html b/_modules/networkx/algorithms/isolate.html index 6df3744c..1060b46a 100644 --- a/_modules/networkx/algorithms/isolate.html +++ b/_modules/networkx/algorithms/isolate.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.isolate — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.isolate — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/isolate';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/isolate.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"> @@ -582,11 +594,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/isomorphism/ismags.html b/_modules/networkx/algorithms/isomorphism/ismags.html index 475e53d7..ce8cc55c 100644 --- a/_modules/networkx/algorithms/isomorphism/ismags.html +++ b/_modules/networkx/algorithms/isomorphism/ismags.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.isomorphism.ismags — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.isomorphism.ismags — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/isomorphism/ismags';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/isomorphism/ismags.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"> @@ -599,7 +611,7 @@ <span class="k">pass</span> <span class="k">else</span><span class="p">:</span> <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">shape</span><span class="p">)</span> <span class="o">></span> <span class="mi">1</span><span class="p">:</span> - <span class="n">message</span> <span class="o">=</span> <span class="s2">"The function does not works on multidimension arrays."</span> + <span class="n">message</span> <span class="o">=</span> <span class="s2">"The function does not works on multidimensional arrays."</span> <span class="k">raise</span> <span class="ne">NotImplementedError</span><span class="p">(</span><span class="n">message</span><span class="p">)</span> <span class="kn">from</span> <span class="bp">None</span> <span class="n">iterator</span> <span class="o">=</span> <span class="nb">iter</span><span class="p">(</span><span class="n">iterable</span><span class="p">)</span> @@ -659,7 +671,7 @@ <span class="sd"> -------</span> <span class="sd"> dict</span> <span class="sd"> """</span> - <span class="n">colors</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span> + <span class="n">colors</span> <span class="o">=</span> <span class="p">{}</span> <span class="k">for</span> <span class="n">color</span><span class="p">,</span> <span class="n">keys</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">partitions</span><span class="p">):</span> <span class="k">for</span> <span class="n">key</span> <span class="ow">in</span> <span class="n">keys</span><span class="p">:</span> <span class="n">colors</span><span class="p">[</span><span class="n">key</span><span class="p">]</span> <span class="o">=</span> <span class="n">color</span> @@ -689,7 +701,7 @@ <div class="viewcode-block" id="ISMAGS"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.isomorphism.ISMAGS.html#networkx.algorithms.isomorphism.ISMAGS">[docs]</a><span class="k">class</span> <span class="nc">ISMAGS</span><span class="p">:</span> <span class="w"> </span><span class="sd">"""</span> -<span class="sd"> Implements the ISMAGS subgraph matching algorith. [1]_ ISMAGS stands for</span> +<span class="sd"> Implements the ISMAGS subgraph matching algorithm. [1]_ ISMAGS stands for</span> <span class="sd"> "Index-based Subgraph Matching Algorithm with General Symmetries". As the</span> <span class="sd"> name implies, it is symmetry aware and will only generate non-symmetric</span> <span class="sd"> isomorphisms.</span> @@ -1050,7 +1062,7 @@ <span class="sd"> graph : networkx.Graph</span> <span class="sd"> The graph whose symmetry should be analyzed.</span> <span class="sd"> node_partitions : list of sets</span> -<span class="sd"> A list of sets containining node keys. Node keys in the same set</span> +<span class="sd"> A list of sets containing node keys. Node keys in the same set</span> <span class="sd"> are considered equivalent. Every node key in `graph` should be in</span> <span class="sd"> exactly one of the sets. If all nodes are equivalent, this should</span> <span class="sd"> be ``[set(graph.nodes)]``.</span> @@ -1183,7 +1195,7 @@ <span class="n">counts</span><span class="p">[</span><span class="n">node1</span><span class="p">][</span><span class="n">ecolor</span><span class="p">,</span> <span class="n">node_colors</span><span class="p">[</span><span class="n">node2</span><span class="p">]]</span> <span class="o">+=</span> <span class="mi">1</span> <span class="n">counts</span><span class="p">[</span><span class="n">node2</span><span class="p">][</span><span class="n">ecolor</span><span class="p">,</span> <span class="n">node_colors</span><span class="p">[</span><span class="n">node1</span><span class="p">]]</span> <span class="o">+=</span> <span class="mi">1</span> - <span class="n">node_edge_colors</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span> + <span class="n">node_edge_colors</span> <span class="o">=</span> <span class="p">{}</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">graph</span><span class="o">.</span><span class="n">nodes</span><span class="p">:</span> <span class="n">node_edge_colors</span><span class="p">[</span><span class="n">node</span><span class="p">]</span> <span class="o">=</span> <span class="n">node_colors</span><span class="p">[</span><span class="n">node</span><span class="p">],</span> <span class="nb">set</span><span class="p">(</span><span class="n">counts</span><span class="p">[</span><span class="n">node</span><span class="p">]</span><span class="o">.</span><span class="n">items</span><span class="p">())</span> @@ -1373,7 +1385,7 @@ <span class="c1"># "part of" the subgraph in to_be_mapped, and we make it a little</span> <span class="c1"># smaller every iteration.</span> - <span class="c1"># pylint disable becuase it's guarded against by default value</span> + <span class="c1"># pylint disable because it's guarded against by default value</span> <span class="n">current_size</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span> <span class="nb">next</span><span class="p">(</span><span class="nb">iter</span><span class="p">(</span><span class="n">to_be_mapped</span><span class="p">),</span> <span class="p">[])</span> <span class="p">)</span> <span class="c1"># pylint: disable=stop-iteration-return</span> @@ -1645,11 +1657,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/isomorphism/isomorph.html b/_modules/networkx/algorithms/isomorphism/isomorph.html index 10747814..c12c2a37 100644 --- a/_modules/networkx/algorithms/isomorphism/isomorph.html +++ b/_modules/networkx/algorithms/isomorphism/isomorph.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.isomorphism.isomorph — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.isomorphism.isomorph — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/isomorphism/isomorph';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/isomorphism/isomorph.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"> @@ -500,13 +512,15 @@ <span class="c1"># Check local properties</span> <span class="n">d1</span> <span class="o">=</span> <span class="n">G1</span><span class="o">.</span><span class="n">degree</span><span class="p">()</span> <span class="n">t1</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">triangles</span><span class="p">(</span><span class="n">G1</span><span class="p">)</span> - <span class="n">c1</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">number_of_cliques</span><span class="p">(</span><span class="n">G1</span><span class="p">)</span> + <span class="n">clqs_1</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">nx</span><span class="o">.</span><span class="n">find_cliques</span><span class="p">(</span><span class="n">G1</span><span class="p">))</span> + <span class="n">c1</span> <span class="o">=</span> <span class="p">{</span><span class="n">n</span><span class="p">:</span> <span class="nb">sum</span><span class="p">(</span><span class="mi">1</span> <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="n">clqs_1</span> <span class="k">if</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">c</span><span class="p">)</span> <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">}</span> <span class="c1"># number of cliques</span> <span class="n">props1</span> <span class="o">=</span> <span class="p">[[</span><span class="n">d</span><span class="p">,</span> <span class="n">t1</span><span class="p">[</span><span class="n">v</span><span class="p">],</span> <span class="n">c1</span><span class="p">[</span><span class="n">v</span><span class="p">]]</span> <span class="k">for</span> <span class="n">v</span><span class="p">,</span> <span class="n">d</span> <span class="ow">in</span> <span class="n">d1</span><span class="p">]</span> <span class="n">props1</span><span class="o">.</span><span class="n">sort</span><span class="p">()</span> <span class="n">d2</span> <span class="o">=</span> <span class="n">G2</span><span class="o">.</span><span class="n">degree</span><span class="p">()</span> <span class="n">t2</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">triangles</span><span class="p">(</span><span class="n">G2</span><span class="p">)</span> - <span class="n">c2</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">number_of_cliques</span><span class="p">(</span><span class="n">G2</span><span class="p">)</span> + <span class="n">clqs_2</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">nx</span><span class="o">.</span><span class="n">find_cliques</span><span class="p">(</span><span class="n">G2</span><span class="p">))</span> + <span class="n">c2</span> <span class="o">=</span> <span class="p">{</span><span class="n">n</span><span class="p">:</span> <span class="nb">sum</span><span class="p">(</span><span class="mi">1</span> <span class="k">for</span> <span class="n">c</span> <span class="ow">in</span> <span class="n">clqs_2</span> <span class="k">if</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">c</span><span class="p">)</span> <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">G2</span><span class="p">}</span> <span class="c1"># number of cliques</span> <span class="n">props2</span> <span class="o">=</span> <span class="p">[[</span><span class="n">d</span><span class="p">,</span> <span class="n">t2</span><span class="p">[</span><span class="n">v</span><span class="p">],</span> <span class="n">c2</span><span class="p">[</span><span class="n">v</span><span class="p">]]</span> <span class="k">for</span> <span class="n">v</span><span class="p">,</span> <span class="n">d</span> <span class="ow">in</span> <span class="n">d2</span><span class="p">]</span> <span class="n">props2</span><span class="o">.</span><span class="n">sort</span><span class="p">()</span> @@ -713,11 +727,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/isomorphism/isomorphvf2.html b/_modules/networkx/algorithms/isomorphism/isomorphvf2.html index 0166cdd5..a64cf4e7 100644 --- a/_modules/networkx/algorithms/isomorphism/isomorphvf2.html +++ b/_modules/networkx/algorithms/isomorphism/isomorphvf2.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.isomorphism.isomorphvf2 — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.isomorphism.isomorphvf2 — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/isomorphism/isomorphvf2';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/isomorphism/isomorphvf2.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"> @@ -579,7 +591,7 @@ <span class="sd"> Algorithm for Matching Large Graphs", 3rd IAPR-TC15 Workshop</span> <span class="sd"> on Graph-based Representations in Pattern Recognition, Cuen,</span> <span class="sd"> pp. 149-159, 2001.</span> -<span class="sd"> https://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.101.5342</span> +<span class="sd"> https://www.researchgate.net/publication/200034365_An_Improved_Algorithm_for_Matching_Large_Graphs</span> <span class="sd">See Also</span> <span class="sd">--------</span> @@ -910,7 +922,7 @@ <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">!=</span> <span class="s2">"mono"</span><span class="p">:</span> <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="p">[</span><span class="n">G1_node</span><span class="p">]:</span> <span class="k">if</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_1</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">core_1</span><span class="p">[</span><span class="n">neighbor</span><span class="p">]</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G2</span><span class="p">[</span><span class="n">G2_node</span><span class="p">]):</span> + <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_1</span><span class="p">[</span><span class="n">neighbor</span><span class="p">]</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G2</span><span class="p">[</span><span class="n">G2_node</span><span class="p">]:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">elif</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span> <span class="n">neighbor</span><span class="p">,</span> <span class="n">G1_node</span> @@ -919,7 +931,7 @@ <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G2</span><span class="p">[</span><span class="n">G2_node</span><span class="p">]:</span> <span class="k">if</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">[</span><span class="n">neighbor</span><span class="p">]</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="p">[</span><span class="n">G1_node</span><span class="p">]):</span> + <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">[</span><span class="n">neighbor</span><span class="p">]</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="p">[</span><span class="n">G1_node</span><span class="p">]:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">elif</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">==</span> <span class="s2">"mono"</span><span class="p">:</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span> @@ -947,7 +959,7 @@ <span class="k">if</span> <span class="p">(</span><span class="n">neighbor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">inout_2</span><span class="p">)</span> <span class="ow">and</span> <span class="p">(</span><span class="n">neighbor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">):</span> <span class="n">num2</span> <span class="o">+=</span> <span class="mi">1</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">==</span> <span class="s2">"graph"</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">==</span> <span class="n">num2</span><span class="p">):</span> + <span class="k">if</span> <span class="n">num1</span> <span class="o">!=</span> <span class="n">num2</span><span class="p">:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">else</span><span class="p">:</span> <span class="c1"># self.test == 'subgraph'</span> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">>=</span> <span class="n">num2</span><span class="p">):</span> @@ -969,7 +981,7 @@ <span class="k">if</span> <span class="n">neighbor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">inout_2</span><span class="p">:</span> <span class="n">num2</span> <span class="o">+=</span> <span class="mi">1</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">==</span> <span class="s2">"graph"</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">==</span> <span class="n">num2</span><span class="p">):</span> + <span class="k">if</span> <span class="n">num1</span> <span class="o">!=</span> <span class="n">num2</span><span class="p">:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">else</span><span class="p">:</span> <span class="c1"># self.test == 'subgraph'</span> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">>=</span> <span class="n">num2</span><span class="p">):</span> @@ -1135,7 +1147,7 @@ <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">!=</span> <span class="s2">"mono"</span><span class="p">:</span> <span class="k">for</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">G1_node</span><span class="p">]:</span> <span class="k">if</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_1</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">core_1</span><span class="p">[</span><span class="n">predecessor</span><span class="p">]</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G2</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">G2_node</span><span class="p">]):</span> + <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_1</span><span class="p">[</span><span class="n">predecessor</span><span class="p">]</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G2</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">G2_node</span><span class="p">]:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">elif</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span> <span class="n">predecessor</span><span class="p">,</span> <span class="n">G1_node</span> @@ -1144,7 +1156,7 @@ <span class="k">for</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G2</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">G2_node</span><span class="p">]:</span> <span class="k">if</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">[</span><span class="n">predecessor</span><span class="p">]</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">G1_node</span><span class="p">]):</span> + <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">[</span><span class="n">predecessor</span><span class="p">]</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">G1_node</span><span class="p">]:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">elif</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">==</span> <span class="s2">"mono"</span><span class="p">:</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span> @@ -1165,7 +1177,7 @@ <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">!=</span> <span class="s2">"mono"</span><span class="p">:</span> <span class="k">for</span> <span class="n">successor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="p">[</span><span class="n">G1_node</span><span class="p">]:</span> <span class="k">if</span> <span class="n">successor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_1</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">core_1</span><span class="p">[</span><span class="n">successor</span><span class="p">]</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G2</span><span class="p">[</span><span class="n">G2_node</span><span class="p">]):</span> + <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_1</span><span class="p">[</span><span class="n">successor</span><span class="p">]</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G2</span><span class="p">[</span><span class="n">G2_node</span><span class="p">]:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">elif</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span> <span class="n">G1_node</span><span class="p">,</span> <span class="n">successor</span> @@ -1174,7 +1186,7 @@ <span class="k">for</span> <span class="n">successor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G2</span><span class="p">[</span><span class="n">G2_node</span><span class="p">]:</span> <span class="k">if</span> <span class="n">successor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">[</span><span class="n">successor</span><span class="p">]</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="p">[</span><span class="n">G1_node</span><span class="p">]):</span> + <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">[</span><span class="n">successor</span><span class="p">]</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="p">[</span><span class="n">G1_node</span><span class="p">]:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">elif</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">==</span> <span class="s2">"mono"</span><span class="p">:</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span> @@ -1188,7 +1200,6 @@ <span class="k">return</span> <span class="kc">False</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">!=</span> <span class="s2">"mono"</span><span class="p">:</span> - <span class="c1"># Look ahead 1</span> <span class="c1"># R_termin</span> @@ -1203,7 +1214,7 @@ <span class="k">if</span> <span class="p">(</span><span class="n">predecessor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">in_2</span><span class="p">)</span> <span class="ow">and</span> <span class="p">(</span><span class="n">predecessor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">):</span> <span class="n">num2</span> <span class="o">+=</span> <span class="mi">1</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">==</span> <span class="s2">"graph"</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">==</span> <span class="n">num2</span><span class="p">):</span> + <span class="k">if</span> <span class="n">num1</span> <span class="o">!=</span> <span class="n">num2</span><span class="p">:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">else</span><span class="p">:</span> <span class="c1"># self.test == 'subgraph'</span> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">>=</span> <span class="n">num2</span><span class="p">):</span> @@ -1220,7 +1231,7 @@ <span class="k">if</span> <span class="p">(</span><span class="n">successor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">in_2</span><span class="p">)</span> <span class="ow">and</span> <span class="p">(</span><span class="n">successor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">):</span> <span class="n">num2</span> <span class="o">+=</span> <span class="mi">1</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">==</span> <span class="s2">"graph"</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">==</span> <span class="n">num2</span><span class="p">):</span> + <span class="k">if</span> <span class="n">num1</span> <span class="o">!=</span> <span class="n">num2</span><span class="p">:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">else</span><span class="p">:</span> <span class="c1"># self.test == 'subgraph'</span> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">>=</span> <span class="n">num2</span><span class="p">):</span> @@ -1239,7 +1250,7 @@ <span class="k">if</span> <span class="p">(</span><span class="n">predecessor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">out_2</span><span class="p">)</span> <span class="ow">and</span> <span class="p">(</span><span class="n">predecessor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">):</span> <span class="n">num2</span> <span class="o">+=</span> <span class="mi">1</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">==</span> <span class="s2">"graph"</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">==</span> <span class="n">num2</span><span class="p">):</span> + <span class="k">if</span> <span class="n">num1</span> <span class="o">!=</span> <span class="n">num2</span><span class="p">:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">else</span><span class="p">:</span> <span class="c1"># self.test == 'subgraph'</span> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">>=</span> <span class="n">num2</span><span class="p">):</span> @@ -1256,7 +1267,7 @@ <span class="k">if</span> <span class="p">(</span><span class="n">successor</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">out_2</span><span class="p">)</span> <span class="ow">and</span> <span class="p">(</span><span class="n">successor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">core_2</span><span class="p">):</span> <span class="n">num2</span> <span class="o">+=</span> <span class="mi">1</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">==</span> <span class="s2">"graph"</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">==</span> <span class="n">num2</span><span class="p">):</span> + <span class="k">if</span> <span class="n">num1</span> <span class="o">!=</span> <span class="n">num2</span><span class="p">:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">else</span><span class="p">:</span> <span class="c1"># self.test == 'subgraph'</span> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">>=</span> <span class="n">num2</span><span class="p">):</span> @@ -1278,7 +1289,7 @@ <span class="k">if</span> <span class="p">(</span><span class="n">predecessor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">in_2</span><span class="p">)</span> <span class="ow">and</span> <span class="p">(</span><span class="n">predecessor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">out_2</span><span class="p">):</span> <span class="n">num2</span> <span class="o">+=</span> <span class="mi">1</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">==</span> <span class="s2">"graph"</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">==</span> <span class="n">num2</span><span class="p">):</span> + <span class="k">if</span> <span class="n">num1</span> <span class="o">!=</span> <span class="n">num2</span><span class="p">:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">else</span><span class="p">:</span> <span class="c1"># self.test == 'subgraph'</span> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">>=</span> <span class="n">num2</span><span class="p">):</span> @@ -1296,7 +1307,7 @@ <span class="k">if</span> <span class="p">(</span><span class="n">successor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">in_2</span><span class="p">)</span> <span class="ow">and</span> <span class="p">(</span><span class="n">successor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="bp">self</span><span class="o">.</span><span class="n">out_2</span><span class="p">):</span> <span class="n">num2</span> <span class="o">+=</span> <span class="mi">1</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">test</span> <span class="o">==</span> <span class="s2">"graph"</span><span class="p">:</span> - <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">==</span> <span class="n">num2</span><span class="p">):</span> + <span class="k">if</span> <span class="n">num1</span> <span class="o">!=</span> <span class="n">num2</span><span class="p">:</span> <span class="k">return</span> <span class="kc">False</span> <span class="k">else</span><span class="p">:</span> <span class="c1"># self.test == 'subgraph'</span> <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">num1</span> <span class="o">>=</span> <span class="n">num2</span><span class="p">):</span> @@ -1536,11 +1547,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/isomorphism/matchhelpers.html b/_modules/networkx/algorithms/isomorphism/matchhelpers.html index dca838b0..3fa28587 100644 --- a/_modules/networkx/algorithms/isomorphism/matchhelpers.html +++ b/_modules/networkx/algorithms/isomorphism/matchhelpers.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.isomorphism.matchhelpers — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.isomorphism.matchhelpers — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/isomorphism/matchhelpers';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/isomorphism/matchhelpers.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"> @@ -500,10 +512,7 @@ <span class="sd"> """</span> <span class="c1"># assume finite weights, see numpy.allclose() for reference</span> - <span class="k">for</span> <span class="n">xi</span><span class="p">,</span> <span class="n">yi</span> <span class="ow">in</span> <span class="nb">zip</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="k">if</span> <span class="ow">not</span> <span class="n">math</span><span class="o">.</span><span class="n">isclose</span><span class="p">(</span><span class="n">xi</span><span class="p">,</span> <span class="n">yi</span><span class="p">,</span> <span class="n">rel_tol</span><span class="o">=</span><span class="n">rtol</span><span class="p">,</span> <span class="n">abs_tol</span><span class="o">=</span><span class="n">atol</span><span class="p">):</span> - <span class="k">return</span> <span class="kc">False</span> - <span class="k">return</span> <span class="kc">True</span> + <span class="k">return</span> <span class="nb">all</span><span class="p">(</span><span class="n">math</span><span class="o">.</span><span class="n">isclose</span><span class="p">(</span><span class="n">xi</span><span class="p">,</span> <span class="n">yi</span><span class="p">,</span> <span class="n">rel_tol</span><span class="o">=</span><span class="n">rtol</span><span class="p">,</span> <span class="n">abs_tol</span><span class="o">=</span><span class="n">atol</span><span class="p">)</span> <span class="k">for</span> <span class="n">xi</span><span class="p">,</span> <span class="n">yi</span> <span class="ow">in</span> <span class="nb">zip</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">categorical_doc</span> <span class="o">=</span> <span class="s2">"""</span> @@ -830,11 +839,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/isomorphism/tree_isomorphism.html b/_modules/networkx/algorithms/isomorphism/tree_isomorphism.html index bddf86ea..60d8ee17 100644 --- a/_modules/networkx/algorithms/isomorphism/tree_isomorphism.html +++ b/_modules/networkx/algorithms/isomorphism/tree_isomorphism.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.isomorphism.tree_isomorphism — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.isomorphism.tree_isomorphism — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/isomorphism/tree_isomorphism';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/isomorphism/tree_isomorphism.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"> @@ -537,7 +549,7 @@ <span class="k">def</span> <span class="nf">assign_levels</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">root</span><span class="p">):</span> <span class="n">level</span> <span class="o">=</span> <span class="p">{}</span> <span class="n">level</span><span class="p">[</span><span class="n">root</span><span class="p">]</span> <span class="o">=</span> <span class="mi">0</span> - <span class="k">for</span> <span class="p">(</span><span class="n">v1</span><span class="p">,</span> <span class="n">v2</span><span class="p">)</span> <span class="ow">in</span> <span class="n">nx</span><span class="o">.</span><span class="n">bfs_edges</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">root</span><span class="p">):</span> + <span class="k">for</span> <span class="n">v1</span><span class="p">,</span> <span class="n">v2</span> <span class="ow">in</span> <span class="n">nx</span><span class="o">.</span><span class="n">bfs_edges</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">root</span><span class="p">):</span> <span class="n">level</span><span class="p">[</span><span class="n">v2</span><span class="p">]</span> <span class="o">=</span> <span class="n">level</span><span class="p">[</span><span class="n">v1</span><span class="p">]</span> <span class="o">+</span> <span class="mi">1</span> <span class="k">return</span> <span class="n">level</span> @@ -546,7 +558,7 @@ <span class="c1"># now group the nodes at each level</span> <span class="k">def</span> <span class="nf">group_by_levels</span><span class="p">(</span><span class="n">levels</span><span class="p">):</span> <span class="n">L</span> <span class="o">=</span> <span class="p">{}</span> - <span class="k">for</span> <span class="p">(</span><span class="n">n</span><span class="p">,</span> <span class="n">lev</span><span class="p">)</span> <span class="ow">in</span> <span class="n">levels</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> + <span class="k">for</span> <span class="n">n</span><span class="p">,</span> <span class="n">lev</span> <span class="ow">in</span> <span class="n">levels</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> <span class="k">if</span> <span class="n">lev</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">L</span><span class="p">:</span> <span class="n">L</span><span class="p">[</span><span class="n">lev</span><span class="p">]</span> <span class="o">=</span> <span class="p">[]</span> <span class="n">L</span><span class="p">[</span><span class="n">lev</span><span class="p">]</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">n</span><span class="p">)</span> @@ -566,7 +578,7 @@ <div class="viewcode-block" id="rooted_tree_isomorphism"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.isomorphism.tree_isomorphism.rooted_tree_isomorphism.html#networkx.algorithms.isomorphism.tree_isomorphism.rooted_tree_isomorphism">[docs]</a><span class="k">def</span> <span class="nf">rooted_tree_isomorphism</span><span class="p">(</span><span class="n">t1</span><span class="p">,</span> <span class="n">root1</span><span class="p">,</span> <span class="n">t2</span><span class="p">,</span> <span class="n">root2</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""</span> <span class="sd"> Given two rooted trees `t1` and `t2`,</span> -<span class="sd"> with roots `root1` and `root2` respectivly</span> +<span class="sd"> with roots `root1` and `root2` respectively</span> <span class="sd"> this routine will determine if they are isomorphic.</span> <span class="sd"> These trees may be either directed or undirected,</span> @@ -649,7 +661,7 @@ <span class="n">forlabel</span> <span class="o">=</span> <span class="nb">sorted</span><span class="p">((</span><span class="n">ordered_labels</span><span class="p">[</span><span class="n">v</span><span class="p">],</span> <span class="n">v</span><span class="p">)</span> <span class="k">for</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">L</span><span class="p">[</span><span class="n">i</span><span class="p">])</span> <span class="c1"># now assign labels to these nodes, according to the sorted order</span> - <span class="c1"># starting from 0, where idential ordered_labels get the same label</span> + <span class="c1"># starting from 0, where identical ordered_labels get the same label</span> <span class="n">current</span> <span class="o">=</span> <span class="mi">0</span> <span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="p">(</span><span class="n">ol</span><span class="p">,</span> <span class="n">v</span><span class="p">)</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">forlabel</span><span class="p">):</span> <span class="c1"># advance to next label if not 0, and different from previous</span> @@ -754,11 +766,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/isomorphism/vf2pp.html b/_modules/networkx/algorithms/isomorphism/vf2pp.html index 8379e377..0179464d 100644 --- a/_modules/networkx/algorithms/isomorphism/vf2pp.html +++ b/_modules/networkx/algorithms/isomorphism/vf2pp.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.isomorphism.vf2pp — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.isomorphism.vf2pp — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/isomorphism/vf2pp';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/isomorphism/vf2pp.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"> @@ -466,7 +478,7 @@ <span class="sd">VF2++ Algorithm</span> <span class="sd">***************</span> -<span class="sd">An implementation of the VF2++ algorithm for Graph Isomorphism testing.</span> +<span class="sd">An implementation of the VF2++ algorithm [1]_ for Graph Isomorphism testing.</span> <span class="sd">The simplest interface to use this module is to call:</span> @@ -517,16 +529,17 @@ <span class="sd">>>> nx.vf2pp_isomorphism(G1, G2, node_label="label")</span> <span class="sd">{1: 1, 2: 2, 0: 0, 3: 3}</span> +<span class="sd">References</span> +<span class="sd">----------</span> +<span class="sd">.. [1] Jüttner, Alpár & Madarasi, Péter. (2018). "VF2++—An improved subgraph</span> +<span class="sd"> isomorphism algorithm". Discrete Applied Mathematics. 242.</span> +<span class="sd"> https://doi.org/10.1016/j.dam.2018.02.018</span> + <span class="sd">"""</span> <span class="kn">import</span> <span class="nn">collections</span> <span class="kn">import</span> <span class="nn">networkx</span> <span class="k">as</span> <span class="nn">nx</span> -<span class="kn">from</span> <span class="nn">.vf2pp_helpers.candidates</span> <span class="kn">import</span> <span class="n">_find_candidates</span><span class="p">,</span> <span class="n">_find_candidates_Di</span> -<span class="kn">from</span> <span class="nn">.vf2pp_helpers.feasibility</span> <span class="kn">import</span> <span class="n">_feasibility</span> -<span class="kn">from</span> <span class="nn">.vf2pp_helpers.node_ordering</span> <span class="kn">import</span> <span class="n">_matching_order</span> -<span class="kn">from</span> <span class="nn">.vf2pp_helpers.state</span> <span class="kn">import</span> <span class="n">_restore_Tinout</span><span class="p">,</span> <span class="n">_restore_Tinout_Di</span><span class="p">,</span> <span class="n">_update_Tinout</span> - <span class="n">__all__</span> <span class="o">=</span> <span class="p">[</span><span class="s2">"vf2pp_isomorphism"</span><span class="p">,</span> <span class="s2">"vf2pp_is_isomorphic"</span><span class="p">,</span> <span class="s2">"vf2pp_all_isomorphisms"</span><span class="p">]</span> <span class="n">_GraphParameters</span> <span class="o">=</span> <span class="n">collections</span><span class="o">.</span><span class="n">namedtuple</span><span class="p">(</span> @@ -806,8 +819,8 @@ <span class="n">T2_tilde</span><span class="p">,</span> <span class="n">T2_tilde_in</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">G2</span><span class="o">.</span><span class="n">nodes</span><span class="p">()),</span> <span class="nb">set</span><span class="p">()</span> <span class="n">state_params</span> <span class="o">=</span> <span class="n">_StateParameters</span><span class="p">(</span> - <span class="nb">dict</span><span class="p">(),</span> - <span class="nb">dict</span><span class="p">(),</span> + <span class="p">{},</span> + <span class="p">{},</span> <span class="n">T1</span><span class="p">,</span> <span class="n">T1_in</span><span class="p">,</span> <span class="n">T1_tilde</span><span class="p">,</span> @@ -819,6 +832,712 @@ <span class="p">)</span> <span class="k">return</span> <span class="n">graph_params</span><span class="p">,</span> <span class="n">state_params</span> + + +<span class="k">def</span> <span class="nf">_matching_order</span><span class="p">(</span><span class="n">graph_params</span><span class="p">):</span> +<span class="w"> </span><span class="sd">"""The node ordering as introduced in VF2++.</span> + +<span class="sd"> Notes</span> +<span class="sd"> -----</span> +<span class="sd"> Taking into account the structure of the Graph and the node labeling, the nodes are placed in an order such that,</span> +<span class="sd"> most of the unfruitful/infeasible branches of the search space can be pruned on high levels, significantly</span> +<span class="sd"> decreasing the number of visited states. The premise is that, the algorithm will be able to recognize</span> +<span class="sd"> inconsistencies early, proceeding to go deep into the search tree only if it's needed.</span> + +<span class="sd"> Parameters</span> +<span class="sd"> ----------</span> +<span class="sd"> graph_params: namedtuple</span> +<span class="sd"> Contains:</span> + +<span class="sd"> G1,G2: NetworkX Graph or MultiGraph instances.</span> +<span class="sd"> The two graphs to check for isomorphism or monomorphism.</span> + +<span class="sd"> G1_labels,G2_labels: dict</span> +<span class="sd"> The label of every node in G1 and G2 respectively.</span> + +<span class="sd"> Returns</span> +<span class="sd"> -------</span> +<span class="sd"> node_order: list</span> +<span class="sd"> The ordering of the nodes.</span> +<span class="sd"> """</span> + <span class="n">G1</span><span class="p">,</span> <span class="n">G2</span><span class="p">,</span> <span class="n">G1_labels</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">nodes_of_G2Labels</span><span class="p">,</span> <span class="n">_</span> <span class="o">=</span> <span class="n">graph_params</span> + <span class="k">if</span> <span class="ow">not</span> <span class="n">G1</span> <span class="ow">and</span> <span class="ow">not</span> <span class="n">G2</span><span class="p">:</span> + <span class="k">return</span> <span class="p">{}</span> + + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_directed</span><span class="p">():</span> + <span class="n">G1</span> <span class="o">=</span> <span class="n">G1</span><span class="o">.</span><span class="n">to_undirected</span><span class="p">(</span><span class="n">as_view</span><span class="o">=</span><span class="kc">True</span><span class="p">)</span> + + <span class="n">V1_unordered</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">G1</span><span class="o">.</span><span class="n">nodes</span><span class="p">())</span> + <span class="n">label_rarity</span> <span class="o">=</span> <span class="p">{</span><span class="n">label</span><span class="p">:</span> <span class="nb">len</span><span class="p">(</span><span class="n">nodes</span><span class="p">)</span> <span class="k">for</span> <span class="n">label</span><span class="p">,</span> <span class="n">nodes</span> <span class="ow">in</span> <span class="n">nodes_of_G2Labels</span><span class="o">.</span><span class="n">items</span><span class="p">()}</span> + <span class="n">used_degrees</span> <span class="o">=</span> <span class="p">{</span><span class="n">node</span><span class="p">:</span> <span class="mi">0</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">}</span> + <span class="n">node_order</span> <span class="o">=</span> <span class="p">[]</span> + + <span class="k">while</span> <span class="n">V1_unordered</span><span class="p">:</span> + <span class="n">max_rarity</span> <span class="o">=</span> <span class="nb">min</span><span class="p">(</span><span class="n">label_rarity</span><span class="p">[</span><span class="n">G1_labels</span><span class="p">[</span><span class="n">x</span><span class="p">]]</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">V1_unordered</span><span class="p">)</span> + <span class="n">rarest_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="ow">in</span> <span class="n">V1_unordered</span> <span class="k">if</span> <span class="n">label_rarity</span><span class="p">[</span><span class="n">G1_labels</span><span class="p">[</span><span class="n">n</span><span class="p">]]</span> <span class="o">==</span> <span class="n">max_rarity</span> + <span class="p">]</span> + <span class="n">max_node</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">rarest_nodes</span><span class="p">,</span> <span class="n">key</span><span class="o">=</span><span class="n">G1</span><span class="o">.</span><span class="n">degree</span><span class="p">)</span> + + <span class="k">for</span> <span class="n">dlevel_nodes</span> <span class="ow">in</span> <span class="n">nx</span><span class="o">.</span><span class="n">bfs_layers</span><span class="p">(</span><span class="n">G1</span><span class="p">,</span> <span class="n">max_node</span><span class="p">):</span> + <span class="n">nodes_to_add</span> <span class="o">=</span> <span class="n">dlevel_nodes</span><span class="o">.</span><span class="n">copy</span><span class="p">()</span> + <span class="k">while</span> <span class="n">nodes_to_add</span><span class="p">:</span> + <span class="n">max_used_degree</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">used_degrees</span><span class="p">[</span><span class="n">n</span><span class="p">]</span> <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">nodes_to_add</span><span class="p">)</span> + <span class="n">max_used_degree_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="ow">in</span> <span class="n">nodes_to_add</span> <span class="k">if</span> <span class="n">used_degrees</span><span class="p">[</span><span class="n">n</span><span class="p">]</span> <span class="o">==</span> <span class="n">max_used_degree</span> + <span class="p">]</span> + <span class="n">max_degree</span> <span class="o">=</span> <span class="nb">max</span><span class="p">(</span><span class="n">G1</span><span class="o">.</span><span class="n">degree</span><span class="p">[</span><span class="n">n</span><span class="p">]</span> <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">max_used_degree_nodes</span><span class="p">)</span> + <span class="n">max_degree_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="ow">in</span> <span class="n">max_used_degree_nodes</span> <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">degree</span><span class="p">[</span><span class="n">n</span><span class="p">]</span> <span class="o">==</span> <span class="n">max_degree</span> + <span class="p">]</span> + <span class="n">next_node</span> <span class="o">=</span> <span class="nb">min</span><span class="p">(</span> + <span class="n">max_degree_nodes</span><span class="p">,</span> <span class="n">key</span><span class="o">=</span><span class="k">lambda</span> <span class="n">x</span><span class="p">:</span> <span class="n">label_rarity</span><span class="p">[</span><span class="n">G1_labels</span><span class="p">[</span><span class="n">x</span><span class="p">]]</span> + <span class="p">)</span> + + <span class="n">node_order</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">next_node</span><span class="p">)</span> + <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">G1</span><span class="o">.</span><span class="n">neighbors</span><span class="p">(</span><span class="n">next_node</span><span class="p">):</span> + <span class="n">used_degrees</span><span class="p">[</span><span class="n">node</span><span class="p">]</span> <span class="o">+=</span> <span class="mi">1</span> + + <span class="n">nodes_to_add</span><span class="o">.</span><span class="n">remove</span><span class="p">(</span><span class="n">next_node</span><span class="p">)</span> + <span class="n">label_rarity</span><span class="p">[</span><span class="n">G1_labels</span><span class="p">[</span><span class="n">next_node</span><span class="p">]]</span> <span class="o">-=</span> <span class="mi">1</span> + <span class="n">V1_unordered</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">next_node</span><span class="p">)</span> + + <span class="k">return</span> <span class="n">node_order</span> + + +<span class="k">def</span> <span class="nf">_find_candidates</span><span class="p">(</span> + <span class="n">u</span><span class="p">,</span> <span class="n">graph_params</span><span class="p">,</span> <span class="n">state_params</span><span class="p">,</span> <span class="n">G1_degree</span> +<span class="p">):</span> <span class="c1"># todo: make the 4th argument the degree of u</span> +<span class="w"> </span><span class="sd">"""Given node u of G1, finds the candidates of u from G2.</span> + +<span class="sd"> Parameters</span> +<span class="sd"> ----------</span> +<span class="sd"> u: Graph node</span> +<span class="sd"> The node from G1 for which to find the candidates from G2.</span> + +<span class="sd"> graph_params: namedtuple</span> +<span class="sd"> Contains all the Graph-related parameters:</span> + +<span class="sd"> G1,G2: NetworkX Graph or MultiGraph instances.</span> +<span class="sd"> The two graphs to check for isomorphism or monomorphism</span> + +<span class="sd"> G1_labels,G2_labels: dict</span> +<span class="sd"> The label of every node in G1 and G2 respectively</span> + +<span class="sd"> state_params: namedtuple</span> +<span class="sd"> Contains all the State-related parameters:</span> + +<span class="sd"> mapping: dict</span> +<span class="sd"> The mapping as extended so far. Maps nodes of G1 to nodes of G2</span> + +<span class="sd"> reverse_mapping: dict</span> +<span class="sd"> The reverse mapping as extended so far. Maps nodes from G2 to nodes of G1. It's basically "mapping" reversed</span> + +<span class="sd"> T1, T2: set</span> +<span class="sd"> Ti contains uncovered neighbors of covered nodes from Gi, i.e. nodes that are not in the mapping, but are</span> +<span class="sd"> neighbors of nodes that are.</span> + +<span class="sd"> T1_tilde, T2_tilde: set</span> +<span class="sd"> Ti_tilde contains all the nodes from Gi, that are neither in the mapping nor in Ti</span> + +<span class="sd"> Returns</span> +<span class="sd"> -------</span> +<span class="sd"> candidates: set</span> +<span class="sd"> The nodes from G2 which are candidates for u.</span> +<span class="sd"> """</span> + <span class="n">G1</span><span class="p">,</span> <span class="n">G2</span><span class="p">,</span> <span class="n">G1_labels</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">nodes_of_G2Labels</span><span class="p">,</span> <span class="n">G2_nodes_of_degree</span> <span class="o">=</span> <span class="n">graph_params</span> + <span class="n">mapping</span><span class="p">,</span> <span class="n">reverse_mapping</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">T2_tilde</span><span class="p">,</span> <span class="n">_</span> <span class="o">=</span> <span class="n">state_params</span> + + <span class="n">covered_neighbors</span> <span class="o">=</span> <span class="p">[</span><span class="n">nbr</span> <span class="k">for</span> <span class="n">nbr</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">[</span><span class="n">u</span><span class="p">]</span> <span class="k">if</span> <span class="n">nbr</span> <span class="ow">in</span> <span class="n">mapping</span><span class="p">]</span> + <span class="k">if</span> <span class="ow">not</span> <span class="n">covered_neighbors</span><span class="p">:</span> + <span class="n">candidates</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">nodes_of_G2Labels</span><span class="p">[</span><span class="n">G1_labels</span><span class="p">[</span><span class="n">u</span><span class="p">]])</span> + <span class="n">candidates</span><span class="o">.</span><span class="n">intersection_update</span><span class="p">(</span><span class="n">G2_nodes_of_degree</span><span class="p">[</span><span class="n">G1_degree</span><span class="p">[</span><span class="n">u</span><span class="p">]])</span> + <span class="n">candidates</span><span class="o">.</span><span class="n">intersection_update</span><span class="p">(</span><span class="n">T2_tilde</span><span class="p">)</span> + <span class="n">candidates</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span><span class="n">reverse_mapping</span><span class="p">)</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_multigraph</span><span class="p">():</span> + <span class="n">candidates</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span> + <span class="p">{</span> + <span class="n">node</span> + <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">candidates</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">u</span><span class="p">,</span> <span class="n">u</span><span class="p">)</span> <span class="o">!=</span> <span class="n">G2</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">node</span><span class="p">,</span> <span class="n">node</span><span class="p">)</span> + <span class="p">}</span> + <span class="p">)</span> + <span class="k">return</span> <span class="n">candidates</span> + + <span class="n">nbr1</span> <span class="o">=</span> <span class="n">covered_neighbors</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> + <span class="n">common_nodes</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">G2</span><span class="p">[</span><span class="n">mapping</span><span class="p">[</span><span class="n">nbr1</span><span class="p">]])</span> + + <span class="k">for</span> <span class="n">nbr1</span> <span class="ow">in</span> <span class="n">covered_neighbors</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span> + <span class="n">common_nodes</span><span class="o">.</span><span class="n">intersection_update</span><span class="p">(</span><span class="n">G2</span><span class="p">[</span><span class="n">mapping</span><span class="p">[</span><span class="n">nbr1</span><span class="p">]])</span> + + <span class="n">common_nodes</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span><span class="n">reverse_mapping</span><span class="p">)</span> + <span class="n">common_nodes</span><span class="o">.</span><span class="n">intersection_update</span><span class="p">(</span><span class="n">G2_nodes_of_degree</span><span class="p">[</span><span class="n">G1_degree</span><span class="p">[</span><span class="n">u</span><span class="p">]])</span> + <span class="n">common_nodes</span><span class="o">.</span><span class="n">intersection_update</span><span class="p">(</span><span class="n">nodes_of_G2Labels</span><span class="p">[</span><span class="n">G1_labels</span><span class="p">[</span><span class="n">u</span><span class="p">]])</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_multigraph</span><span class="p">():</span> + <span class="n">common_nodes</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span> + <span class="p">{</span> + <span class="n">node</span> + <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">common_nodes</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">u</span><span class="p">,</span> <span class="n">u</span><span class="p">)</span> <span class="o">!=</span> <span class="n">G2</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">node</span><span class="p">,</span> <span class="n">node</span><span class="p">)</span> + <span class="p">}</span> + <span class="p">)</span> + <span class="k">return</span> <span class="n">common_nodes</span> + + +<span class="k">def</span> <span class="nf">_find_candidates_Di</span><span class="p">(</span><span class="n">u</span><span class="p">,</span> <span class="n">graph_params</span><span class="p">,</span> <span class="n">state_params</span><span class="p">,</span> <span class="n">G1_degree</span><span class="p">):</span> + <span class="n">G1</span><span class="p">,</span> <span class="n">G2</span><span class="p">,</span> <span class="n">G1_labels</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">nodes_of_G2Labels</span><span class="p">,</span> <span class="n">G2_nodes_of_degree</span> <span class="o">=</span> <span class="n">graph_params</span> + <span class="n">mapping</span><span class="p">,</span> <span class="n">reverse_mapping</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">T2_tilde</span><span class="p">,</span> <span class="n">_</span> <span class="o">=</span> <span class="n">state_params</span> + + <span class="n">covered_successors</span> <span class="o">=</span> <span class="p">[</span><span class="n">succ</span> <span class="k">for</span> <span class="n">succ</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">[</span><span class="n">u</span><span class="p">]</span> <span class="k">if</span> <span class="n">succ</span> <span class="ow">in</span> <span class="n">mapping</span><span class="p">]</span> + <span class="n">covered_predecessors</span> <span class="o">=</span> <span class="p">[</span><span class="n">pred</span> <span class="k">for</span> <span class="n">pred</span> <span class="ow">in</span> <span class="n">G1</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">u</span><span class="p">]</span> <span class="k">if</span> <span class="n">pred</span> <span class="ow">in</span> <span class="n">mapping</span><span class="p">]</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">covered_successors</span> <span class="ow">or</span> <span class="n">covered_predecessors</span><span class="p">):</span> + <span class="n">candidates</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">nodes_of_G2Labels</span><span class="p">[</span><span class="n">G1_labels</span><span class="p">[</span><span class="n">u</span><span class="p">]])</span> + <span class="n">candidates</span><span class="o">.</span><span class="n">intersection_update</span><span class="p">(</span><span class="n">G2_nodes_of_degree</span><span class="p">[</span><span class="n">G1_degree</span><span class="p">[</span><span class="n">u</span><span class="p">]])</span> + <span class="n">candidates</span><span class="o">.</span><span class="n">intersection_update</span><span class="p">(</span><span class="n">T2_tilde</span><span class="p">)</span> + <span class="n">candidates</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span><span class="n">reverse_mapping</span><span class="p">)</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_multigraph</span><span class="p">():</span> + <span class="n">candidates</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span> + <span class="p">{</span> + <span class="n">node</span> + <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">candidates</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">u</span><span class="p">,</span> <span class="n">u</span><span class="p">)</span> <span class="o">!=</span> <span class="n">G2</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">node</span><span class="p">,</span> <span class="n">node</span><span class="p">)</span> + <span class="p">}</span> + <span class="p">)</span> + <span class="k">return</span> <span class="n">candidates</span> + + <span class="k">if</span> <span class="n">covered_successors</span><span class="p">:</span> + <span class="n">succ1</span> <span class="o">=</span> <span class="n">covered_successors</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> + <span class="n">common_nodes</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">G2</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">mapping</span><span class="p">[</span><span class="n">succ1</span><span class="p">]])</span> + + <span class="k">for</span> <span class="n">succ1</span> <span class="ow">in</span> <span class="n">covered_successors</span><span class="p">[</span><span class="mi">1</span><span class="p">:]:</span> + <span class="n">common_nodes</span><span class="o">.</span><span class="n">intersection_update</span><span class="p">(</span><span class="n">G2</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">mapping</span><span class="p">[</span><span class="n">succ1</span><span class="p">]])</span> + <span class="k">else</span><span class="p">:</span> + <span class="n">pred1</span> <span class="o">=</span> <span class="n">covered_predecessors</span><span class="o">.</span><span class="n">pop</span><span class="p">()</span> + <span class="n">common_nodes</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">G2</span><span class="p">[</span><span class="n">mapping</span><span class="p">[</span><span class="n">pred1</span><span class="p">]])</span> + + <span class="k">for</span> <span class="n">pred1</span> <span class="ow">in</span> <span class="n">covered_predecessors</span><span class="p">:</span> + <span class="n">common_nodes</span><span class="o">.</span><span class="n">intersection_update</span><span class="p">(</span><span class="n">G2</span><span class="p">[</span><span class="n">mapping</span><span class="p">[</span><span class="n">pred1</span><span class="p">]])</span> + + <span class="n">common_nodes</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span><span class="n">reverse_mapping</span><span class="p">)</span> + <span class="n">common_nodes</span><span class="o">.</span><span class="n">intersection_update</span><span class="p">(</span><span class="n">G2_nodes_of_degree</span><span class="p">[</span><span class="n">G1_degree</span><span class="p">[</span><span class="n">u</span><span class="p">]])</span> + <span class="n">common_nodes</span><span class="o">.</span><span class="n">intersection_update</span><span class="p">(</span><span class="n">nodes_of_G2Labels</span><span class="p">[</span><span class="n">G1_labels</span><span class="p">[</span><span class="n">u</span><span class="p">]])</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_multigraph</span><span class="p">():</span> + <span class="n">common_nodes</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span> + <span class="p">{</span> + <span class="n">node</span> + <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">common_nodes</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">u</span><span class="p">,</span> <span class="n">u</span><span class="p">)</span> <span class="o">!=</span> <span class="n">G2</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">node</span><span class="p">,</span> <span class="n">node</span><span class="p">)</span> + <span class="p">}</span> + <span class="p">)</span> + <span class="k">return</span> <span class="n">common_nodes</span> + + +<span class="k">def</span> <span class="nf">_feasibility</span><span class="p">(</span><span class="n">node1</span><span class="p">,</span> <span class="n">node2</span><span class="p">,</span> <span class="n">graph_params</span><span class="p">,</span> <span class="n">state_params</span><span class="p">):</span> +<span class="w"> </span><span class="sd">"""Given a candidate pair of nodes u and v from G1 and G2 respectively, checks if it's feasible to extend the</span> +<span class="sd"> mapping, i.e. if u and v can be matched.</span> + +<span class="sd"> Notes</span> +<span class="sd"> -----</span> +<span class="sd"> This function performs all the necessary checking by applying both consistency and cutting rules.</span> + +<span class="sd"> Parameters</span> +<span class="sd"> ----------</span> +<span class="sd"> node1, node2: Graph node</span> +<span class="sd"> The candidate pair of nodes being checked for matching</span> + +<span class="sd"> graph_params: namedtuple</span> +<span class="sd"> Contains all the Graph-related parameters:</span> + +<span class="sd"> G1,G2: NetworkX Graph or MultiGraph instances.</span> +<span class="sd"> The two graphs to check for isomorphism or monomorphism</span> + +<span class="sd"> G1_labels,G2_labels: dict</span> +<span class="sd"> The label of every node in G1 and G2 respectively</span> + +<span class="sd"> state_params: namedtuple</span> +<span class="sd"> Contains all the State-related parameters:</span> + +<span class="sd"> mapping: dict</span> +<span class="sd"> The mapping as extended so far. Maps nodes of G1 to nodes of G2</span> + +<span class="sd"> reverse_mapping: dict</span> +<span class="sd"> The reverse mapping as extended so far. Maps nodes from G2 to nodes of G1. It's basically "mapping" reversed</span> + +<span class="sd"> T1, T2: set</span> +<span class="sd"> Ti contains uncovered neighbors of covered nodes from Gi, i.e. nodes that are not in the mapping, but are</span> +<span class="sd"> neighbors of nodes that are.</span> + +<span class="sd"> T1_out, T2_out: set</span> +<span class="sd"> Ti_out contains all the nodes from Gi, that are neither in the mapping nor in Ti</span> + +<span class="sd"> Returns</span> +<span class="sd"> -------</span> +<span class="sd"> True if all checks are successful, False otherwise.</span> +<span class="sd"> """</span> + <span class="n">G1</span> <span class="o">=</span> <span class="n">graph_params</span><span class="o">.</span><span class="n">G1</span> + + <span class="k">if</span> <span class="n">_cut_PT</span><span class="p">(</span><span class="n">node1</span><span class="p">,</span> <span class="n">node2</span><span class="p">,</span> <span class="n">graph_params</span><span class="p">,</span> <span class="n">state_params</span><span class="p">):</span> + <span class="k">return</span> <span class="kc">False</span> + + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_multigraph</span><span class="p">():</span> + <span class="k">if</span> <span class="ow">not</span> <span class="n">_consistent_PT</span><span class="p">(</span><span class="n">node1</span><span class="p">,</span> <span class="n">node2</span><span class="p">,</span> <span class="n">graph_params</span><span class="p">,</span> <span class="n">state_params</span><span class="p">):</span> + <span class="k">return</span> <span class="kc">False</span> + + <span class="k">return</span> <span class="kc">True</span> + + +<span class="k">def</span> <span class="nf">_cut_PT</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">graph_params</span><span class="p">,</span> <span class="n">state_params</span><span class="p">):</span> +<span class="w"> </span><span class="sd">"""Implements the cutting rules for the ISO problem.</span> + +<span class="sd"> Parameters</span> +<span class="sd"> ----------</span> +<span class="sd"> u, v: Graph node</span> +<span class="sd"> The two candidate nodes being examined.</span> + +<span class="sd"> graph_params: namedtuple</span> +<span class="sd"> Contains all the Graph-related parameters:</span> + +<span class="sd"> G1,G2: NetworkX Graph or MultiGraph instances.</span> +<span class="sd"> The two graphs to check for isomorphism or monomorphism</span> + +<span class="sd"> G1_labels,G2_labels: dict</span> +<span class="sd"> The label of every node in G1 and G2 respectively</span> + +<span class="sd"> state_params: namedtuple</span> +<span class="sd"> Contains all the State-related parameters:</span> + +<span class="sd"> mapping: dict</span> +<span class="sd"> The mapping as extended so far. Maps nodes of G1 to nodes of G2</span> + +<span class="sd"> reverse_mapping: dict</span> +<span class="sd"> The reverse mapping as extended so far. Maps nodes from G2 to nodes of G1. It's basically "mapping" reversed</span> + +<span class="sd"> T1, T2: set</span> +<span class="sd"> Ti contains uncovered neighbors of covered nodes from Gi, i.e. nodes that are not in the mapping, but are</span> +<span class="sd"> neighbors of nodes that are.</span> + +<span class="sd"> T1_tilde, T2_tilde: set</span> +<span class="sd"> Ti_out contains all the nodes from Gi, that are neither in the mapping nor in Ti</span> + +<span class="sd"> Returns</span> +<span class="sd"> -------</span> +<span class="sd"> True if we should prune this branch, i.e. the node pair failed the cutting checks. False otherwise.</span> +<span class="sd"> """</span> + <span class="n">G1</span><span class="p">,</span> <span class="n">G2</span><span class="p">,</span> <span class="n">G1_labels</span><span class="p">,</span> <span class="n">G2_labels</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span> <span class="o">=</span> <span class="n">graph_params</span> + <span class="p">(</span> + <span class="n">_</span><span class="p">,</span> + <span class="n">_</span><span class="p">,</span> + <span class="n">T1</span><span class="p">,</span> + <span class="n">T1_in</span><span class="p">,</span> + <span class="n">T1_tilde</span><span class="p">,</span> + <span class="n">_</span><span class="p">,</span> + <span class="n">T2</span><span class="p">,</span> + <span class="n">T2_in</span><span class="p">,</span> + <span class="n">T2_tilde</span><span class="p">,</span> + <span class="n">_</span><span class="p">,</span> + <span class="p">)</span> <span class="o">=</span> <span class="n">state_params</span> + + <span class="n">u_labels_predecessors</span><span class="p">,</span> <span class="n">v_labels_predecessors</span> <span class="o">=</span> <span class="p">{},</span> <span class="p">{}</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_directed</span><span class="p">():</span> + <span class="n">u_labels_predecessors</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">utils</span><span class="o">.</span><span class="n">groups</span><span class="p">(</span> + <span class="p">{</span><span class="n">n1</span><span class="p">:</span> <span class="n">G1_labels</span><span class="p">[</span><span class="n">n1</span><span class="p">]</span> <span class="k">for</span> <span class="n">n1</span> <span class="ow">in</span> <span class="n">G1</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">u</span><span class="p">]}</span> + <span class="p">)</span> + <span class="n">v_labels_predecessors</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">utils</span><span class="o">.</span><span class="n">groups</span><span class="p">(</span> + <span class="p">{</span><span class="n">n2</span><span class="p">:</span> <span class="n">G2_labels</span><span class="p">[</span><span class="n">n2</span><span class="p">]</span> <span class="k">for</span> <span class="n">n2</span> <span class="ow">in</span> <span class="n">G2</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">v</span><span class="p">]}</span> + <span class="p">)</span> + + <span class="k">if</span> <span class="nb">set</span><span class="p">(</span><span class="n">u_labels_predecessors</span><span class="o">.</span><span class="n">keys</span><span class="p">())</span> <span class="o">!=</span> <span class="nb">set</span><span class="p">(</span><span class="n">v_labels_predecessors</span><span class="o">.</span><span class="n">keys</span><span class="p">()):</span> + <span class="k">return</span> <span class="kc">True</span> + + <span class="n">u_labels_successors</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">utils</span><span class="o">.</span><span class="n">groups</span><span class="p">({</span><span class="n">n1</span><span class="p">:</span> <span class="n">G1_labels</span><span class="p">[</span><span class="n">n1</span><span class="p">]</span> <span class="k">for</span> <span class="n">n1</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">[</span><span class="n">u</span><span class="p">]})</span> + <span class="n">v_labels_successors</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">utils</span><span class="o">.</span><span class="n">groups</span><span class="p">({</span><span class="n">n2</span><span class="p">:</span> <span class="n">G2_labels</span><span class="p">[</span><span class="n">n2</span><span class="p">]</span> <span class="k">for</span> <span class="n">n2</span> <span class="ow">in</span> <span class="n">G2</span><span class="p">[</span><span class="n">v</span><span class="p">]})</span> + + <span class="c1"># if the neighbors of u, do not have the same labels as those of v, NOT feasible.</span> + <span class="k">if</span> <span class="nb">set</span><span class="p">(</span><span class="n">u_labels_successors</span><span class="o">.</span><span class="n">keys</span><span class="p">())</span> <span class="o">!=</span> <span class="nb">set</span><span class="p">(</span><span class="n">v_labels_successors</span><span class="o">.</span><span class="n">keys</span><span class="p">()):</span> + <span class="k">return</span> <span class="kc">True</span> + + <span class="k">for</span> <span class="n">label</span><span class="p">,</span> <span class="n">G1_nbh</span> <span class="ow">in</span> <span class="n">u_labels_successors</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> + <span class="n">G2_nbh</span> <span class="o">=</span> <span class="n">v_labels_successors</span><span class="p">[</span><span class="n">label</span><span class="p">]</span> + + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_multigraph</span><span class="p">():</span> + <span class="c1"># Check for every neighbor in the neighborhood, if u-nbr1 has same edges as v-nbr2</span> + <span class="n">u_nbrs_edges</span> <span class="o">=</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">u</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">G1_nbh</span><span class="p">)</span> + <span class="n">v_nbrs_edges</span> <span class="o">=</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">G2</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">v</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">G2_nbh</span><span class="p">)</span> + <span class="k">if</span> <span class="nb">any</span><span class="p">(</span> + <span class="n">u_nbr_edges</span> <span class="o">!=</span> <span class="n">v_nbr_edges</span> + <span class="k">for</span> <span class="n">u_nbr_edges</span><span class="p">,</span> <span class="n">v_nbr_edges</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="n">u_nbrs_edges</span><span class="p">,</span> <span class="n">v_nbrs_edges</span><span class="p">)</span> + <span class="p">):</span> + <span class="k">return</span> <span class="kc">True</span> + + <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">T1</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G1_nbh</span><span class="p">))</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">T2</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G2_nbh</span><span class="p">)):</span> + <span class="k">return</span> <span class="kc">True</span> + <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">T1_tilde</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G1_nbh</span><span class="p">))</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">T2_tilde</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G2_nbh</span><span class="p">)):</span> + <span class="k">return</span> <span class="kc">True</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_directed</span><span class="p">()</span> <span class="ow">and</span> <span class="nb">len</span><span class="p">(</span><span class="n">T1_in</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G1_nbh</span><span class="p">))</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span> + <span class="n">T2_in</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G2_nbh</span><span class="p">)</span> + <span class="p">):</span> + <span class="k">return</span> <span class="kc">True</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_directed</span><span class="p">():</span> + <span class="k">return</span> <span class="kc">False</span> + + <span class="k">for</span> <span class="n">label</span><span class="p">,</span> <span class="n">G1_pred</span> <span class="ow">in</span> <span class="n">u_labels_predecessors</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> + <span class="n">G2_pred</span> <span class="o">=</span> <span class="n">v_labels_predecessors</span><span class="p">[</span><span class="n">label</span><span class="p">]</span> + + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_multigraph</span><span class="p">():</span> + <span class="c1"># Check for every neighbor in the neighborhood, if u-nbr1 has same edges as v-nbr2</span> + <span class="n">u_pred_edges</span> <span class="o">=</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">u</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">G1_pred</span><span class="p">)</span> + <span class="n">v_pred_edges</span> <span class="o">=</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">G2</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">v</span><span class="p">,</span> <span class="n">x</span><span class="p">)</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">G2_pred</span><span class="p">)</span> + <span class="k">if</span> <span class="nb">any</span><span class="p">(</span> + <span class="n">u_nbr_edges</span> <span class="o">!=</span> <span class="n">v_nbr_edges</span> + <span class="k">for</span> <span class="n">u_nbr_edges</span><span class="p">,</span> <span class="n">v_nbr_edges</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="n">u_pred_edges</span><span class="p">,</span> <span class="n">v_pred_edges</span><span class="p">)</span> + <span class="p">):</span> + <span class="k">return</span> <span class="kc">True</span> + + <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">T1</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G1_pred</span><span class="p">))</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">T2</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G2_pred</span><span class="p">)):</span> + <span class="k">return</span> <span class="kc">True</span> + <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">T1_tilde</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G1_pred</span><span class="p">))</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">T2_tilde</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G2_pred</span><span class="p">)):</span> + <span class="k">return</span> <span class="kc">True</span> + <span class="k">if</span> <span class="nb">len</span><span class="p">(</span><span class="n">T1_in</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G1_pred</span><span class="p">))</span> <span class="o">!=</span> <span class="nb">len</span><span class="p">(</span><span class="n">T2_in</span><span class="o">.</span><span class="n">intersection</span><span class="p">(</span><span class="n">G2_pred</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">def</span> <span class="nf">_consistent_PT</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">graph_params</span><span class="p">,</span> <span class="n">state_params</span><span class="p">):</span> +<span class="w"> </span><span class="sd">"""Checks the consistency of extending the mapping using the current node pair.</span> + +<span class="sd"> Parameters</span> +<span class="sd"> ----------</span> +<span class="sd"> u, v: Graph node</span> +<span class="sd"> The two candidate nodes being examined.</span> + +<span class="sd"> graph_params: namedtuple</span> +<span class="sd"> Contains all the Graph-related parameters:</span> + +<span class="sd"> G1,G2: NetworkX Graph or MultiGraph instances.</span> +<span class="sd"> The two graphs to check for isomorphism or monomorphism</span> + +<span class="sd"> G1_labels,G2_labels: dict</span> +<span class="sd"> The label of every node in G1 and G2 respectively</span> + +<span class="sd"> state_params: namedtuple</span> +<span class="sd"> Contains all the State-related parameters:</span> + +<span class="sd"> mapping: dict</span> +<span class="sd"> The mapping as extended so far. Maps nodes of G1 to nodes of G2</span> + +<span class="sd"> reverse_mapping: dict</span> +<span class="sd"> The reverse mapping as extended so far. Maps nodes from G2 to nodes of G1. It's basically "mapping" reversed</span> + +<span class="sd"> T1, T2: set</span> +<span class="sd"> Ti contains uncovered neighbors of covered nodes from Gi, i.e. nodes that are not in the mapping, but are</span> +<span class="sd"> neighbors of nodes that are.</span> + +<span class="sd"> T1_out, T2_out: set</span> +<span class="sd"> Ti_out contains all the nodes from Gi, that are neither in the mapping nor in Ti</span> + +<span class="sd"> Returns</span> +<span class="sd"> -------</span> +<span class="sd"> True if the pair passes all the consistency checks successfully. False otherwise.</span> +<span class="sd"> """</span> + <span class="n">G1</span><span class="p">,</span> <span class="n">G2</span> <span class="o">=</span> <span class="n">graph_params</span><span class="o">.</span><span class="n">G1</span><span class="p">,</span> <span class="n">graph_params</span><span class="o">.</span><span class="n">G2</span> + <span class="n">mapping</span><span class="p">,</span> <span class="n">reverse_mapping</span> <span class="o">=</span> <span class="n">state_params</span><span class="o">.</span><span class="n">mapping</span><span class="p">,</span> <span class="n">state_params</span><span class="o">.</span><span class="n">reverse_mapping</span> + + <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">[</span><span class="n">u</span><span class="p">]:</span> + <span class="k">if</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">mapping</span><span class="p">:</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">u</span><span class="p">,</span> <span class="n">neighbor</span><span class="p">)</span> <span class="o">!=</span> <span class="n">G2</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span> + <span class="n">v</span><span class="p">,</span> <span class="n">mapping</span><span class="p">[</span><span class="n">neighbor</span><span class="p">]</span> + <span class="p">):</span> + <span class="k">return</span> <span class="kc">False</span> + + <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">G2</span><span class="p">[</span><span class="n">v</span><span class="p">]:</span> + <span class="k">if</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">reverse_mapping</span><span class="p">:</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">u</span><span class="p">,</span> <span class="n">reverse_mapping</span><span class="p">[</span><span class="n">neighbor</span><span class="p">])</span> <span class="o">!=</span> <span class="n">G2</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span> + <span class="n">v</span><span class="p">,</span> <span class="n">neighbor</span> + <span class="p">):</span> + <span class="k">return</span> <span class="kc">False</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_directed</span><span class="p">():</span> + <span class="k">return</span> <span class="kc">True</span> + + <span class="k">for</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="n">G1</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">u</span><span class="p">]:</span> + <span class="k">if</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="n">mapping</span><span class="p">:</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">predecessor</span><span class="p">,</span> <span class="n">u</span><span class="p">)</span> <span class="o">!=</span> <span class="n">G2</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span> + <span class="n">mapping</span><span class="p">[</span><span class="n">predecessor</span><span class="p">],</span> <span class="n">v</span> + <span class="p">):</span> + <span class="k">return</span> <span class="kc">False</span> + + <span class="k">for</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="n">G2</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">v</span><span class="p">]:</span> + <span class="k">if</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="n">reverse_mapping</span><span class="p">:</span> + <span class="k">if</span> <span class="n">G1</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span> + <span class="n">reverse_mapping</span><span class="p">[</span><span class="n">predecessor</span><span class="p">],</span> <span class="n">u</span> + <span class="p">)</span> <span class="o">!=</span> <span class="n">G2</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(</span><span class="n">predecessor</span><span class="p">,</span> <span class="n">v</span><span class="p">):</span> + <span class="k">return</span> <span class="kc">False</span> + + <span class="k">return</span> <span class="kc">True</span> + + +<span class="k">def</span> <span class="nf">_update_Tinout</span><span class="p">(</span><span class="n">new_node1</span><span class="p">,</span> <span class="n">new_node2</span><span class="p">,</span> <span class="n">graph_params</span><span class="p">,</span> <span class="n">state_params</span><span class="p">):</span> +<span class="w"> </span><span class="sd">"""Updates the Ti/Ti_out (i=1,2) when a new node pair u-v is added to the mapping.</span> + +<span class="sd"> Notes</span> +<span class="sd"> -----</span> +<span class="sd"> This function should be called right after the feasibility checks are passed, and node1 is mapped to node2. The</span> +<span class="sd"> purpose of this function is to avoid brute force computing of Ti/Ti_out by iterating over all nodes of the graph</span> +<span class="sd"> and checking which nodes satisfy the necessary conditions. Instead, in every step of the algorithm we focus</span> +<span class="sd"> exclusively on the two nodes that are being added to the mapping, incrementally updating Ti/Ti_out.</span> + +<span class="sd"> Parameters</span> +<span class="sd"> ----------</span> +<span class="sd"> new_node1, new_node2: Graph node</span> +<span class="sd"> The two new nodes, added to the mapping.</span> + +<span class="sd"> graph_params: namedtuple</span> +<span class="sd"> Contains all the Graph-related parameters:</span> + +<span class="sd"> G1,G2: NetworkX Graph or MultiGraph instances.</span> +<span class="sd"> The two graphs to check for isomorphism or monomorphism</span> + +<span class="sd"> G1_labels,G2_labels: dict</span> +<span class="sd"> The label of every node in G1 and G2 respectively</span> + +<span class="sd"> state_params: namedtuple</span> +<span class="sd"> Contains all the State-related parameters:</span> + +<span class="sd"> mapping: dict</span> +<span class="sd"> The mapping as extended so far. Maps nodes of G1 to nodes of G2</span> + +<span class="sd"> reverse_mapping: dict</span> +<span class="sd"> The reverse mapping as extended so far. Maps nodes from G2 to nodes of G1. It's basically "mapping" reversed</span> + +<span class="sd"> T1, T2: set</span> +<span class="sd"> Ti contains uncovered neighbors of covered nodes from Gi, i.e. nodes that are not in the mapping, but are</span> +<span class="sd"> neighbors of nodes that are.</span> + +<span class="sd"> T1_tilde, T2_tilde: set</span> +<span class="sd"> Ti_out contains all the nodes from Gi, that are neither in the mapping nor in Ti</span> +<span class="sd"> """</span> + <span class="n">G1</span><span class="p">,</span> <span class="n">G2</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span> <span class="o">=</span> <span class="n">graph_params</span> + <span class="p">(</span> + <span class="n">mapping</span><span class="p">,</span> + <span class="n">reverse_mapping</span><span class="p">,</span> + <span class="n">T1</span><span class="p">,</span> + <span class="n">T1_in</span><span class="p">,</span> + <span class="n">T1_tilde</span><span class="p">,</span> + <span class="n">T1_tilde_in</span><span class="p">,</span> + <span class="n">T2</span><span class="p">,</span> + <span class="n">T2_in</span><span class="p">,</span> + <span class="n">T2_tilde</span><span class="p">,</span> + <span class="n">T2_tilde_in</span><span class="p">,</span> + <span class="p">)</span> <span class="o">=</span> <span class="n">state_params</span> + + <span class="n">uncovered_successors_G1</span> <span class="o">=</span> <span class="p">{</span><span class="n">succ</span> <span class="k">for</span> <span class="n">succ</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">[</span><span class="n">new_node1</span><span class="p">]</span> <span class="k">if</span> <span class="n">succ</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">mapping</span><span class="p">}</span> + <span class="n">uncovered_successors_G2</span> <span class="o">=</span> <span class="p">{</span> + <span class="n">succ</span> <span class="k">for</span> <span class="n">succ</span> <span class="ow">in</span> <span class="n">G2</span><span class="p">[</span><span class="n">new_node2</span><span class="p">]</span> <span class="k">if</span> <span class="n">succ</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">reverse_mapping</span> + <span class="p">}</span> + + <span class="c1"># Add the uncovered neighbors of node1 and node2 in T1 and T2 respectively</span> + <span class="n">T1</span><span class="o">.</span><span class="n">update</span><span class="p">(</span><span class="n">uncovered_successors_G1</span><span class="p">)</span> + <span class="n">T2</span><span class="o">.</span><span class="n">update</span><span class="p">(</span><span class="n">uncovered_successors_G2</span><span class="p">)</span> + <span class="n">T1</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">new_node1</span><span class="p">)</span> + <span class="n">T2</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">new_node2</span><span class="p">)</span> + + <span class="n">T1_tilde</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span><span class="n">uncovered_successors_G1</span><span class="p">)</span> + <span class="n">T2_tilde</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span><span class="n">uncovered_successors_G2</span><span class="p">)</span> + <span class="n">T1_tilde</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">new_node1</span><span class="p">)</span> + <span class="n">T2_tilde</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">new_node2</span><span class="p">)</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="n">G1</span><span class="o">.</span><span class="n">is_directed</span><span class="p">():</span> + <span class="k">return</span> + + <span class="n">uncovered_predecessors_G1</span> <span class="o">=</span> <span class="p">{</span> + <span class="n">pred</span> <span class="k">for</span> <span class="n">pred</span> <span class="ow">in</span> <span class="n">G1</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">new_node1</span><span class="p">]</span> <span class="k">if</span> <span class="n">pred</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">mapping</span> + <span class="p">}</span> + <span class="n">uncovered_predecessors_G2</span> <span class="o">=</span> <span class="p">{</span> + <span class="n">pred</span> <span class="k">for</span> <span class="n">pred</span> <span class="ow">in</span> <span class="n">G2</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">new_node2</span><span class="p">]</span> <span class="k">if</span> <span class="n">pred</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">reverse_mapping</span> + <span class="p">}</span> + + <span class="n">T1_in</span><span class="o">.</span><span class="n">update</span><span class="p">(</span><span class="n">uncovered_predecessors_G1</span><span class="p">)</span> + <span class="n">T2_in</span><span class="o">.</span><span class="n">update</span><span class="p">(</span><span class="n">uncovered_predecessors_G2</span><span class="p">)</span> + <span class="n">T1_in</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">new_node1</span><span class="p">)</span> + <span class="n">T2_in</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">new_node2</span><span class="p">)</span> + + <span class="n">T1_tilde</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span><span class="n">uncovered_predecessors_G1</span><span class="p">)</span> + <span class="n">T2_tilde</span><span class="o">.</span><span class="n">difference_update</span><span class="p">(</span><span class="n">uncovered_predecessors_G2</span><span class="p">)</span> + <span class="n">T1_tilde</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">new_node1</span><span class="p">)</span> + <span class="n">T2_tilde</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">new_node2</span><span class="p">)</span> + + +<span class="k">def</span> <span class="nf">_restore_Tinout</span><span class="p">(</span><span class="n">popped_node1</span><span class="p">,</span> <span class="n">popped_node2</span><span class="p">,</span> <span class="n">graph_params</span><span class="p">,</span> <span class="n">state_params</span><span class="p">):</span> +<span class="w"> </span><span class="sd">"""Restores the previous version of Ti/Ti_out when a node pair is deleted from the mapping.</span> + +<span class="sd"> Parameters</span> +<span class="sd"> ----------</span> +<span class="sd"> popped_node1, popped_node2: Graph node</span> +<span class="sd"> The two nodes deleted from the mapping.</span> + +<span class="sd"> graph_params: namedtuple</span> +<span class="sd"> Contains all the Graph-related parameters:</span> + +<span class="sd"> G1,G2: NetworkX Graph or MultiGraph instances.</span> +<span class="sd"> The two graphs to check for isomorphism or monomorphism</span> + +<span class="sd"> G1_labels,G2_labels: dict</span> +<span class="sd"> The label of every node in G1 and G2 respectively</span> + +<span class="sd"> state_params: namedtuple</span> +<span class="sd"> Contains all the State-related parameters:</span> + +<span class="sd"> mapping: dict</span> +<span class="sd"> The mapping as extended so far. Maps nodes of G1 to nodes of G2</span> + +<span class="sd"> reverse_mapping: dict</span> +<span class="sd"> The reverse mapping as extended so far. Maps nodes from G2 to nodes of G1. It's basically "mapping" reversed</span> + +<span class="sd"> T1, T2: set</span> +<span class="sd"> Ti contains uncovered neighbors of covered nodes from Gi, i.e. nodes that are not in the mapping, but are</span> +<span class="sd"> neighbors of nodes that are.</span> + +<span class="sd"> T1_tilde, T2_tilde: set</span> +<span class="sd"> Ti_out contains all the nodes from Gi, that are neither in the mapping nor in Ti</span> +<span class="sd"> """</span> + <span class="c1"># If the node we want to remove from the mapping, has at least one covered neighbor, add it to T1.</span> + <span class="n">G1</span><span class="p">,</span> <span class="n">G2</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span> <span class="o">=</span> <span class="n">graph_params</span> + <span class="p">(</span> + <span class="n">mapping</span><span class="p">,</span> + <span class="n">reverse_mapping</span><span class="p">,</span> + <span class="n">T1</span><span class="p">,</span> + <span class="n">T1_in</span><span class="p">,</span> + <span class="n">T1_tilde</span><span class="p">,</span> + <span class="n">T1_tilde_in</span><span class="p">,</span> + <span class="n">T2</span><span class="p">,</span> + <span class="n">T2_in</span><span class="p">,</span> + <span class="n">T2_tilde</span><span class="p">,</span> + <span class="n">T2_tilde_in</span><span class="p">,</span> + <span class="p">)</span> <span class="o">=</span> <span class="n">state_params</span> + + <span class="n">is_added</span> <span class="o">=</span> <span class="kc">False</span> + <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">[</span><span class="n">popped_node1</span><span class="p">]:</span> + <span class="k">if</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">mapping</span><span class="p">:</span> + <span class="c1"># if a neighbor of the excluded node1 is in the mapping, keep node1 in T1</span> + <span class="n">is_added</span> <span class="o">=</span> <span class="kc">True</span> + <span class="n">T1</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">popped_node1</span><span class="p">)</span> + <span class="k">else</span><span class="p">:</span> + <span class="c1"># check if its neighbor has another connection with a covered node. If not, only then exclude it from T1</span> + <span class="k">if</span> <span class="nb">any</span><span class="p">(</span><span class="n">nbr</span> <span class="ow">in</span> <span class="n">mapping</span> <span class="k">for</span> <span class="n">nbr</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">[</span><span class="n">neighbor</span><span class="p">]):</span> + <span class="k">continue</span> + <span class="n">T1</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">neighbor</span><span class="p">)</span> + <span class="n">T1_tilde</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">neighbor</span><span class="p">)</span> + + <span class="c1"># Case where the node is not present in neither the mapping nor T1. By definition, it should belong to T1_tilde</span> + <span class="k">if</span> <span class="ow">not</span> <span class="n">is_added</span><span class="p">:</span> + <span class="n">T1_tilde</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">popped_node1</span><span class="p">)</span> + + <span class="n">is_added</span> <span class="o">=</span> <span class="kc">False</span> + <span class="k">for</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">G2</span><span class="p">[</span><span class="n">popped_node2</span><span class="p">]:</span> + <span class="k">if</span> <span class="n">neighbor</span> <span class="ow">in</span> <span class="n">reverse_mapping</span><span class="p">:</span> + <span class="n">is_added</span> <span class="o">=</span> <span class="kc">True</span> + <span class="n">T2</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">popped_node2</span><span class="p">)</span> + <span class="k">else</span><span class="p">:</span> + <span class="k">if</span> <span class="nb">any</span><span class="p">(</span><span class="n">nbr</span> <span class="ow">in</span> <span class="n">reverse_mapping</span> <span class="k">for</span> <span class="n">nbr</span> <span class="ow">in</span> <span class="n">G2</span><span class="p">[</span><span class="n">neighbor</span><span class="p">]):</span> + <span class="k">continue</span> + <span class="n">T2</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">neighbor</span><span class="p">)</span> + <span class="n">T2_tilde</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">neighbor</span><span class="p">)</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="n">is_added</span><span class="p">:</span> + <span class="n">T2_tilde</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">popped_node2</span><span class="p">)</span> + + +<span class="k">def</span> <span class="nf">_restore_Tinout_Di</span><span class="p">(</span><span class="n">popped_node1</span><span class="p">,</span> <span class="n">popped_node2</span><span class="p">,</span> <span class="n">graph_params</span><span class="p">,</span> <span class="n">state_params</span><span class="p">):</span> + <span class="c1"># If the node we want to remove from the mapping, has at least one covered neighbor, add it to T1.</span> + <span class="n">G1</span><span class="p">,</span> <span class="n">G2</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span><span class="p">,</span> <span class="n">_</span> <span class="o">=</span> <span class="n">graph_params</span> + <span class="p">(</span> + <span class="n">mapping</span><span class="p">,</span> + <span class="n">reverse_mapping</span><span class="p">,</span> + <span class="n">T1</span><span class="p">,</span> + <span class="n">T1_in</span><span class="p">,</span> + <span class="n">T1_tilde</span><span class="p">,</span> + <span class="n">T1_tilde_in</span><span class="p">,</span> + <span class="n">T2</span><span class="p">,</span> + <span class="n">T2_in</span><span class="p">,</span> + <span class="n">T2_tilde</span><span class="p">,</span> + <span class="n">T2_tilde_in</span><span class="p">,</span> + <span class="p">)</span> <span class="o">=</span> <span class="n">state_params</span> + + <span class="n">is_added</span> <span class="o">=</span> <span class="kc">False</span> + <span class="k">for</span> <span class="n">successor</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">[</span><span class="n">popped_node1</span><span class="p">]:</span> + <span class="k">if</span> <span class="n">successor</span> <span class="ow">in</span> <span class="n">mapping</span><span class="p">:</span> + <span class="c1"># if a neighbor of the excluded node1 is in the mapping, keep node1 in T1</span> + <span class="n">is_added</span> <span class="o">=</span> <span class="kc">True</span> + <span class="n">T1_in</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">popped_node1</span><span class="p">)</span> + <span class="k">else</span><span class="p">:</span> + <span class="c1"># check if its neighbor has another connection with a covered node. If not, only then exclude it from T1</span> + <span class="k">if</span> <span class="ow">not</span> <span class="nb">any</span><span class="p">(</span><span class="n">pred</span> <span class="ow">in</span> <span class="n">mapping</span> <span class="k">for</span> <span class="n">pred</span> <span class="ow">in</span> <span class="n">G1</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">successor</span><span class="p">]):</span> + <span class="n">T1</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">successor</span><span class="p">)</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="nb">any</span><span class="p">(</span><span class="n">succ</span> <span class="ow">in</span> <span class="n">mapping</span> <span class="k">for</span> <span class="n">succ</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">[</span><span class="n">successor</span><span class="p">]):</span> + <span class="n">T1_in</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">successor</span><span class="p">)</span> + + <span class="k">if</span> <span class="n">successor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">T1</span><span class="p">:</span> + <span class="k">if</span> <span class="n">successor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">T1_in</span><span class="p">:</span> + <span class="n">T1_tilde</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">successor</span><span class="p">)</span> + + <span class="k">for</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="n">G1</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">popped_node1</span><span class="p">]:</span> + <span class="k">if</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="n">mapping</span><span class="p">:</span> + <span class="c1"># if a neighbor of the excluded node1 is in the mapping, keep node1 in T1</span> + <span class="n">is_added</span> <span class="o">=</span> <span class="kc">True</span> + <span class="n">T1</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">popped_node1</span><span class="p">)</span> + <span class="k">else</span><span class="p">:</span> + <span class="c1"># check if its neighbor has another connection with a covered node. If not, only then exclude it from T1</span> + <span class="k">if</span> <span class="ow">not</span> <span class="nb">any</span><span class="p">(</span><span class="n">pred</span> <span class="ow">in</span> <span class="n">mapping</span> <span class="k">for</span> <span class="n">pred</span> <span class="ow">in</span> <span class="n">G1</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">predecessor</span><span class="p">]):</span> + <span class="n">T1</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">predecessor</span><span class="p">)</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="nb">any</span><span class="p">(</span><span class="n">succ</span> <span class="ow">in</span> <span class="n">mapping</span> <span class="k">for</span> <span class="n">succ</span> <span class="ow">in</span> <span class="n">G1</span><span class="p">[</span><span class="n">predecessor</span><span class="p">]):</span> + <span class="n">T1_in</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">predecessor</span><span class="p">)</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">predecessor</span> <span class="ow">in</span> <span class="n">T1</span> <span class="ow">or</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="n">T1_in</span><span class="p">):</span> + <span class="n">T1_tilde</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">predecessor</span><span class="p">)</span> + + <span class="c1"># Case where the node is not present in neither the mapping nor T1. By definition it should belong to T1_tilde</span> + <span class="k">if</span> <span class="ow">not</span> <span class="n">is_added</span><span class="p">:</span> + <span class="n">T1_tilde</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">popped_node1</span><span class="p">)</span> + + <span class="n">is_added</span> <span class="o">=</span> <span class="kc">False</span> + <span class="k">for</span> <span class="n">successor</span> <span class="ow">in</span> <span class="n">G2</span><span class="p">[</span><span class="n">popped_node2</span><span class="p">]:</span> + <span class="k">if</span> <span class="n">successor</span> <span class="ow">in</span> <span class="n">reverse_mapping</span><span class="p">:</span> + <span class="n">is_added</span> <span class="o">=</span> <span class="kc">True</span> + <span class="n">T2_in</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">popped_node2</span><span class="p">)</span> + <span class="k">else</span><span class="p">:</span> + <span class="k">if</span> <span class="ow">not</span> <span class="nb">any</span><span class="p">(</span><span class="n">pred</span> <span class="ow">in</span> <span class="n">reverse_mapping</span> <span class="k">for</span> <span class="n">pred</span> <span class="ow">in</span> <span class="n">G2</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">successor</span><span class="p">]):</span> + <span class="n">T2</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">successor</span><span class="p">)</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="nb">any</span><span class="p">(</span><span class="n">succ</span> <span class="ow">in</span> <span class="n">reverse_mapping</span> <span class="k">for</span> <span class="n">succ</span> <span class="ow">in</span> <span class="n">G2</span><span class="p">[</span><span class="n">successor</span><span class="p">]):</span> + <span class="n">T2_in</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">successor</span><span class="p">)</span> + + <span class="k">if</span> <span class="n">successor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">T2</span><span class="p">:</span> + <span class="k">if</span> <span class="n">successor</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">T2_in</span><span class="p">:</span> + <span class="n">T2_tilde</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">successor</span><span class="p">)</span> + + <span class="k">for</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="n">G2</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">popped_node2</span><span class="p">]:</span> + <span class="k">if</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="n">reverse_mapping</span><span class="p">:</span> + <span class="c1"># if a neighbor of the excluded node1 is in the mapping, keep node1 in T1</span> + <span class="n">is_added</span> <span class="o">=</span> <span class="kc">True</span> + <span class="n">T2</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">popped_node2</span><span class="p">)</span> + <span class="k">else</span><span class="p">:</span> + <span class="c1"># check if its neighbor has another connection with a covered node. If not, only then exclude it from T1</span> + <span class="k">if</span> <span class="ow">not</span> <span class="nb">any</span><span class="p">(</span><span class="n">pred</span> <span class="ow">in</span> <span class="n">reverse_mapping</span> <span class="k">for</span> <span class="n">pred</span> <span class="ow">in</span> <span class="n">G2</span><span class="o">.</span><span class="n">pred</span><span class="p">[</span><span class="n">predecessor</span><span class="p">]):</span> + <span class="n">T2</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">predecessor</span><span class="p">)</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="nb">any</span><span class="p">(</span><span class="n">succ</span> <span class="ow">in</span> <span class="n">reverse_mapping</span> <span class="k">for</span> <span class="n">succ</span> <span class="ow">in</span> <span class="n">G2</span><span class="p">[</span><span class="n">predecessor</span><span class="p">]):</span> + <span class="n">T2_in</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">predecessor</span><span class="p">)</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="p">(</span><span class="n">predecessor</span> <span class="ow">in</span> <span class="n">T2</span> <span class="ow">or</span> <span class="n">predecessor</span> <span class="ow">in</span> <span class="n">T2_in</span><span class="p">):</span> + <span class="n">T2_tilde</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">predecessor</span><span class="p">)</span> + + <span class="k">if</span> <span class="ow">not</span> <span class="n">is_added</span><span class="p">:</span> + <span class="n">T2_tilde</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">popped_node2</span><span class="p">)</span> </pre></div> </article> @@ -833,11 +1552,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/isomorphism/vf2userfunc.html b/_modules/networkx/algorithms/isomorphism/vf2userfunc.html index 310610e2..59182e69 100644 --- a/_modules/networkx/algorithms/isomorphism/vf2userfunc.html +++ b/_modules/networkx/algorithms/isomorphism/vf2userfunc.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.isomorphism.vf2userfunc — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.isomorphism.vf2userfunc — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/isomorphism/vf2userfunc';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/isomorphism/vf2userfunc.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"> @@ -509,7 +521,6 @@ <span class="c1"># Make sure the edges match</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">edge_match</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span><span class="p">:</span> - <span class="c1"># Cached lookups</span> <span class="n">G1nbrs</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">G1_adj</span><span class="p">[</span><span class="n">G1_node</span><span class="p">]</span> <span class="n">G2nbrs</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">G2_adj</span><span class="p">[</span><span class="n">G2_node</span><span class="p">]</span> @@ -651,13 +662,9 @@ <span class="k">class</span> <span class="nc">MultiGraphMatcher</span><span class="p">(</span><span class="n">GraphMatcher</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""VF2 isomorphism checker for undirected multigraphs."""</span> - <span class="k">pass</span> - <span class="k">class</span> <span class="nc">MultiDiGraphMatcher</span><span class="p">(</span><span class="n">DiGraphMatcher</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""VF2 isomorphism checker for directed multigraphs."""</span> - - <span class="k">pass</span> </pre></div> </article> @@ -672,11 +679,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/link_analysis/hits_alg.html b/_modules/networkx/algorithms/link_analysis/hits_alg.html index ddb890c9..9b927f53 100644 --- a/_modules/networkx/algorithms/link_analysis/hits_alg.html +++ b/_modules/networkx/algorithms/link_analysis/hits_alg.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.link_analysis.hits_alg — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.link_analysis.hits_alg — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/link_analysis/hits_alg';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/link_analysis/hits_alg.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"> @@ -810,11 +822,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/link_analysis/pagerank_alg.html b/_modules/networkx/algorithms/link_analysis/pagerank_alg.html index cba43835..f965aaf7 100644 --- a/_modules/networkx/algorithms/link_analysis/pagerank_alg.html +++ b/_modules/networkx/algorithms/link_analysis/pagerank_alg.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.link_analysis.pagerank_alg — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.link_analysis.pagerank_alg — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/link_analysis/pagerank_alg';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/link_analysis/pagerank_alg.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"> @@ -499,7 +511,7 @@ <span class="sd"> The "personalization vector" consisting of a dictionary with a</span> <span class="sd"> key some subset of graph nodes and personalization value each of those.</span> <span class="sd"> At least one personalization value must be non-zero.</span> -<span class="sd"> If not specfiied, a nodes personalization value will be zero.</span> +<span class="sd"> If not specified, a nodes personalization value will be zero.</span> <span class="sd"> By default, a uniform distribution is used.</span> <span class="sd"> max_iter : integer, optional</span> @@ -507,6 +519,7 @@ <span class="sd"> tol : float, optional</span> <span class="sd"> Error tolerance used to check convergence in power method solver.</span> +<span class="sd"> The iteration will stop after a tolerance of ``len(G) * tol`` is reached.</span> <span class="sd"> nstart : dictionary, optional</span> <span class="sd"> Starting value of PageRank iteration for each node.</span> @@ -653,7 +666,7 @@ <span class="sd"> The "personalization vector" consisting of a dictionary with a</span> <span class="sd"> key some subset of graph nodes and personalization value each of those.</span> <span class="sd"> At least one personalization value must be non-zero.</span> -<span class="sd"> If not specfiied, a nodes personalization value will be zero.</span> +<span class="sd"> If not specifed, a nodes personalization value will be zero.</span> <span class="sd"> By default, a uniform distribution is used.</span> <span class="sd"> nodelist : list, optional</span> @@ -752,7 +765,7 @@ <span class="sd"> The "personalization vector" consisting of a dictionary with a</span> <span class="sd"> key some subset of graph nodes and personalization value each of those.</span> <span class="sd"> At least one personalization value must be non-zero.</span> -<span class="sd"> If not specfiied, a nodes personalization value will be zero.</span> +<span class="sd"> If not specified, a nodes personalization value will be zero.</span> <span class="sd"> By default, a uniform distribution is used.</span> <span class="sd"> weight : key, optional</span> @@ -846,7 +859,7 @@ <span class="sd"> The "personalization vector" consisting of a dictionary with a</span> <span class="sd"> key some subset of graph nodes and personalization value each of those.</span> <span class="sd"> At least one personalization value must be non-zero.</span> -<span class="sd"> If not specfiied, a nodes personalization value will be zero.</span> +<span class="sd"> If not specified, a nodes personalization value will be zero.</span> <span class="sd"> By default, a uniform distribution is used.</span> <span class="sd"> max_iter : integer, optional</span> @@ -854,6 +867,7 @@ <span class="sd"> tol : float, optional</span> <span class="sd"> Error tolerance used to check convergence in power method solver.</span> +<span class="sd"> The iteration will stop after a tolerance of ``len(G) * tol`` is reached.</span> <span class="sd"> nstart : dictionary, optional</span> <span class="sd"> Starting value of PageRank iteration for each node.</span> @@ -973,11 +987,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/link_prediction.html b/_modules/networkx/algorithms/link_prediction.html index e7df6b9b..16200ff1 100644 --- a/_modules/networkx/algorithms/link_prediction.html +++ b/_modules/networkx/algorithms/link_prediction.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.link_prediction — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.link_prediction — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/link_prediction';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/link_prediction.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"> @@ -1072,11 +1084,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/lowest_common_ancestors.html b/_modules/networkx/algorithms/lowest_common_ancestors.html index a6f48279..abc7f258 100644 --- a/_modules/networkx/algorithms/lowest_common_ancestors.html +++ b/_modules/networkx/algorithms/lowest_common_ancestors.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.lowest_common_ancestors — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.lowest_common_ancestors — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/lowest_common_ancestors';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/lowest_common_ancestors.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"> @@ -740,11 +752,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/matching.html b/_modules/networkx/algorithms/matching.html index c413ddd7..992431bf 100644 --- a/_modules/networkx/algorithms/matching.html +++ b/_modules/networkx/algorithms/matching.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.matching — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.matching — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/matching';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/matching.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"> @@ -854,8 +866,6 @@ <span class="k">class</span> <span class="nc">NoNode</span><span class="p">:</span> <span class="w"> </span><span class="sd">"""Dummy value which is different from any node."""</span> - <span class="k">pass</span> - <span class="k">class</span> <span class="nc">Blossom</span><span class="p">:</span> <span class="w"> </span><span class="sd">"""Representation of a non-trivial blossom or sub-blossom."""</span> @@ -1269,7 +1279,7 @@ <span class="c1"># Swap matched/unmatched edges over an alternating path between two</span> <span class="c1"># single vertices. The augmenting path runs through S-vertices v and w.</span> <span class="k">def</span> <span class="nf">augmentMatching</span><span class="p">(</span><span class="n">v</span><span class="p">,</span> <span class="n">w</span><span class="p">):</span> - <span class="k">for</span> <span class="p">(</span><span class="n">s</span><span class="p">,</span> <span class="n">j</span><span class="p">)</span> <span class="ow">in</span> <span class="p">((</span><span class="n">v</span><span class="p">,</span> <span class="n">w</span><span class="p">),</span> <span class="p">(</span><span class="n">w</span><span class="p">,</span> <span class="n">v</span><span class="p">)):</span> + <span class="k">for</span> <span class="n">s</span><span class="p">,</span> <span class="n">j</span> <span class="ow">in</span> <span class="p">((</span><span class="n">v</span><span class="p">,</span> <span class="n">w</span><span class="p">),</span> <span class="p">(</span><span class="n">w</span><span class="p">,</span> <span class="n">v</span><span class="p">)):</span> <span class="c1"># Match vertex s to vertex j. Then trace back from s</span> <span class="c1"># until we find a single vertex, swapping matched and unmatched</span> <span class="c1"># edges as we go.</span> @@ -1326,7 +1336,7 @@ <span class="n">jblossoms</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">blossomparent</span><span class="p">[</span><span class="n">jblossoms</span><span class="p">[</span><span class="o">-</span><span class="mi">1</span><span class="p">]])</span> <span class="n">iblossoms</span><span class="o">.</span><span class="n">reverse</span><span class="p">()</span> <span class="n">jblossoms</span><span class="o">.</span><span class="n">reverse</span><span class="p">()</span> - <span class="k">for</span> <span class="p">(</span><span class="n">bi</span><span class="p">,</span> <span class="n">bj</span><span class="p">)</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="n">iblossoms</span><span class="p">,</span> <span class="n">jblossoms</span><span class="p">):</span> + <span class="k">for</span> <span class="n">bi</span><span class="p">,</span> <span class="n">bj</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="n">iblossoms</span><span class="p">,</span> <span class="n">jblossoms</span><span class="p">):</span> <span class="k">if</span> <span class="n">bi</span> <span class="o">!=</span> <span class="n">bj</span><span class="p">:</span> <span class="k">break</span> <span class="n">s</span> <span class="o">+=</span> <span class="mi">2</span> <span class="o">*</span> <span class="n">blossomdual</span><span class="p">[</span><span class="n">bi</span><span class="p">]</span> @@ -1341,13 +1351,12 @@ <span class="k">for</span> <span class="n">b</span> <span class="ow">in</span> <span class="n">blossomdual</span><span class="p">:</span> <span class="k">if</span> <span class="n">blossomdual</span><span class="p">[</span><span class="n">b</span><span class="p">]</span> <span class="o">></span> <span class="mi">0</span><span class="p">:</span> <span class="k">assert</span> <span class="nb">len</span><span class="p">(</span><span class="n">b</span><span class="o">.</span><span class="n">edges</span><span class="p">)</span> <span class="o">%</span> <span class="mi">2</span> <span class="o">==</span> <span class="mi">1</span> - <span class="k">for</span> <span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="n">j</span><span class="p">)</span> <span class="ow">in</span> <span class="n">b</span><span class="o">.</span><span class="n">edges</span><span class="p">[</span><span class="mi">1</span><span class="p">::</span><span class="mi">2</span><span class="p">]:</span> + <span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="n">j</span> <span class="ow">in</span> <span class="n">b</span><span class="o">.</span><span class="n">edges</span><span class="p">[</span><span class="mi">1</span><span class="p">::</span><span class="mi">2</span><span class="p">]:</span> <span class="k">assert</span> <span class="n">mate</span><span class="p">[</span><span class="n">i</span><span class="p">]</span> <span class="o">==</span> <span class="n">j</span> <span class="ow">and</span> <span class="n">mate</span><span class="p">[</span><span class="n">j</span><span class="p">]</span> <span class="o">==</span> <span class="n">i</span> <span class="c1"># Ok.</span> <span class="c1"># Main loop: continue until no further improvement is possible.</span> <span class="k">while</span> <span class="mi">1</span><span class="p">:</span> - <span class="c1"># Each iteration of this loop is a "stage".</span> <span class="c1"># A stage finds an augmenting path and uses that to improve</span> <span class="c1"># the matching.</span> @@ -1376,7 +1385,6 @@ <span class="c1"># Loop until we succeed in augmenting the matching.</span> <span class="n">augmented</span> <span class="o">=</span> <span class="mi">0</span> <span class="k">while</span> <span class="mi">1</span><span class="p">:</span> - <span class="c1"># Each iteration of this loop is a "substage".</span> <span class="c1"># A substage tries to find an augmenting path;</span> <span class="c1"># if found, the path is used to improve the matching and</span> @@ -1387,7 +1395,6 @@ <span class="c1"># Continue labeling until all vertices which are reachable</span> <span class="c1"># through an alternating path have got a label.</span> <span class="k">while</span> <span class="n">queue</span> <span class="ow">and</span> <span class="ow">not</span> <span class="n">augmented</span><span class="p">:</span> - <span class="c1"># Take an S vertex from the queue.</span> <span class="n">v</span> <span class="o">=</span> <span class="n">queue</span><span class="o">.</span><span class="n">pop</span><span class="p">()</span> <span class="k">assert</span> <span class="n">label</span><span class="p">[</span><span class="n">inblossom</span><span class="p">[</span><span class="n">v</span><span class="p">]]</span> <span class="o">==</span> <span class="mi">1</span> @@ -1583,11 +1590,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/minors/contraction.html b/_modules/networkx/algorithms/minors/contraction.html index 90cd96a0..88bf64e4 100644 --- a/_modules/networkx/algorithms/minors/contraction.html +++ b/_modules/networkx/algorithms/minors/contraction.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.minors.contraction — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.minors.contraction — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/minors/contraction';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/minors/contraction.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"> @@ -771,7 +783,7 @@ <span class="c1"># If the partition is a dict, it is assumed to be one where the keys are</span> <span class="c1"># user-defined block labels, and values are block lists, tuples or sets.</span> <span class="k">if</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">partition</span><span class="p">,</span> <span class="nb">dict</span><span class="p">):</span> - <span class="n">partition</span> <span class="o">=</span> <span class="p">[</span><span class="n">block</span> <span class="k">for</span> <span class="n">block</span> <span class="ow">in</span> <span class="n">partition</span><span class="o">.</span><span class="n">values</span><span class="p">()]</span> + <span class="n">partition</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">partition</span><span class="o">.</span><span class="n">values</span><span class="p">())</span> <span class="c1"># If the user provided partition as a collection of sets. Then we</span> <span class="c1"># need to check if partition covers all of G nodes. If the answer</span> @@ -807,9 +819,12 @@ <span class="k">def</span> <span class="nf">node_data</span><span class="p">(</span><span class="n">b</span><span class="p">):</span> <span class="n">S</span> <span class="o">=</span> <span class="n">G</span><span class="o">.</span><span class="n">subgraph</span><span class="p">(</span><span class="n">b</span><span class="p">)</span> - <span class="k">return</span> <span class="nb">dict</span><span class="p">(</span> - <span class="n">graph</span><span class="o">=</span><span class="n">S</span><span class="p">,</span> <span class="n">nnodes</span><span class="o">=</span><span class="nb">len</span><span class="p">(</span><span class="n">S</span><span class="p">),</span> <span class="n">nedges</span><span class="o">=</span><span class="n">S</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(),</span> <span class="n">density</span><span class="o">=</span><span class="n">density</span><span class="p">(</span><span class="n">S</span><span class="p">)</span> - <span class="p">)</span> + <span class="k">return</span> <span class="p">{</span> + <span class="s2">"graph"</span><span class="p">:</span> <span class="n">S</span><span class="p">,</span> + <span class="s2">"nnodes"</span><span class="p">:</span> <span class="nb">len</span><span class="p">(</span><span class="n">S</span><span class="p">),</span> + <span class="s2">"nedges"</span><span class="p">:</span> <span class="n">S</span><span class="o">.</span><span class="n">number_of_edges</span><span class="p">(),</span> + <span class="s2">"density"</span><span class="p">:</span> <span class="n">density</span><span class="p">(</span><span class="n">S</span><span class="p">),</span> + <span class="p">}</span> <span class="c1"># Each block of the partition becomes a node in the quotient graph.</span> <span class="n">partition</span> <span class="o">=</span> <span class="p">[</span><span class="nb">frozenset</span><span class="p">(</span><span class="n">b</span><span class="p">)</span> <span class="k">for</span> <span class="n">b</span> <span class="ow">in</span> <span class="n">partition</span><span class="p">]</span> @@ -968,7 +983,7 @@ <span class="n">v_data</span> <span class="o">=</span> <span class="n">H</span><span class="o">.</span><span class="n">nodes</span><span class="p">[</span><span class="n">v</span><span class="p">]</span> <span class="n">H</span><span class="o">.</span><span class="n">remove_node</span><span class="p">(</span><span class="n">v</span><span class="p">)</span> - <span class="k">for</span> <span class="p">(</span><span class="n">prev_w</span><span class="p">,</span> <span class="n">prev_x</span><span class="p">,</span> <span class="n">d</span><span class="p">)</span> <span class="ow">in</span> <span class="n">edges_to_remap</span><span class="p">:</span> + <span class="k">for</span> <span class="n">prev_w</span><span class="p">,</span> <span class="n">prev_x</span><span class="p">,</span> <span class="n">d</span> <span class="ow">in</span> <span class="n">edges_to_remap</span><span class="p">:</span> <span class="n">w</span> <span class="o">=</span> <span class="n">prev_w</span> <span class="k">if</span> <span class="n">prev_w</span> <span class="o">!=</span> <span class="n">v</span> <span class="k">else</span> <span class="n">u</span> <span class="n">x</span> <span class="o">=</span> <span class="n">prev_x</span> <span class="k">if</span> <span class="n">prev_x</span> <span class="o">!=</span> <span class="n">v</span> <span class="k">else</span> <span class="n">u</span> @@ -1074,11 +1089,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/mis.html b/_modules/networkx/algorithms/mis.html index d9143cb7..a885c998 100644 --- a/_modules/networkx/algorithms/mis.html +++ b/_modules/networkx/algorithms/mis.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.mis — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.mis — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/mis';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/mis.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"> @@ -551,11 +563,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/moral.html b/_modules/networkx/algorithms/moral.html index ff45b514..f696c8d2 100644 --- a/_modules/networkx/algorithms/moral.html +++ b/_modules/networkx/algorithms/moral.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.moral — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.moral — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/moral';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/moral.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"> @@ -532,11 +544,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/node_classification.html b/_modules/networkx/algorithms/node_classification.html index 43d7b891..3de5c502 100644 --- a/_modules/networkx/algorithms/node_classification.html +++ b/_modules/networkx/algorithms/node_classification.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.node_classification — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.node_classification — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/node_classification';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/node_classification.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"> @@ -693,11 +705,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/non_randomness.html b/_modules/networkx/algorithms/non_randomness.html index 4e97da33..7a8258fc 100644 --- a/_modules/networkx/algorithms/non_randomness.html +++ b/_modules/networkx/algorithms/non_randomness.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.non_randomness — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.non_randomness — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/non_randomness';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/non_randomness.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"> @@ -570,11 +582,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/operators/all.html b/_modules/networkx/algorithms/operators/all.html index f3a6855a..1516fe57 100644 --- a/_modules/networkx/algorithms/operators/all.html +++ b/_modules/networkx/algorithms/operators/all.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.operators.all — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.operators.all — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/operators/all';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/operators/all.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"> @@ -706,11 +718,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/operators/binary.html b/_modules/networkx/algorithms/operators/binary.html index d766ce23..f2633318 100644 --- a/_modules/networkx/algorithms/operators/binary.html +++ b/_modules/networkx/algorithms/operators/binary.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.operators.binary — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.operators.binary — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/operators/binary';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/operators/binary.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"> @@ -911,11 +923,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/operators/product.html b/_modules/networkx/algorithms/operators/product.html index 310beb8e..578a529d 100644 --- a/_modules/networkx/algorithms/operators/product.html +++ b/_modules/networkx/algorithms/operators/product.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.operators.product — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.operators.product — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/operators/product';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/operators/product.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"> @@ -573,7 +585,7 @@ <span class="k">def</span> <span class="nf">_init_product_graph</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">H</span><span class="p">):</span> - <span class="k">if</span> <span class="ow">not</span> <span class="n">G</span><span class="o">.</span><span class="n">is_directed</span><span class="p">()</span> <span class="o">==</span> <span class="n">H</span><span class="o">.</span><span class="n">is_directed</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="o">!=</span> <span class="n">H</span><span class="o">.</span><span class="n">is_directed</span><span class="p">():</span> <span class="n">msg</span> <span class="o">=</span> <span class="s2">"G and H must be both directed or both undirected"</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="n">msg</span><span class="p">)</span> <span class="k">if</span> <span class="n">G</span><span class="o">.</span><span class="n">is_multigraph</span><span class="p">()</span> <span class="ow">or</span> <span class="n">H</span><span class="o">.</span><span class="n">is_multigraph</span><span class="p">():</span> @@ -975,7 +987,6 @@ <span class="n">GH</span><span class="o">.</span><span class="n">add_edges_from</span><span class="p">(</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">G_node</span> <span class="ow">in</span> <span class="n">G</span><span class="p">:</span> - <span class="c1"># copy nodes of H in GH, call it H_i</span> <span class="n">GH</span><span class="o">.</span><span class="n">add_nodes_from</span><span class="p">((</span><span class="n">G_node</span><span class="p">,</span> <span class="n">v</span><span class="p">)</span> <span class="k">for</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">H</span><span class="p">)</span> @@ -1002,11 +1013,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/operators/unary.html b/_modules/networkx/algorithms/operators/unary.html index 15408756..3481a543 100644 --- a/_modules/networkx/algorithms/operators/unary.html +++ b/_modules/networkx/algorithms/operators/unary.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.operators.unary — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.operators.unary — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/operators/unary';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/operators/unary.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"> @@ -549,11 +561,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/planar_drawing.html b/_modules/networkx/algorithms/planar_drawing.html index fb6c5154..69e27bce 100644 --- a/_modules/networkx/algorithms/planar_drawing.html +++ b/_modules/networkx/algorithms/planar_drawing.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.planar_drawing — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.planar_drawing — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/planar_drawing';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/planar_drawing.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="n">left_t_child</span><span class="p">[</span><span class="n">vk</span><span class="p">]</span> <span class="o">=</span> <span class="kc">None</span> <span class="c1"># 2. Phase: Set absolute positions</span> - <span class="n">pos</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span> + <span class="n">pos</span> <span class="o">=</span> <span class="p">{}</span> <span class="n">pos</span><span class="p">[</span><span class="n">v1</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="n">y_coordinate</span><span class="p">[</span><span class="n">v1</span><span class="p">])</span> <span class="n">remaining_nodes</span> <span class="o">=</span> <span class="p">[</span><span class="n">v1</span><span class="p">]</span> <span class="k">while</span> <span class="n">remaining_nodes</span><span class="p">:</span> @@ -676,7 +688,7 @@ <span class="k">return</span> <span class="n">outer_face_ccw_nbr</span><span class="p">[</span><span class="n">x</span><span class="p">]</span> <span class="o">==</span> <span class="n">y</span> <span class="ow">or</span> <span class="n">outer_face_cw_nbr</span><span class="p">[</span><span class="n">x</span><span class="p">]</span> <span class="o">==</span> <span class="n">y</span> <span class="k">def</span> <span class="nf">is_on_outer_face</span><span class="p">(</span><span class="n">x</span><span class="p">):</span> - <span class="k">return</span> <span class="n">x</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">marked_nodes</span> <span class="ow">and</span> <span class="p">(</span><span class="n">x</span> <span class="ow">in</span> <span class="n">outer_face_ccw_nbr</span><span class="o">.</span><span class="n">keys</span><span class="p">()</span> <span class="ow">or</span> <span class="n">x</span> <span class="o">==</span> <span class="n">v1</span><span class="p">)</span> + <span class="k">return</span> <span class="n">x</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">marked_nodes</span> <span class="ow">and</span> <span class="p">(</span><span class="n">x</span> <span class="ow">in</span> <span class="n">outer_face_ccw_nbr</span> <span class="ow">or</span> <span class="n">x</span> <span class="o">==</span> <span class="n">v1</span><span class="p">)</span> <span class="c1"># Initialize number of chords</span> <span class="k">for</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">outer_face</span><span class="p">:</span> @@ -686,7 +698,7 @@ <span class="n">ready_to_pick</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">v</span><span class="p">)</span> <span class="c1"># Initialize canonical_ordering</span> - <span class="n">canonical_ordering</span> <span class="o">=</span> <span class="p">[</span><span class="kc">None</span><span class="p">]</span> <span class="o">*</span> <span class="nb">len</span><span class="p">(</span><span class="n">embedding</span><span class="o">.</span><span class="n">nodes</span><span class="p">())</span> <span class="c1"># type: list</span> + <span class="n">canonical_ordering</span> <span class="o">=</span> <span class="p">[</span><span class="kc">None</span><span class="p">]</span> <span class="o">*</span> <span class="nb">len</span><span class="p">(</span><span class="n">embedding</span><span class="o">.</span><span class="n">nodes</span><span class="p">())</span> <span class="n">canonical_ordering</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span><span class="n">v1</span><span class="p">,</span> <span class="p">[])</span> <span class="n">canonical_ordering</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">=</span> <span class="p">(</span><span class="n">v2</span><span class="p">,</span> <span class="p">[])</span> <span class="n">ready_to_pick</span><span class="o">.</span><span class="n">discard</span><span class="p">(</span><span class="n">v1</span><span class="p">)</span> @@ -779,7 +791,7 @@ <span class="sd"> """</span> <span class="n">_</span><span class="p">,</span> <span class="n">v3</span> <span class="o">=</span> <span class="n">embedding</span><span class="o">.</span><span class="n">next_face_half_edge</span><span class="p">(</span><span class="n">v1</span><span class="p">,</span> <span class="n">v2</span><span class="p">)</span> <span class="n">_</span><span class="p">,</span> <span class="n">v4</span> <span class="o">=</span> <span class="n">embedding</span><span class="o">.</span><span class="n">next_face_half_edge</span><span class="p">(</span><span class="n">v2</span><span class="p">,</span> <span class="n">v3</span><span class="p">)</span> - <span class="k">if</span> <span class="n">v1</span> <span class="o">==</span> <span class="n">v2</span> <span class="ow">or</span> <span class="n">v1</span> <span class="o">==</span> <span class="n">v3</span><span class="p">:</span> + <span class="k">if</span> <span class="n">v1</span> <span class="ow">in</span> <span class="p">(</span><span class="n">v2</span><span class="p">,</span> <span class="n">v3</span><span class="p">):</span> <span class="c1"># The component has less than 3 nodes</span> <span class="k">return</span> <span class="k">while</span> <span class="n">v1</span> <span class="o">!=</span> <span class="n">v4</span><span class="p">:</span> @@ -939,11 +951,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/planarity.html b/_modules/networkx/algorithms/planarity.html index b8853a46..c5486bdd 100644 --- a/_modules/networkx/algorithms/planarity.html +++ b/_modules/networkx/algorithms/planarity.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.planarity — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.planarity — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/planarity';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/planarity.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"> @@ -1330,7 +1342,7 @@ <span class="sd"> set_data</span> <span class="sd"> """</span> - <span class="n">embedding</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span> + <span class="n">embedding</span> <span class="o">=</span> <span class="p">{}</span> <span class="k">for</span> <span class="n">v</span> <span class="ow">in</span> <span class="bp">self</span><span class="p">:</span> <span class="n">embedding</span><span class="p">[</span><span class="n">v</span><span class="p">]</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="bp">self</span><span class="o">.</span><span class="n">neighbors_cw_order</span><span class="p">(</span><span class="n">v</span><span class="p">))</span> <span class="k">return</span> <span class="n">embedding</span></div> @@ -1649,11 +1661,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/polynomials.html b/_modules/networkx/algorithms/polynomials.html index 09211792..c9d24989 100644 --- a/_modules/networkx/algorithms/polynomials.html +++ b/_modules/networkx/algorithms/polynomials.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.polynomials — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.polynomials — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/polynomials';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/polynomials.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"> @@ -778,11 +790,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/reciprocity.html b/_modules/networkx/algorithms/reciprocity.html index 12e28869..9bb74dac 100644 --- a/_modules/networkx/algorithms/reciprocity.html +++ b/_modules/networkx/algorithms/reciprocity.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.reciprocity — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.reciprocity — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/reciprocity';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/reciprocity.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"> @@ -572,11 +584,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/regular.html b/_modules/networkx/algorithms/regular.html index 20f36e84..e0de469d 100644 --- a/_modules/networkx/algorithms/regular.html +++ b/_modules/networkx/algorithms/regular.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.regular — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.regular — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/regular';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/regular.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"> @@ -585,7 +597,7 @@ <span class="n">adj_view</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">g</span><span class="p">[</span><span class="bp">self</span><span class="o">.</span><span class="n">original</span><span class="p">]</span> <span class="n">neighbors</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">adj_view</span><span class="o">.</span><span class="n">keys</span><span class="p">())</span> <span class="n">edge_attrs</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">adj_view</span><span class="o">.</span><span class="n">values</span><span class="p">())</span> - <span class="k">for</span> <span class="p">(</span><span class="n">outer</span><span class="p">,</span> <span class="n">neighbor</span><span class="p">,</span> <span class="n">edge_attrs</span><span class="p">)</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span> + <span class="k">for</span> <span class="n">outer</span><span class="p">,</span> <span class="n">neighbor</span><span class="p">,</span> <span class="n">edge_attrs</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span> <span class="bp">self</span><span class="o">.</span><span class="n">outer_vertices</span><span class="p">,</span> <span class="n">neighbors</span><span class="p">,</span> <span class="n">edge_attrs</span> <span class="p">):</span> <span class="bp">self</span><span class="o">.</span><span class="n">g</span><span class="o">.</span><span class="n">add_edge</span><span class="p">(</span><span class="n">outer</span><span class="p">,</span> <span class="n">neighbor</span><span class="p">,</span> <span class="o">**</span><span class="n">edge_attrs</span><span class="p">)</span> @@ -618,7 +630,7 @@ <span class="k">def</span> <span class="nf">replace_node</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span> <span class="n">adj_view</span> <span class="o">=</span> <span class="bp">self</span><span class="o">.</span><span class="n">g</span><span class="p">[</span><span class="bp">self</span><span class="o">.</span><span class="n">original</span><span class="p">]</span> - <span class="k">for</span> <span class="p">(</span><span class="n">outer</span><span class="p">,</span> <span class="n">inner</span><span class="p">,</span> <span class="p">(</span><span class="n">neighbor</span><span class="p">,</span> <span class="n">edge_attrs</span><span class="p">))</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span> + <span class="k">for</span> <span class="n">outer</span><span class="p">,</span> <span class="n">inner</span><span class="p">,</span> <span class="p">(</span><span class="n">neighbor</span><span class="p">,</span> <span class="n">edge_attrs</span><span class="p">)</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span> <span class="bp">self</span><span class="o">.</span><span class="n">outer_vertices</span><span class="p">,</span> <span class="bp">self</span><span class="o">.</span><span class="n">inner_vertices</span><span class="p">,</span> <span class="nb">list</span><span class="p">(</span><span class="n">adj_view</span><span class="o">.</span><span class="n">items</span><span class="p">())</span> <span class="p">):</span> <span class="bp">self</span><span class="o">.</span><span class="n">g</span><span class="o">.</span><span class="n">add_edge</span><span class="p">(</span><span class="n">outer</span><span class="p">,</span> <span class="n">inner</span><span class="p">)</span> @@ -686,11 +698,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/richclub.html b/_modules/networkx/algorithms/richclub.html index 80626a6f..a1248da1 100644 --- a/_modules/networkx/algorithms/richclub.html +++ b/_modules/networkx/algorithms/richclub.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.richclub — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.richclub — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/richclub';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/richclub.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"> @@ -595,11 +607,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/shortest_paths/astar.html b/_modules/networkx/algorithms/shortest_paths/astar.html index 3bf7bd4d..c9b12d55 100644 --- a/_modules/networkx/algorithms/shortest_paths/astar.html +++ b/_modules/networkx/algorithms/shortest_paths/astar.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.shortest_paths.astar — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.shortest_paths.astar — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/shortest_paths/astar';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/shortest_paths/astar.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"> @@ -685,11 +697,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/shortest_paths/dense.html b/_modules/networkx/algorithms/shortest_paths/dense.html index b7b67c15..cdca8347 100644 --- a/_modules/networkx/algorithms/shortest_paths/dense.html +++ b/_modules/networkx/algorithms/shortest_paths/dense.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.shortest_paths.dense — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.shortest_paths.dense — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/shortest_paths/dense';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/shortest_paths/dense.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"> @@ -473,7 +485,8 @@ <span class="p">]</span> -<div class="viewcode-block" id="floyd_warshall_numpy"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_numpy.html#networkx.algorithms.shortest_paths.dense.floyd_warshall_numpy">[docs]</a><span class="k">def</span> <span class="nf">floyd_warshall_numpy</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">nodelist</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> +<div class="viewcode-block" id="floyd_warshall_numpy"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_numpy.html#networkx.algorithms.shortest_paths.dense.floyd_warshall_numpy">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">floyd_warshall_numpy</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">nodelist</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Find all-pairs shortest path lengths using Floyd's algorithm.</span> <span class="sd"> This algorithm for finding shortest paths takes advantage of</span> @@ -536,7 +549,8 @@ <span class="k">return</span> <span class="n">A</span></div> -<div class="viewcode-block" id="floyd_warshall_predecessor_and_distance"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance.html#networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance">[docs]</a><span class="k">def</span> <span class="nf">floyd_warshall_predecessor_and_distance</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> +<div class="viewcode-block" id="floyd_warshall_predecessor_and_distance"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance.html#networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">floyd_warshall_predecessor_and_distance</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Find all-pairs shortest path lengths using Floyd's algorithm.</span> <span class="sd"> Parameters</span> @@ -661,7 +675,8 @@ <span class="k">return</span> <span class="nb">list</span><span class="p">(</span><span class="nb">reversed</span><span class="p">(</span><span class="n">path</span><span class="p">))</span></div> -<div class="viewcode-block" id="floyd_warshall"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall.html#networkx.algorithms.shortest_paths.dense.floyd_warshall">[docs]</a><span class="k">def</span> <span class="nf">floyd_warshall</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> +<div class="viewcode-block" id="floyd_warshall"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall.html#networkx.algorithms.shortest_paths.dense.floyd_warshall">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">floyd_warshall</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Find all-pairs shortest path lengths using Floyd's algorithm.</span> <span class="sd"> Parameters</span> @@ -708,11 +723,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/shortest_paths/generic.html b/_modules/networkx/algorithms/shortest_paths/generic.html index 5fdf61f3..71a062f4 100644 --- a/_modules/networkx/algorithms/shortest_paths/generic.html +++ b/_modules/networkx/algorithms/shortest_paths/generic.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.shortest_paths.generic — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.shortest_paths.generic — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/shortest_paths/generic';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/shortest_paths/generic.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"> @@ -1051,11 +1063,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/shortest_paths/unweighted.html b/_modules/networkx/algorithms/shortest_paths/unweighted.html index f8565ac0..3cffc2cd 100644 --- a/_modules/networkx/algorithms/shortest_paths/unweighted.html +++ b/_modules/networkx/algorithms/shortest_paths/unweighted.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.shortest_paths.unweighted — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.shortest_paths.unweighted — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/shortest_paths/unweighted';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/shortest_paths/unweighted.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"> @@ -478,7 +490,8 @@ <span class="p">]</span> -<div class="viewcode-block" id="single_source_shortest_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length.html#networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length">[docs]</a><span class="k">def</span> <span class="nf">single_source_shortest_path_length</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="p">,</span> <span class="n">cutoff</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> +<div class="viewcode-block" id="single_source_shortest_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length.html#networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">single_source_shortest_path_length</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</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="w"> </span><span class="sd">"""Compute the shortest path lengths from source to all reachable nodes.</span> <span class="sd"> Parameters</span> @@ -556,7 +569,8 @@ <span class="k">del</span> <span class="n">seen</span> -<div class="viewcode-block" id="single_target_shortest_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length.html#networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length">[docs]</a><span class="k">def</span> <span class="nf">single_target_shortest_path_length</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">target</span><span class="p">,</span> <span class="n">cutoff</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> +<div class="viewcode-block" id="single_target_shortest_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length.html#networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">single_target_shortest_path_length</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">target</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="w"> </span><span class="sd">"""Compute the shortest path lengths to target from all reachable nodes.</span> <span class="sd"> Parameters</span> @@ -603,7 +617,8 @@ <span class="k">return</span> <span class="n">_single_shortest_path_length</span><span class="p">(</span><span class="n">adj</span><span class="p">,</span> <span class="n">nextlevel</span><span class="p">,</span> <span class="n">cutoff</span><span class="p">)</span></div> -<div class="viewcode-block" id="all_pairs_shortest_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length.html#networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length">[docs]</a><span class="k">def</span> <span class="nf">all_pairs_shortest_path_length</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">cutoff</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> +<div class="viewcode-block" id="all_pairs_shortest_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length.html#networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">all_pairs_shortest_path_length</span><span class="p">(</span><span class="n">G</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="w"> </span><span class="sd">"""Computes the shortest path lengths between all nodes in `G`.</span> <span class="sd"> Parameters</span> @@ -755,7 +770,8 @@ <span class="k">raise</span> <span class="n">nx</span><span class="o">.</span><span class="n">NetworkXNoPath</span><span class="p">(</span><span class="sa">f</span><span class="s2">"No path between </span><span class="si">{</span><span class="n">source</span><span class="si">}</span><span class="s2"> and </span><span class="si">{</span><span class="n">target</span><span class="si">}</span><span class="s2">."</span><span class="p">)</span> -<div class="viewcode-block" id="single_source_shortest_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path.html#networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path">[docs]</a><span class="k">def</span> <span class="nf">single_source_shortest_path</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="p">,</span> <span class="n">cutoff</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> +<div class="viewcode-block" id="single_source_shortest_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path.html#networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">single_source_shortest_path</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</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="w"> </span><span class="sd">"""Compute shortest path between source</span> <span class="sd"> and all other nodes reachable from source.</span> @@ -838,7 +854,8 @@ <span class="k">return</span> <span class="n">paths</span> -<div class="viewcode-block" id="single_target_shortest_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path.html#networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path">[docs]</a><span class="k">def</span> <span class="nf">single_target_shortest_path</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">target</span><span class="p">,</span> <span class="n">cutoff</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> +<div class="viewcode-block" id="single_target_shortest_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path.html#networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">single_target_shortest_path</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">target</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="w"> </span><span class="sd">"""Compute shortest path to target from all nodes that reach target.</span> <span class="sd"> Parameters</span> @@ -889,7 +906,8 @@ <span class="k">return</span> <span class="nb">dict</span><span class="p">(</span><span class="n">_single_shortest_path</span><span class="p">(</span><span class="n">adj</span><span class="p">,</span> <span class="n">nextlevel</span><span class="p">,</span> <span class="n">paths</span><span class="p">,</span> <span class="n">cutoff</span><span class="p">,</span> <span class="n">join</span><span class="p">))</span></div> -<div class="viewcode-block" id="all_pairs_shortest_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path.html#networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path">[docs]</a><span class="k">def</span> <span class="nf">all_pairs_shortest_path</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">cutoff</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> +<div class="viewcode-block" id="all_pairs_shortest_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path.html#networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">all_pairs_shortest_path</span><span class="p">(</span><span class="n">G</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="w"> </span><span class="sd">"""Compute shortest paths between all nodes.</span> <span class="sd"> Parameters</span> @@ -1018,11 +1036,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/shortest_paths/weighted.html b/_modules/networkx/algorithms/shortest_paths/weighted.html index 61c9e9e5..8e4adad8 100644 --- a/_modules/networkx/algorithms/shortest_paths/weighted.html +++ b/_modules/networkx/algorithms/shortest_paths/weighted.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.shortest_paths.weighted — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.shortest_paths.weighted — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/shortest_paths/weighted';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/shortest_paths/weighted.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"> @@ -1577,7 +1589,8 @@ <span class="k">yield</span> <span class="p">(</span><span class="n">n</span><span class="p">,</span> <span class="n">path</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">n</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">weight</span><span class="o">=</span><span class="n">weight</span><span class="p">))</span></div> -<div class="viewcode-block" id="bellman_ford_predecessor_and_distance"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_predecessor_and_distance.html#networkx.algorithms.shortest_paths.weighted.bellman_ford_predecessor_and_distance">[docs]</a><span class="k">def</span> <span class="nf">bellman_ford_predecessor_and_distance</span><span class="p">(</span> +<div class="viewcode-block" id="bellman_ford_predecessor_and_distance"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_predecessor_and_distance.html#networkx.algorithms.shortest_paths.weighted.bellman_ford_predecessor_and_distance">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">bellman_ford_predecessor_and_distance</span><span class="p">(</span> <span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="p">,</span> <span class="n">target</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">,</span> <span class="n">heuristic</span><span class="o">=</span><span class="kc">False</span> <span class="p">):</span> <span class="w"> </span><span class="sd">"""Compute shortest path lengths and predecessors on shortest paths</span> @@ -1917,7 +1930,8 @@ <span class="k">return</span> <span class="kc">None</span> -<div class="viewcode-block" id="bellman_ford_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path.html#networkx.algorithms.shortest_paths.weighted.bellman_ford_path">[docs]</a><span class="k">def</span> <span class="nf">bellman_ford_path</span><span class="p">(</span><span class="n">G</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="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> +<div class="viewcode-block" id="bellman_ford_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path.html#networkx.algorithms.shortest_paths.weighted.bellman_ford_path">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">bellman_ford_path</span><span class="p">(</span><span class="n">G</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="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Returns the shortest path from source to target in a weighted graph G.</span> <span class="sd"> Parameters</span> @@ -1975,7 +1989,8 @@ <span class="k">return</span> <span class="n">path</span></div> -<div class="viewcode-block" id="bellman_ford_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path_length.html#networkx.algorithms.shortest_paths.weighted.bellman_ford_path_length">[docs]</a><span class="k">def</span> <span class="nf">bellman_ford_path_length</span><span class="p">(</span><span class="n">G</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="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> +<div class="viewcode-block" id="bellman_ford_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path_length.html#networkx.algorithms.shortest_paths.weighted.bellman_ford_path_length">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">bellman_ford_path_length</span><span class="p">(</span><span class="n">G</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="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Returns the shortest path length from source to target</span> <span class="sd"> in a weighted graph.</span> @@ -2045,7 +2060,8 @@ <span class="k">raise</span> <span class="n">nx</span><span class="o">.</span><span class="n">NetworkXNoPath</span><span class="p">(</span><span class="sa">f</span><span class="s2">"node </span><span class="si">{</span><span class="n">target</span><span class="si">}</span><span class="s2"> not reachable from </span><span class="si">{</span><span class="n">source</span><span class="si">}</span><span class="s2">"</span><span class="p">)</span> <span class="kn">from</span> <span class="nn">err</span></div> -<div class="viewcode-block" id="single_source_bellman_ford_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path.html#networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path">[docs]</a><span class="k">def</span> <span class="nf">single_source_bellman_ford_path</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> +<div class="viewcode-block" id="single_source_bellman_ford_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path.html#networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">single_source_bellman_ford_path</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Compute shortest path between source and all other reachable</span> <span class="sd"> nodes for a weighted graph.</span> @@ -2100,7 +2116,8 @@ <span class="k">return</span> <span class="n">path</span></div> -<div class="viewcode-block" id="single_source_bellman_ford_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length.html#networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length">[docs]</a><span class="k">def</span> <span class="nf">single_source_bellman_ford_path_length</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> +<div class="viewcode-block" id="single_source_bellman_ford_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length.html#networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">single_source_bellman_ford_path_length</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Compute the shortest path length between source and all other</span> <span class="sd"> reachable nodes for a weighted graph.</span> @@ -2162,7 +2179,8 @@ <span class="k">return</span> <span class="n">_bellman_ford</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="p">[</span><span class="n">source</span><span class="p">],</span> <span class="n">weight</span><span class="p">)</span></div> -<div class="viewcode-block" id="single_source_bellman_ford"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford.html#networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford">[docs]</a><span class="k">def</span> <span class="nf">single_source_bellman_ford</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="p">,</span> <span class="n">target</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> +<div class="viewcode-block" id="single_source_bellman_ford"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford.html#networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">single_source_bellman_ford</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="p">,</span> <span class="n">target</span><span class="o">=</span><span class="kc">None</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Compute shortest paths and lengths in a weighted graph G.</span> <span class="sd"> Uses Bellman-Ford algorithm for shortest paths.</span> @@ -2255,7 +2273,8 @@ <span class="k">raise</span> <span class="n">nx</span><span class="o">.</span><span class="n">NetworkXNoPath</span><span class="p">(</span><span class="n">msg</span><span class="p">)</span> <span class="kn">from</span> <span class="nn">err</span></div> -<div class="viewcode-block" id="all_pairs_bellman_ford_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path_length.html#networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path_length">[docs]</a><span class="k">def</span> <span class="nf">all_pairs_bellman_ford_path_length</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> +<div class="viewcode-block" id="all_pairs_bellman_ford_path_length"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path_length.html#networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path_length">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">all_pairs_bellman_ford_path_length</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Compute shortest path lengths between all nodes in a weighted graph.</span> <span class="sd"> Parameters</span> @@ -2309,7 +2328,8 @@ <span class="k">yield</span> <span class="p">(</span><span class="n">n</span><span class="p">,</span> <span class="nb">dict</span><span class="p">(</span><span class="n">length</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">n</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="n">weight</span><span class="p">)))</span></div> -<div class="viewcode-block" id="all_pairs_bellman_ford_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path.html#networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path">[docs]</a><span class="k">def</span> <span class="nf">all_pairs_bellman_ford_path</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> +<div class="viewcode-block" id="all_pairs_bellman_ford_path"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path.html#networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path">[docs]</a><span class="nd">@nx</span><span class="o">.</span><span class="n">_dispatch</span> +<span class="k">def</span> <span class="nf">all_pairs_bellman_ford_path</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="s2">"weight"</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""Compute shortest paths between all nodes in a weighted graph.</span> <span class="sd"> Parameters</span> @@ -2940,11 +2960,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/similarity.html b/_modules/networkx/algorithms/similarity.html index 61cc66f9..f4bdf808 100644 --- a/_modules/networkx/algorithms/similarity.html +++ b/_modules/networkx/algorithms/similarity.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.similarity — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.similarity — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/similarity';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/similarity.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"> @@ -809,7 +821,7 @@ <span class="sd"> https://hal.archives-ouvertes.fr/hal-01168816</span> <span class="sd"> """</span> - <span class="n">paths</span> <span class="o">=</span> <span class="nb">list</span><span class="p">()</span> + <span class="n">paths</span> <span class="o">=</span> <span class="p">[]</span> <span class="n">bestcost</span> <span class="o">=</span> <span class="kc">None</span> <span class="k">for</span> <span class="n">vertex_path</span><span class="p">,</span> <span class="n">edge_path</span><span class="p">,</span> <span class="n">cost</span> <span class="ow">in</span> <span class="n">optimize_edit_paths</span><span class="p">(</span> <span class="n">G1</span><span class="p">,</span> @@ -827,7 +839,7 @@ <span class="p">):</span> <span class="c1"># assert bestcost is None or cost <= bestcost</span> <span class="k">if</span> <span class="n">bestcost</span> <span class="ow">is</span> <span class="ow">not</span> <span class="kc">None</span> <span class="ow">and</span> <span class="n">cost</span> <span class="o"><</span> <span class="n">bestcost</span><span class="p">:</span> - <span class="n">paths</span> <span class="o">=</span> <span class="nb">list</span><span class="p">()</span> + <span class="n">paths</span> <span class="o">=</span> <span class="p">[]</span> <span class="n">paths</span><span class="o">.</span><span class="n">append</span><span class="p">((</span><span class="n">vertex_path</span><span class="p">,</span> <span class="n">edge_path</span><span class="p">))</span> <span class="n">bestcost</span> <span class="o">=</span> <span class="n">cost</span> <span class="k">return</span> <span class="n">paths</span><span class="p">,</span> <span class="n">bestcost</span></div> @@ -1157,9 +1169,9 @@ <span class="c1"># NOTE: fast reduce of Cv relies on it</span> <span class="c1"># assert len(lsa_row_ind) == len(lsa_col_ind)</span> <span class="n">indexes</span> <span class="o">=</span> <span class="nb">zip</span><span class="p">(</span><span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">lsa_row_ind</span><span class="p">)),</span> <span class="n">lsa_row_ind</span><span class="p">,</span> <span class="n">lsa_col_ind</span><span class="p">)</span> - <span class="n">subst_ind</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">k</span> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">i</span><span class="p">,</span> <span class="n">j</span> <span class="ow">in</span> <span class="n">indexes</span> <span class="k">if</span> <span class="n">i</span> <span class="o"><</span> <span class="n">m</span> <span class="ow">and</span> <span class="n">j</span> <span class="o"><</span> <span class="n">n</span><span class="p">)</span> + <span class="n">subst_ind</span> <span class="o">=</span> <span class="p">[</span><span class="n">k</span> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">i</span><span class="p">,</span> <span class="n">j</span> <span class="ow">in</span> <span class="n">indexes</span> <span class="k">if</span> <span class="n">i</span> <span class="o"><</span> <span class="n">m</span> <span class="ow">and</span> <span class="n">j</span> <span class="o"><</span> <span class="n">n</span><span class="p">]</span> <span class="n">indexes</span> <span class="o">=</span> <span class="nb">zip</span><span class="p">(</span><span class="nb">range</span><span class="p">(</span><span class="nb">len</span><span class="p">(</span><span class="n">lsa_row_ind</span><span class="p">)),</span> <span class="n">lsa_row_ind</span><span class="p">,</span> <span class="n">lsa_col_ind</span><span class="p">)</span> - <span class="n">dummy_ind</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="n">k</span> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">i</span><span class="p">,</span> <span class="n">j</span> <span class="ow">in</span> <span class="n">indexes</span> <span class="k">if</span> <span class="n">i</span> <span class="o">>=</span> <span class="n">m</span> <span class="ow">and</span> <span class="n">j</span> <span class="o">>=</span> <span class="n">n</span><span class="p">)</span> + <span class="n">dummy_ind</span> <span class="o">=</span> <span class="p">[</span><span class="n">k</span> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">i</span><span class="p">,</span> <span class="n">j</span> <span class="ow">in</span> <span class="n">indexes</span> <span class="k">if</span> <span class="n">i</span> <span class="o">>=</span> <span class="n">m</span> <span class="ow">and</span> <span class="n">j</span> <span class="o">>=</span> <span class="n">n</span><span class="p">]</span> <span class="c1"># assert len(subst_ind) == len(dummy_ind)</span> <span class="n">lsa_row_ind</span><span class="p">[</span><span class="n">dummy_ind</span><span class="p">]</span> <span class="o">=</span> <span class="n">lsa_col_ind</span><span class="p">[</span><span class="n">subst_ind</span><span class="p">]</span> <span class="o">+</span> <span class="n">m</span> <span class="n">lsa_col_ind</span><span class="p">[</span><span class="n">dummy_ind</span><span class="p">]</span> <span class="o">=</span> <span class="n">lsa_row_ind</span><span class="p">[</span><span class="n">subst_ind</span><span class="p">]</span> <span class="o">+</span> <span class="n">n</span> @@ -1264,14 +1276,14 @@ <span class="n">C</span><span class="p">[</span><span class="n">k</span><span class="p">,</span> <span class="n">l</span><span class="p">]</span> <span class="o">=</span> <span class="n">inf</span> <span class="n">localCe</span> <span class="o">=</span> <span class="n">make_CostMatrix</span><span class="p">(</span><span class="n">C</span><span class="p">,</span> <span class="n">m</span><span class="p">,</span> <span class="n">n</span><span class="p">)</span> - <span class="n">ij</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span> + <span class="n">ij</span> <span class="o">=</span> <span class="p">[</span> <span class="p">(</span> <span class="n">g_ind</span><span class="p">[</span><span class="n">k</span><span class="p">]</span> <span class="k">if</span> <span class="n">k</span> <span class="o"><</span> <span class="n">m</span> <span class="k">else</span> <span class="n">M</span> <span class="o">+</span> <span class="n">h_ind</span><span class="p">[</span><span class="n">l</span><span class="p">],</span> <span class="n">h_ind</span><span class="p">[</span><span class="n">l</span><span class="p">]</span> <span class="k">if</span> <span class="n">l</span> <span class="o"><</span> <span class="n">n</span> <span class="k">else</span> <span class="n">N</span> <span class="o">+</span> <span class="n">g_ind</span><span class="p">[</span><span class="n">k</span><span class="p">],</span> <span class="p">)</span> <span class="k">for</span> <span class="n">k</span><span class="p">,</span> <span class="n">l</span> <span class="ow">in</span> <span class="nb">zip</span><span class="p">(</span><span class="n">localCe</span><span class="o">.</span><span class="n">lsa_row_ind</span><span class="p">,</span> <span class="n">localCe</span><span class="o">.</span><span class="n">lsa_col_ind</span><span class="p">)</span> <span class="k">if</span> <span class="n">k</span> <span class="o"><</span> <span class="n">m</span> <span class="ow">or</span> <span class="n">l</span> <span class="o"><</span> <span class="n">n</span> - <span class="p">)</span> + <span class="p">]</span> <span class="k">else</span><span class="p">:</span> <span class="n">ij</span> <span class="o">=</span> <span class="p">[]</span> @@ -1344,7 +1356,7 @@ <span class="k">yield</span> <span class="p">(</span><span class="n">i</span><span class="p">,</span> <span class="n">j</span><span class="p">),</span> <span class="n">Cv_ij</span><span class="p">,</span> <span class="n">xy</span><span class="p">,</span> <span class="n">Ce_xy</span><span class="p">,</span> <span class="n">Cv</span><span class="o">.</span><span class="n">C</span><span class="p">[</span><span class="n">i</span><span class="p">,</span> <span class="n">j</span><span class="p">]</span> <span class="o">+</span> <span class="n">localCe</span><span class="o">.</span><span class="n">ls</span> <span class="c1"># 2) other candidates, sorted by lower-bound cost estimate</span> - <span class="n">other</span> <span class="o">=</span> <span class="nb">list</span><span class="p">()</span> + <span class="n">other</span> <span class="o">=</span> <span class="p">[]</span> <span class="n">fixed_i</span><span class="p">,</span> <span class="n">fixed_j</span> <span class="o">=</span> <span class="n">i</span><span class="p">,</span> <span class="n">j</span> <span class="k">if</span> <span class="n">m</span> <span class="o"><=</span> <span class="n">n</span><span class="p">:</span> <span class="n">candidates</span> <span class="o">=</span> <span class="p">(</span> @@ -1479,16 +1491,16 @@ <span class="n">pending_h</span><span class="p">[</span><span class="n">y</span><span class="p">]</span> <span class="k">if</span> <span class="n">y</span> <span class="o"><</span> <span class="n">len_h</span> <span class="k">else</span> <span class="kc">None</span><span class="p">,</span> <span class="p">)</span> <span class="p">)</span> - <span class="n">sortedx</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="nb">sorted</span><span class="p">(</span><span class="n">x</span> <span class="k">for</span> <span class="n">x</span><span class="p">,</span> <span class="n">y</span> <span class="ow">in</span> <span class="n">xy</span><span class="p">))</span> - <span class="n">sortedy</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span><span class="nb">sorted</span><span class="p">(</span><span class="n">y</span> <span class="k">for</span> <span class="n">x</span><span class="p">,</span> <span class="n">y</span> <span class="ow">in</span> <span class="n">xy</span><span class="p">))</span> - <span class="n">G</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span> + <span class="n">sortedx</span> <span class="o">=</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">x</span> <span class="k">for</span> <span class="n">x</span><span class="p">,</span> <span class="n">y</span> <span class="ow">in</span> <span class="n">xy</span><span class="p">)</span> + <span class="n">sortedy</span> <span class="o">=</span> <span class="nb">sorted</span><span class="p">(</span><span class="n">y</span> <span class="k">for</span> <span class="n">x</span><span class="p">,</span> <span class="n">y</span> <span class="ow">in</span> <span class="n">xy</span><span class="p">)</span> + <span class="n">G</span> <span class="o">=</span> <span class="p">[</span> <span class="p">(</span><span class="n">pending_g</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="n">x</span><span class="p">)</span> <span class="k">if</span> <span class="n">x</span> <span class="o"><</span> <span class="nb">len</span><span class="p">(</span><span class="n">pending_g</span><span class="p">)</span> <span class="k">else</span> <span class="kc">None</span><span class="p">)</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="nb">reversed</span><span class="p">(</span><span class="n">sortedx</span><span class="p">)</span> - <span class="p">)</span> - <span class="n">H</span> <span class="o">=</span> <span class="nb">list</span><span class="p">(</span> + <span class="p">]</span> + <span class="n">H</span> <span class="o">=</span> <span class="p">[</span> <span class="p">(</span><span class="n">pending_h</span><span class="o">.</span><span class="n">pop</span><span class="p">(</span><span class="n">y</span><span class="p">)</span> <span class="k">if</span> <span class="n">y</span> <span class="o"><</span> <span class="nb">len</span><span class="p">(</span><span class="n">pending_h</span><span class="p">)</span> <span class="k">else</span> <span class="kc">None</span><span class="p">)</span> <span class="k">for</span> <span class="n">y</span> <span class="ow">in</span> <span class="nb">reversed</span><span class="p">(</span><span class="n">sortedy</span><span class="p">)</span> - <span class="p">)</span> + <span class="p">]</span> <span class="k">yield from</span> <span class="n">get_edit_paths</span><span class="p">(</span> <span class="n">matched_uv</span><span class="p">,</span> @@ -2059,7 +2071,7 @@ <span class="n">top_k_sorted</span> <span class="o">=</span> <span class="n">top_k_unsorted</span><span class="p">[</span><span class="n">np</span><span class="o">.</span><span class="n">argsort</span><span class="p">(</span><span class="n">S</span><span class="p">[</span><span class="n">top_k_unsorted</span><span class="p">])][::</span><span class="o">-</span><span class="mi">1</span><span class="p">]</span> <span class="c1"># Add back the similarity scores</span> - <span class="n">top_k_sorted_names</span> <span class="o">=</span> <span class="nb">map</span><span class="p">(</span><span class="k">lambda</span> <span class="n">n</span><span class="p">:</span> <span class="n">node_map</span><span class="p">[</span><span class="n">n</span><span class="p">],</span> <span class="n">top_k_sorted</span><span class="p">)</span> + <span class="n">top_k_sorted_names</span> <span class="o">=</span> <span class="p">(</span><span class="n">node_map</span><span class="p">[</span><span class="n">n</span><span class="p">]</span> <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">top_k_sorted</span><span class="p">)</span> <span class="n">top_k_with_val</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">(</span><span class="nb">zip</span><span class="p">(</span><span class="n">top_k_sorted_names</span><span class="p">,</span> <span class="n">S</span><span class="p">[</span><span class="n">top_k_sorted</span><span class="p">]))</span> <span class="c1"># Remove the self-similarity</span> @@ -2177,11 +2189,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/simple_paths.html b/_modules/networkx/algorithms/simple_paths.html index 77138848..07b6a823 100644 --- a/_modules/networkx/algorithms/simple_paths.html +++ b/_modules/networkx/algorithms/simple_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.simple_paths — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.simple_paths — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/simple_paths';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/simple_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"> @@ -896,7 +908,7 @@ <span class="n">visited</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="n">child</span><span class="p">)</span> <span class="n">stack</span><span class="o">.</span><span class="n">append</span><span class="p">(</span><span class="nb">iter</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">(</span><span class="n">child</span><span class="p">[</span><span class="mi">1</span><span class="p">],</span> <span class="n">keys</span><span class="o">=</span><span class="kc">True</span><span class="p">)))</span> <span class="k">else</span><span class="p">:</span> <span class="c1"># len(visited) == cutoff:</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="n">k</span><span class="p">)</span> <span class="ow">in</span> <span class="p">[</span><span class="n">child</span><span class="p">]</span> <span class="o">+</span> <span class="nb">list</span><span class="p">(</span><span class="n">children</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="p">,</span> <span class="n">k</span> <span class="ow">in</span> <span class="p">[</span><span class="n">child</span><span class="p">]</span> <span class="o">+</span> <span class="nb">list</span><span class="p">(</span><span class="n">children</span><span class="p">):</span> <span class="k">if</span> <span class="n">v</span> <span class="ow">in</span> <span class="n">targets</span><span class="p">:</span> <span class="k">yield</span> <span class="n">visited</span><span class="p">[</span><span class="mi">1</span><span class="p">:]</span> <span class="o">+</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="p">)]</span> <span class="n">stack</span><span class="o">.</span><span class="n">pop</span><span class="p">()</span> @@ -1010,7 +1022,7 @@ <span class="n">shortest_path_func</span> <span class="o">=</span> <span class="n">_bidirectional_dijkstra</span> - <span class="n">listA</span> <span class="o">=</span> <span class="nb">list</span><span class="p">()</span> + <span class="n">listA</span> <span class="o">=</span> <span class="p">[]</span> <span class="n">listB</span> <span class="o">=</span> <span class="n">PathBuffer</span><span class="p">()</span> <span class="n">prev_path</span> <span class="o">=</span> <span class="kc">None</span> <span class="k">while</span> <span class="kc">True</span><span class="p">:</span> @@ -1053,7 +1065,7 @@ <span class="k">class</span> <span class="nc">PathBuffer</span><span class="p">:</span> <span class="k">def</span> <span class="fm">__init__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span> <span class="bp">self</span><span class="o">.</span><span class="n">paths</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span> - <span class="bp">self</span><span class="o">.</span><span class="n">sortedpaths</span> <span class="o">=</span> <span class="nb">list</span><span class="p">()</span> + <span class="bp">self</span><span class="o">.</span><span class="n">sortedpaths</span> <span class="o">=</span> <span class="p">[]</span> <span class="bp">self</span><span class="o">.</span><span class="n">counter</span> <span class="o">=</span> <span class="n">count</span><span class="p">()</span> <span class="k">def</span> <span class="fm">__len__</span><span class="p">(</span><span class="bp">self</span><span class="p">):</span> @@ -1450,11 +1462,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/smallworld.html b/_modules/networkx/algorithms/smallworld.html index 4800d028..6dea3b08 100644 --- a/_modules/networkx/algorithms/smallworld.html +++ b/_modules/networkx/algorithms/smallworld.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.smallworld — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.smallworld — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/smallworld';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/smallworld.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"> @@ -592,7 +604,7 @@ <span class="sd"> An undirected graph.</span> <span class="sd"> niter : integer (optional, default=1)</span> -<span class="sd"> An edge is rewired approximatively niter times.</span> +<span class="sd"> An edge is rewired approximately niter times.</span> <span class="sd"> D : numpy.array (optional, default=None)</span> <span class="sd"> Distance to the diagonal matrix.</span> @@ -874,11 +886,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/smetric.html b/_modules/networkx/algorithms/smetric.html index 00cd4176..3de9bb53 100644 --- a/_modules/networkx/algorithms/smetric.html +++ b/_modules/networkx/algorithms/smetric.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.smetric — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.smetric — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/smetric';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/smetric.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"> @@ -514,11 +526,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/sparsifiers.html b/_modules/networkx/algorithms/sparsifiers.html index e889a918..f12f0def 100644 --- a/_modules/networkx/algorithms/sparsifiers.html +++ b/_modules/networkx/algorithms/sparsifiers.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.sparsifiers — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.sparsifiers — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/sparsifiers';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/sparsifiers.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"> @@ -769,11 +781,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/structuralholes.html b/_modules/networkx/algorithms/structuralholes.html index a1f3c86c..c73e01b4 100644 --- a/_modules/networkx/algorithms/structuralholes.html +++ b/_modules/networkx/algorithms/structuralholes.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.structuralholes — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.structuralholes — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/structuralholes';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/structuralholes.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"> @@ -754,11 +766,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/summarization.html b/_modules/networkx/algorithms/summarization.html index 7bd44172..585ffa64 100644 --- a/_modules/networkx/algorithms/summarization.html +++ b/_modules/networkx/algorithms/summarization.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.summarization — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.summarization — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/summarization';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/summarization.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"> @@ -483,7 +495,7 @@ <span class="sd">a graph. Edge-grouping techniques can be lossless, meaning that they can be</span> <span class="sd">used to re-create the original graph, or techniques can be lossy, requiring</span> <span class="sd">less space to store the summary graph, but at the expense of lower</span> -<span class="sd">recontruction accuracy of the original graph.</span> +<span class="sd">reconstruction accuracy of the original graph.</span> <span class="sd">Bit-compression techniques minimize the amount of information needed to</span> <span class="sd">describe the original graph, while revealing structural patterns in the</span> @@ -640,20 +652,20 @@ <span class="n">high_degree_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">degrees</span> <span class="k">if</span> <span class="n">d</span> <span class="o">></span> <span class="n">threshold</span><span class="p">}</span> <span class="n">low_degree_nodes</span> <span class="o">=</span> <span class="n">G</span><span class="o">.</span><span class="n">nodes</span><span class="p">()</span> <span class="o">-</span> <span class="n">high_degree_nodes</span> - <span class="n">auxillary</span> <span class="o">=</span> <span class="p">{}</span> + <span class="n">auxiliary</span> <span class="o">=</span> <span class="p">{}</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">G</span><span class="p">:</span> <span class="n">high_degree_neighbors</span> <span class="o">=</span> <span class="nb">frozenset</span><span class="p">(</span><span class="n">high_degree_nodes</span> <span class="o">&</span> <span class="nb">set</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="k">if</span> <span class="n">high_degree_neighbors</span><span class="p">:</span> - <span class="k">if</span> <span class="n">high_degree_neighbors</span> <span class="ow">in</span> <span class="n">auxillary</span><span class="p">:</span> - <span class="n">auxillary</span><span class="p">[</span><span class="n">high_degree_neighbors</span><span class="p">]</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">node</span><span class="p">)</span> + <span class="k">if</span> <span class="n">high_degree_neighbors</span> <span class="ow">in</span> <span class="n">auxiliary</span><span class="p">:</span> + <span class="n">auxiliary</span><span class="p">[</span><span class="n">high_degree_neighbors</span><span class="p">]</span><span class="o">.</span><span class="n">add</span><span class="p">(</span><span class="n">node</span><span class="p">)</span> <span class="k">else</span><span class="p">:</span> - <span class="n">auxillary</span><span class="p">[</span><span class="n">high_degree_neighbors</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span><span class="n">node</span><span class="p">}</span> + <span class="n">auxiliary</span><span class="p">[</span><span class="n">high_degree_neighbors</span><span class="p">]</span> <span class="o">=</span> <span class="p">{</span><span class="n">node</span><span class="p">}</span> <span class="k">if</span> <span class="n">copy</span><span class="p">:</span> <span class="n">G</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="n">compressor_nodes</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span> - <span class="k">for</span> <span class="n">index</span><span class="p">,</span> <span class="p">(</span><span class="n">high_degree_nodes</span><span class="p">,</span> <span class="n">low_degree_nodes</span><span class="p">)</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">auxillary</span><span class="o">.</span><span class="n">items</span><span class="p">()):</span> + <span class="k">for</span> <span class="n">index</span><span class="p">,</span> <span class="p">(</span><span class="n">high_degree_nodes</span><span class="p">,</span> <span class="n">low_degree_nodes</span><span class="p">)</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">auxiliary</span><span class="o">.</span><span class="n">items</span><span class="p">()):</span> <span class="n">low_degree_node_count</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">low_degree_nodes</span><span class="p">)</span> <span class="n">high_degree_node_count</span> <span class="o">=</span> <span class="nb">len</span><span class="p">(</span><span class="n">high_degree_nodes</span><span class="p">)</span> <span class="n">old_edges</span> <span class="o">=</span> <span class="n">high_degree_node_count</span> <span class="o">*</span> <span class="n">low_degree_node_count</span> @@ -722,7 +734,7 @@ <span class="sd"> summary graph: Networkx graph</span> <span class="sd"> """</span> <span class="n">output</span> <span class="o">=</span> <span class="n">G</span><span class="o">.</span><span class="vm">__class__</span><span class="p">()</span> - <span class="n">node_label_lookup</span> <span class="o">=</span> <span class="nb">dict</span><span class="p">()</span> + <span class="n">node_label_lookup</span> <span class="o">=</span> <span class="p">{}</span> <span class="k">for</span> <span class="n">index</span><span class="p">,</span> <span class="n">group_id</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">groups</span><span class="p">):</span> <span class="n">group_set</span> <span class="o">=</span> <span class="n">groups</span><span class="p">[</span><span class="n">group_id</span><span class="p">]</span> <span class="n">supernode</span> <span class="o">=</span> <span class="sa">f</span><span class="s2">"</span><span class="si">{</span><span class="n">prefix</span><span class="si">}{</span><span class="n">index</span><span class="si">}</span><span class="s2">"</span> @@ -1031,11 +1043,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/swap.html b/_modules/networkx/algorithms/swap.html index 27e7bbe0..0b916a72 100644 --- a/_modules/networkx/algorithms/swap.html +++ b/_modules/networkx/algorithms/swap.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.swap — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.swap — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/swap';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/swap.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"> @@ -766,8 +778,8 @@ <span class="n">swapcount</span> <span class="o">=</span> <span class="mi">0</span> <span class="n">deg</span> <span class="o">=</span> <span class="n">G</span><span class="o">.</span><span class="n">degree</span><span class="p">()</span> <span class="c1"># Label key for nodes</span> - <span class="n">dk</span> <span class="o">=</span> <span class="nb">list</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="n">cdf</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">utils</span><span class="o">.</span><span class="n">cumulative_distribution</span><span class="p">(</span><span class="nb">list</span><span class="p">(</span><span class="n">d</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="n">dk</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="n">cdf</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">utils</span><span class="o">.</span><span class="n">cumulative_distribution</span><span class="p">([</span><span class="n">d</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="n">discrete_sequence</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">utils</span><span class="o">.</span><span class="n">discrete_sequence</span> <span class="n">window</span> <span class="o">=</span> <span class="mi">1</span> <span class="k">while</span> <span class="n">n</span> <span class="o"><</span> <span class="n">nswap</span><span class="p">:</span> @@ -877,11 +889,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/threshold.html b/_modules/networkx/algorithms/threshold.html index 45c6128d..4e8df71e 100644 --- a/_modules/networkx/algorithms/threshold.html +++ b/_modules/networkx/algorithms/threshold.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.threshold — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.threshold — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/threshold';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/threshold.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"> @@ -500,18 +512,18 @@ <span class="sd"> ----------</span> <span class="sd"> .. [1] Threshold graphs: https://en.wikipedia.org/wiki/Threshold_graph</span> <span class="sd"> """</span> - <span class="k">return</span> <span class="n">is_threshold_sequence</span><span class="p">(</span><span class="nb">list</span><span class="p">(</span><span class="n">d</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></div> + <span class="k">return</span> <span class="n">is_threshold_sequence</span><span class="p">([</span><span class="n">d</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></div> <span class="k">def</span> <span class="nf">is_threshold_sequence</span><span class="p">(</span><span class="n">degree_sequence</span><span class="p">):</span> <span class="w"> </span><span class="sd">"""</span> -<span class="sd"> Returns True if the sequence is a threshold degree seqeunce.</span> +<span class="sd"> Returns True if the sequence is a threshold degree sequence.</span> <span class="sd"> Uses the property that a threshold graph must be constructed by</span> <span class="sd"> adding either dominating or isolated nodes. Thus, it can be</span> <span class="sd"> deconstructed iteratively by removing a node of degree zero or a</span> <span class="sd"> node that connects to the remaining nodes. If this deconstruction</span> -<span class="sd"> failes then the sequence is not a threshold sequence.</span> +<span class="sd"> fails then the sequence is not a threshold sequence.</span> <span class="sd"> """</span> <span class="n">ds</span> <span class="o">=</span> <span class="n">degree_sequence</span><span class="p">[:]</span> <span class="c1"># get a copy so we don't destroy original</span> <span class="n">ds</span><span class="o">.</span><span class="n">sort</span><span class="p">()</span> @@ -558,7 +570,7 @@ <span class="k">raise</span> <span class="ne">ValueError</span><span class="p">(</span><span class="s2">"compact sequences cannot be labeled"</span><span class="p">)</span> <span class="c1"># make an indexed copy</span> - <span class="k">if</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">degree_sequence</span><span class="p">,</span> <span class="nb">dict</span><span class="p">):</span> <span class="c1"># labeled degree seqeunce</span> + <span class="k">if</span> <span class="nb">isinstance</span><span class="p">(</span><span class="n">degree_sequence</span><span class="p">,</span> <span class="nb">dict</span><span class="p">):</span> <span class="c1"># labeled degree sequence</span> <span class="n">ds</span> <span class="o">=</span> <span class="p">[[</span><span class="n">degree</span><span class="p">,</span> <span class="n">label</span><span class="p">]</span> <span class="k">for</span> <span class="p">(</span><span class="n">label</span><span class="p">,</span> <span class="n">degree</span><span class="p">)</span> <span class="ow">in</span> <span class="n">degree_sequence</span><span class="o">.</span><span class="n">items</span><span class="p">()]</span> <span class="k">else</span><span class="p">:</span> <span class="n">ds</span> <span class="o">=</span> <span class="p">[[</span><span class="n">d</span><span class="p">,</span> <span class="n">i</span><span class="p">]</span> <span class="k">for</span> <span class="n">i</span><span class="p">,</span> <span class="n">d</span> <span class="ow">in</span> <span class="nb">enumerate</span><span class="p">(</span><span class="n">degree_sequence</span><span class="p">)]</span> @@ -820,7 +832,7 @@ <span class="sd"> Otherwise returns the cycle as [a,b,c,d] where (a,b)</span> <span class="sd"> and (c,d) are edges and (a,c) and (b,d) are not.</span> <span class="sd"> """</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">G</span><span class="o">.</span><span class="n">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="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">():</span> <span class="k">for</span> <span class="n">w</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">nodes</span><span class="p">():</span> <span class="k">if</span> <span class="ow">not</span> <span class="n">G</span><span class="o">.</span><span class="n">has_edge</span><span class="p">(</span><span class="n">u</span><span class="p">,</span> <span class="n">w</span><span class="p">)</span> <span class="ow">and</span> <span class="n">u</span> <span class="o">!=</span> <span class="n">w</span><span class="p">:</span> <span class="k">for</span> <span class="n">x</span> <span class="ow">in</span> <span class="n">G</span><span class="o">.</span><span class="n">neighbors</span><span class="p">(</span><span class="n">w</span><span class="p">):</span> @@ -1131,7 +1143,7 @@ <span class="n">cs</span> <span class="o">=</span> <span class="n">creation_sequence</span> <span class="n">seq</span> <span class="o">=</span> <span class="p">[]</span> <span class="c1"># betweenness</span> <span class="n">lastchar</span> <span class="o">=</span> <span class="s2">"d"</span> <span class="c1"># first node is always a 'd'</span> - <span class="n">dr</span> <span class="o">=</span> <span class="nb">float</span><span class="p">(</span><span class="n">cs</span><span class="o">.</span><span class="n">count</span><span class="p">(</span><span class="s2">"d"</span><span class="p">))</span> <span class="c1"># number of d's to the right of curren pos</span> + <span class="n">dr</span> <span class="o">=</span> <span class="nb">float</span><span class="p">(</span><span class="n">cs</span><span class="o">.</span><span class="n">count</span><span class="p">(</span><span class="s2">"d"</span><span class="p">))</span> <span class="c1"># number of d's to the right of current pos</span> <span class="n">irun</span> <span class="o">=</span> <span class="mi">0</span> <span class="c1"># number of i's in the last run</span> <span class="n">drun</span> <span class="o">=</span> <span class="mi">0</span> <span class="c1"># number of d's in the last run</span> <span class="n">dlast</span> <span class="o">=</span> <span class="mf">0.0</span> <span class="c1"># betweenness of last d</span> @@ -1449,11 +1461,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/tournament.html b/_modules/networkx/algorithms/tournament.html index 101e895c..a1d24d84 100644 --- a/_modules/networkx/algorithms/tournament.html +++ b/_modules/networkx/algorithms/tournament.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.tournament — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.tournament — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/tournament';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/tournament.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"> @@ -869,11 +881,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/traversal/beamsearch.html b/_modules/networkx/algorithms/traversal/beamsearch.html index e8c9dd3d..ef66bcc4 100644 --- a/_modules/networkx/algorithms/traversal/beamsearch.html +++ b/_modules/networkx/algorithms/traversal/beamsearch.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.traversal.beamsearch — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.traversal.beamsearch — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/traversal/beamsearch';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/traversal/beamsearch.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"> @@ -579,11 +591,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/traversal/breadth_first_search.html b/_modules/networkx/algorithms/traversal/breadth_first_search.html index a89dc704..5d476787 100644 --- a/_modules/networkx/algorithms/traversal/breadth_first_search.html +++ b/_modules/networkx/algorithms/traversal/breadth_first_search.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.traversal.breadth_first_search — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.traversal.breadth_first_search — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/traversal/breadth_first_search';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/traversal/breadth_first_search.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"> @@ -877,7 +889,7 @@ <span class="c1"># same distance from sources at each iteration</span> <span class="k">while</span> <span class="n">current_layer</span><span class="p">:</span> <span class="k">yield</span> <span class="n">current_layer</span> - <span class="n">next_layer</span> <span class="o">=</span> <span class="nb">list</span><span class="p">()</span> + <span class="n">next_layer</span> <span class="o">=</span> <span class="p">[]</span> <span class="k">for</span> <span class="n">node</span> <span class="ow">in</span> <span class="n">current_layer</span><span class="p">:</span> <span class="k">for</span> <span class="n">child</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">child</span> <span class="ow">not</span> <span class="ow">in</span> <span class="n">visited</span><span class="p">:</span> @@ -937,11 +949,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/traversal/depth_first_search.html b/_modules/networkx/algorithms/traversal/depth_first_search.html index ef9b18e7..b2bc52b9 100644 --- a/_modules/networkx/algorithms/traversal/depth_first_search.html +++ b/_modules/networkx/algorithms/traversal/depth_first_search.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.traversal.depth_first_search — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.traversal.depth_first_search — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/traversal/depth_first_search';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/traversal/depth_first_search.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"> @@ -923,11 +935,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/traversal/edgebfs.html b/_modules/networkx/algorithms/traversal/edgebfs.html index 5fdf851f..4c6f4ec9 100644 --- a/_modules/networkx/algorithms/traversal/edgebfs.html +++ b/_modules/networkx/algorithms/traversal/edgebfs.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.traversal.edgebfs — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.traversal.edgebfs — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/traversal/edgebfs';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/traversal/edgebfs.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"> @@ -620,7 +632,7 @@ <span class="n">check_reverse</span> <span class="o">=</span> <span class="n">directed</span> <span class="ow">and</span> <span class="n">orientation</span> <span class="ow">in</span> <span class="p">(</span><span class="s2">"reverse"</span><span class="p">,</span> <span class="s2">"ignore"</span><span class="p">)</span> <span class="c1"># start BFS</span> - <span class="n">visited_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="ow">in</span> <span class="n">nodes</span><span class="p">}</span> + <span class="n">visited_nodes</span> <span class="o">=</span> <span class="nb">set</span><span class="p">(</span><span class="n">nodes</span><span class="p">)</span> <span class="n">visited_edges</span> <span class="o">=</span> <span class="nb">set</span><span class="p">()</span> <span class="n">queue</span> <span class="o">=</span> <span class="n">deque</span><span class="p">([(</span><span class="n">n</span><span class="p">,</span> <span class="n">edges_from</span><span class="p">(</span><span class="n">n</span><span class="p">))</span> <span class="k">for</span> <span class="n">n</span> <span class="ow">in</span> <span class="n">nodes</span><span class="p">])</span> <span class="k">while</span> <span class="n">queue</span><span class="p">:</span> @@ -651,11 +663,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/traversal/edgedfs.html b/_modules/networkx/algorithms/traversal/edgedfs.html index a23c1ce6..9fa9c0bf 100644 --- a/_modules/networkx/algorithms/traversal/edgedfs.html +++ b/_modules/networkx/algorithms/traversal/edgedfs.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.traversal.edgedfs — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.traversal.edgedfs — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/traversal/edgedfs';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/traversal/edgedfs.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"> @@ -649,11 +661,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/tree/branchings.html b/_modules/networkx/algorithms/tree/branchings.html index 4f521d08..fea70844 100644 --- a/_modules/networkx/algorithms/tree/branchings.html +++ b/_modules/networkx/algorithms/tree/branchings.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.tree.branchings — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.tree.branchings — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/tree/branchings';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/tree/branchings.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"> @@ -815,7 +827,7 @@ <span class="n">d</span><span class="p">[</span><span class="n">partition</span><span class="p">]</span> <span class="o">=</span> <span class="n">data</span><span class="o">.</span><span class="n">get</span><span class="p">(</span><span class="n">partition</span><span class="p">)</span> <span class="k">if</span> <span class="n">preserve_attrs</span><span class="p">:</span> - <span class="k">for</span> <span class="p">(</span><span class="n">d_k</span><span class="p">,</span> <span class="n">d_v</span><span class="p">)</span> <span class="ow">in</span> <span class="n">data</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> + <span class="k">for</span> <span class="n">d_k</span><span class="p">,</span> <span class="n">d_v</span> <span class="ow">in</span> <span class="n">data</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> <span class="k">if</span> <span class="n">d_k</span> <span class="o">!=</span> <span class="n">attr</span><span class="p">:</span> <span class="n">d</span><span class="p">[</span><span class="n">d_k</span><span class="p">]</span> <span class="o">=</span> <span class="n">d_v</span> @@ -1161,7 +1173,7 @@ <span class="c1"># Optionally, preserve the other edge attributes of the original</span> <span class="c1"># graph</span> <span class="k">if</span> <span class="n">preserve_attrs</span><span class="p">:</span> - <span class="k">for</span> <span class="p">(</span><span class="n">key</span><span class="p">,</span> <span class="n">value</span><span class="p">)</span> <span class="ow">in</span> <span class="n">d</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> + <span class="k">for</span> <span class="n">key</span><span class="p">,</span> <span class="n">value</span> <span class="ow">in</span> <span class="n">d</span><span class="o">.</span><span class="n">items</span><span class="p">():</span> <span class="k">if</span> <span class="n">key</span> <span class="ow">not</span> <span class="ow">in</span> <span class="p">[</span><span class="bp">self</span><span class="o">.</span><span class="n">attr</span><span class="p">,</span> <span class="bp">self</span><span class="o">.</span><span class="n">candidate_attr</span><span class="p">]:</span> <span class="n">dd</span><span class="p">[</span><span class="n">key</span><span class="p">]</span> <span class="o">=</span> <span class="n">value</span> @@ -1395,7 +1407,7 @@ <span class="bp">self</span><span class="o">.</span><span class="n">partition_queue</span><span class="o">.</span><span class="n">put</span><span class="p">(</span> <span class="bp">self</span><span class="o">.</span><span class="n">Partition</span><span class="p">(</span> <span class="n">mst_weight</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">minimum</span> <span class="k">else</span> <span class="o">-</span><span class="n">mst_weight</span><span class="p">,</span> - <span class="nb">dict</span><span class="p">()</span> + <span class="p">{}</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">init_partition</span> <span class="ow">is</span> <span class="kc">None</span> <span class="k">else</span> <span class="bp">self</span><span class="o">.</span><span class="n">init_partition</span><span class="o">.</span><span class="n">partition_dict</span><span class="p">,</span> <span class="p">)</span> @@ -1523,11 +1535,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/tree/coding.html b/_modules/networkx/algorithms/tree/coding.html index 7201bd2b..4e0d327c 100644 --- a/_modules/networkx/algorithms/tree/coding.html +++ b/_modules/networkx/algorithms/tree/coding.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.tree.coding — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.tree.coding — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/tree/coding';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/tree/coding.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"> @@ -873,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/tree/decomposition.html b/_modules/networkx/algorithms/tree/decomposition.html index 3015dd5e..4fef731c 100644 --- a/_modules/networkx/algorithms/tree/decomposition.html +++ b/_modules/networkx/algorithms/tree/decomposition.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.tree.decomposition — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.tree.decomposition — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/tree/decomposition';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/tree/decomposition.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"> @@ -562,11 +574,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/tree/mst.html b/_modules/networkx/algorithms/tree/mst.html index 2ac894cf..673eb6f2 100644 --- a/_modules/networkx/algorithms/tree/mst.html +++ b/_modules/networkx/algorithms/tree/mst.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.tree.mst — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.tree.mst — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/tree/mst';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/tree/mst.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"> @@ -1310,10 +1322,10 @@ <span class="sd"> Find the sum of weights of the spanning trees of `G` using the</span> <span class="sd"> approioate `method`.</span> -<span class="sd"> This is easy if the choosen method is 'multiplicative', since we can</span> +<span class="sd"> This is easy if the chosen method is 'multiplicative', since we can</span> <span class="sd"> use Kirchhoff's Tree Matrix Theorem directly. However, with the</span> <span class="sd"> 'additive' method, this process is slightly more complex and less</span> -<span class="sd"> computatiionally efficent as we have to find the number of spanning</span> +<span class="sd"> computatiionally efficient as we have to find the number of spanning</span> <span class="sd"> trees which contain each possible edge in the graph.</span> <span class="sd"> Parameters</span> @@ -1345,7 +1357,7 @@ <span class="c1"># the number of spanning trees which have to include that edge. This</span> <span class="c1"># can be accomplished by contracting the edge and finding the</span> <span class="c1"># multiplicative total spanning tree weight if the weight of each edge</span> - <span class="c1"># is assumed to be 1, which is conviently built into networkx already,</span> + <span class="c1"># is assumed to be 1, which is conveniently built into networkx already,</span> <span class="c1"># by calling total_spanning_tree_weight with weight=None</span> <span class="k">else</span><span class="p">:</span> <span class="n">total</span> <span class="o">=</span> <span class="mi">0</span> @@ -1485,7 +1497,7 @@ <span class="p">)</span><span class="o">.</span><span class="n">size</span><span class="p">(</span><span class="n">weight</span><span class="o">=</span><span class="bp">self</span><span class="o">.</span><span class="n">weight</span><span class="p">)</span> <span class="bp">self</span><span class="o">.</span><span class="n">partition_queue</span><span class="o">.</span><span class="n">put</span><span class="p">(</span> - <span class="bp">self</span><span class="o">.</span><span class="n">Partition</span><span class="p">(</span><span class="n">mst_weight</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">minimum</span> <span class="k">else</span> <span class="o">-</span><span class="n">mst_weight</span><span class="p">,</span> <span class="nb">dict</span><span class="p">())</span> + <span class="bp">self</span><span class="o">.</span><span class="n">Partition</span><span class="p">(</span><span class="n">mst_weight</span> <span class="k">if</span> <span class="bp">self</span><span class="o">.</span><span class="n">minimum</span> <span class="k">else</span> <span class="o">-</span><span class="n">mst_weight</span><span class="p">,</span> <span class="p">{})</span> <span class="p">)</span> <span class="k">return</span> <span class="bp">self</span> @@ -1587,11 +1599,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/tree/operations.html b/_modules/networkx/algorithms/tree/operations.html index 90520311..957152b7 100644 --- a/_modules/networkx/algorithms/tree/operations.html +++ b/_modules/networkx/algorithms/tree/operations.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.tree.operations — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.tree.operations — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/tree/operations';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/tree/operations.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"> @@ -581,11 +593,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/tree/recognition.html b/_modules/networkx/algorithms/tree/recognition.html index 9c10710b..65fc2337 100644 --- a/_modules/networkx/algorithms/tree/recognition.html +++ b/_modules/networkx/algorithms/tree/recognition.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.tree.recognition — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.tree.recognition — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/tree/recognition';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/tree/recognition.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"> @@ -744,11 +756,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/triads.html b/_modules/networkx/algorithms/triads.html index 394588ed..9d561fed 100644 --- a/_modules/networkx/algorithms/triads.html +++ b/_modules/networkx/algorithms/triads.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.triads — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.triads — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/triads';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/triads.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"> @@ -847,7 +859,7 @@ <span class="sd"> - 210: 1 -> 2 <-> 3, 1 <-> 3</span> <span class="sd"> - 300: 1 <-> 2 <-> 3, 1 <-> 3</span> -<span class="sd"> Refer to the :doc:`example gallery <auto_examples/graph/plot_triad_types>`</span> +<span class="sd"> Refer to the :doc:`example gallery </auto_examples/graph/plot_triad_types>`</span> <span class="sd"> for visual examples of the triad types.</span> <span class="sd"> Parameters</span> @@ -921,7 +933,7 @@ <span class="sd"> {m} = number of mutual ties (takes 0, 1, 2, 3); a mutual tie is (0,1)</span> <span class="sd"> AND (1,0)</span> -<span class="sd"> {a} = number of assymmetric ties (takes 0, 1, 2, 3); an assymmetric tie</span> +<span class="sd"> {a} = number of asymmetric ties (takes 0, 1, 2, 3); an asymmetric tie</span> <span class="sd"> is (0,1) BUT NOT (1,0) or vice versa</span> <span class="sd"> {n} = number of null ties (takes 0, 1, 2, 3); a null tie is NEITHER</span> <span class="sd"> (0,1) NOR (1,0)</span> @@ -953,7 +965,7 @@ <span class="k">elif</span> <span class="n">e1</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">==</span> <span class="n">e2</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="ow">or</span> <span class="n">e2</span><span class="p">[</span><span class="mi">1</span><span class="p">]</span> <span class="o">==</span> <span class="n">e1</span><span class="p">[</span><span class="mi">0</span><span class="p">]:</span> <span class="k">return</span> <span class="s2">"021C"</span> <span class="k">elif</span> <span class="n">num_edges</span> <span class="o">==</span> <span class="mi">3</span><span class="p">:</span> - <span class="k">for</span> <span class="p">(</span><span class="n">e1</span><span class="p">,</span> <span class="n">e2</span><span class="p">,</span> <span class="n">e3</span><span class="p">)</span> <span class="ow">in</span> <span class="n">permutations</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">(),</span> <span class="mi">3</span><span class="p">):</span> + <span class="k">for</span> <span class="n">e1</span><span class="p">,</span> <span class="n">e2</span><span class="p">,</span> <span class="n">e3</span> <span class="ow">in</span> <span class="n">permutations</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">(),</span> <span class="mi">3</span><span class="p">):</span> <span class="k">if</span> <span class="nb">set</span><span class="p">(</span><span class="n">e1</span><span class="p">)</span> <span class="o">==</span> <span class="nb">set</span><span class="p">(</span><span class="n">e2</span><span class="p">):</span> <span class="k">if</span> <span class="n">e3</span><span class="p">[</span><span class="mi">0</span><span class="p">]</span> <span class="ow">in</span> <span class="n">e1</span><span class="p">:</span> <span class="k">return</span> <span class="s2">"111U"</span> @@ -965,7 +977,7 @@ <span class="c1"># e3 == (e1[0], e2[1]) and e2 == (e1[1], e3[1]):</span> <span class="k">return</span> <span class="s2">"030T"</span> <span class="k">elif</span> <span class="n">num_edges</span> <span class="o">==</span> <span class="mi">4</span><span class="p">:</span> - <span class="k">for</span> <span class="p">(</span><span class="n">e1</span><span class="p">,</span> <span class="n">e2</span><span class="p">,</span> <span class="n">e3</span><span class="p">,</span> <span class="n">e4</span><span class="p">)</span> <span class="ow">in</span> <span class="n">permutations</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">(),</span> <span class="mi">4</span><span class="p">):</span> + <span class="k">for</span> <span class="n">e1</span><span class="p">,</span> <span class="n">e2</span><span class="p">,</span> <span class="n">e3</span><span class="p">,</span> <span class="n">e4</span> <span class="ow">in</span> <span class="n">permutations</span><span class="p">(</span><span class="n">G</span><span class="o">.</span><span class="n">edges</span><span class="p">(),</span> <span class="mi">4</span><span class="p">):</span> <span class="k">if</span> <span class="nb">set</span><span class="p">(</span><span class="n">e1</span><span class="p">)</span> <span class="o">==</span> <span class="nb">set</span><span class="p">(</span><span class="n">e2</span><span class="p">):</span> <span class="c1"># identify pair of symmetric edges (which necessarily exists)</span> <span class="k">if</span> <span class="nb">set</span><span class="p">(</span><span class="n">e3</span><span class="p">)</span> <span class="o">==</span> <span class="nb">set</span><span class="p">(</span><span class="n">e4</span><span class="p">):</span> @@ -1083,11 +1095,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/vitality.html b/_modules/networkx/algorithms/vitality.html index 789c9102..6e041375 100644 --- a/_modules/networkx/algorithms/vitality.html +++ b/_modules/networkx/algorithms/vitality.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.vitality — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.vitality — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/vitality';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/vitality.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"> @@ -550,11 +562,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/voronoi.html b/_modules/networkx/algorithms/voronoi.html index d8cc0aa0..bdf55f56 100644 --- a/_modules/networkx/algorithms/voronoi.html +++ b/_modules/networkx/algorithms/voronoi.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.voronoi — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.voronoi — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/voronoi';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/voronoi.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"> @@ -472,9 +484,9 @@ <span class="w"> </span><span class="sd">"""Returns the Voronoi cells centered at `center_nodes` with respect</span> <span class="sd"> to the shortest-path distance metric.</span> -<span class="sd"> If *C* is a set of nodes in the graph and *c* is an element of *C*,</span> -<span class="sd"> the *Voronoi cell* centered at a node *c* is the set of all nodes</span> -<span class="sd"> *v* that are closer to *c* than to any other center node in *C* with</span> +<span class="sd"> If $C$ is a set of nodes in the graph and $c$ is an element of $C$,</span> +<span class="sd"> the *Voronoi cell* centered at a node $c$ is the set of all nodes</span> +<span class="sd"> $v$ that are closer to $c$ than to any other center node in $C$ with</span> <span class="sd"> respect to the shortest-path distance metric. [1]_</span> <span class="sd"> For directed graphs, this will compute the "outward" Voronoi cells,</span> @@ -525,10 +537,9 @@ <span class="sd"> References</span> <span class="sd"> ----------</span> -<span class="sd"> .. [1] Erwig, Martin. (2000),</span> -<span class="sd"> "The graph Voronoi diagram with applications."</span> -<span class="sd"> *Networks*, 36: 156--163.</span> -<span class="sd"> <dx.doi.org/10.1002/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L></span> +<span class="sd"> .. [1] Erwig, Martin. (2000),"The graph Voronoi diagram with applications."</span> +<span class="sd"> *Networks*, 36: 156--163.</span> +<span class="sd"> https://doi.org/10.1002/1097-0037(200010)36:3<156::AID-NET2>3.0.CO;2-L</span> <span class="sd"> """</span> <span class="c1"># Determine the shortest paths from any one of the center nodes to</span> @@ -560,11 +571,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/wiener.html b/_modules/networkx/algorithms/wiener.html index ba5e24d3..cce3ccba 100644 --- a/_modules/networkx/algorithms/wiener.html +++ b/_modules/networkx/algorithms/wiener.html @@ -5,7 +5,7 @@ <head> <meta charset="utf-8" /> <meta name="viewport" content="width=device-width, initial-scale=1.0" /> - <title>networkx.algorithms.wiener — NetworkX 3.0rc2.dev0 documentation</title> + <title>networkx.algorithms.wiener — NetworkX 3.1rc1.dev0 documentation</title> @@ -46,12 +46,18 @@ <script>DOCUMENTATION_OPTIONS.pagename = '_modules/networkx/algorithms/wiener';</script> <link rel="canonical" href="https://networkx.org/documentation/stable/_modules/networkx/algorithms/wiener.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"> @@ -551,11 +563,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"> |