diff options
Diffstat (limited to '_modules/networkx/algorithms/isomorphism/isomorph.html')
| -rw-r--r-- | _modules/networkx/algorithms/isomorphism/isomorph.html | 38 |
1 files changed, 26 insertions, 12 deletions
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"> |