diff options
Diffstat (limited to '_modules/networkx/algorithms/summarization.html')
| -rw-r--r-- | _modules/networkx/algorithms/summarization.html | 46 |
1 files changed, 29 insertions, 17 deletions
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"> |