diff options
Diffstat (limited to '_modules/networkx/algorithms/assortativity')
5 files changed, 19 insertions, 19 deletions
diff --git a/_modules/networkx/algorithms/assortativity/connectivity.html b/_modules/networkx/algorithms/assortativity/connectivity.html index 01469c67..a9bab070 100644 --- a/_modules/networkx/algorithms/assortativity/connectivity.html +++ b/_modules/networkx/algorithms/assortativity/connectivity.html @@ -471,7 +471,7 @@ <div class="viewcode-block" id="average_degree_connectivity"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.average_degree_connectivity.html#networkx.algorithms.assortativity.average_degree_connectivity">[docs]</a><span class="k">def</span> <span class="nf">average_degree_connectivity</span><span class="p">(</span> <span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="o">=</span><span class="s2">"in+out"</span><span class="p">,</span> <span class="n">target</span><span class="o">=</span><span class="s2">"in+out"</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">weight</span><span class="o">=</span><span class="kc">None</span> <span class="p">):</span> - <span class="sa">r</span><span class="sd">"""Compute the average degree connectivity of graph.</span> +<span class="w"> </span><span class="sa">r</span><span class="sd">"""Compute the average degree connectivity of graph.</span> <span class="sd"> The average degree connectivity is the average nearest neighbor degree of</span> <span class="sd"> nodes with degree k. For weighted graphs, an analogous measure can</span> @@ -633,7 +633,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/_modules/networkx/algorithms/assortativity/correlation.html b/_modules/networkx/algorithms/assortativity/correlation.html index 7082fdc9..b0b215ac 100644 --- a/_modules/networkx/algorithms/assortativity/correlation.html +++ b/_modules/networkx/algorithms/assortativity/correlation.html @@ -478,7 +478,7 @@ <div class="viewcode-block" id="degree_assortativity_coefficient"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.degree_assortativity_coefficient.html#networkx.algorithms.assortativity.degree_assortativity_coefficient">[docs]</a><span class="k">def</span> <span class="nf">degree_assortativity_coefficient</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">x</span><span class="o">=</span><span class="s2">"out"</span><span class="p">,</span> <span class="n">y</span><span class="o">=</span><span class="s2">"in"</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="kc">None</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="sd">"""Compute degree assortativity of graph.</span> +<span class="w"> </span><span class="sd">"""Compute degree assortativity of graph.</span> <span class="sd"> Assortativity measures the similarity of connections</span> <span class="sd"> in the graph with respect to the node degree.</span> @@ -562,7 +562,7 @@ <div class="viewcode-block" id="degree_pearson_correlation_coefficient"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.degree_pearson_correlation_coefficient.html#networkx.algorithms.assortativity.degree_pearson_correlation_coefficient">[docs]</a><span class="k">def</span> <span class="nf">degree_pearson_correlation_coefficient</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">x</span><span class="o">=</span><span class="s2">"out"</span><span class="p">,</span> <span class="n">y</span><span class="o">=</span><span class="s2">"in"</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="kc">None</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="sd">"""Compute degree assortativity of graph.</span> +<span class="w"> </span><span class="sd">"""Compute degree assortativity of graph.</span> <span class="sd"> Assortativity measures the similarity of connections</span> <span class="sd"> in the graph with respect to the node degree.</span> @@ -621,7 +621,7 @@ <div class="viewcode-block" id="attribute_assortativity_coefficient"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.attribute_assortativity_coefficient.html#networkx.algorithms.assortativity.attribute_assortativity_coefficient">[docs]</a><span class="k">def</span> <span class="nf">attribute_assortativity_coefficient</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">attribute</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="sd">"""Compute assortativity for node attributes.</span> +<span class="w"> </span><span class="sd">"""Compute assortativity for node attributes.</span> <span class="sd"> Assortativity measures the similarity of connections</span> <span class="sd"> in the graph with respect to the given attribute.</span> @@ -667,7 +667,7 @@ <div class="viewcode-block" id="numeric_assortativity_coefficient"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.numeric_assortativity_coefficient.html#networkx.algorithms.assortativity.numeric_assortativity_coefficient">[docs]</a><span class="k">def</span> <span class="nf">numeric_assortativity_coefficient</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">attribute</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="sd">"""Compute assortativity for numerical node attributes.</span> +<span class="w"> </span><span class="sd">"""Compute assortativity for numerical node attributes.</span> <span class="sd"> Assortativity measures the similarity of connections</span> <span class="sd"> in the graph with respect to the given numeric attribute.</span> @@ -716,7 +716,7 @@ <span class="k">def</span> <span class="nf">attribute_ac</span><span class="p">(</span><span class="n">M</span><span class="p">):</span> - <span class="sd">"""Compute assortativity for attribute matrix M.</span> +<span class="w"> </span><span class="sd">"""Compute assortativity for attribute matrix M.</span> <span class="sd"> Parameters</span> <span class="sd"> ----------</span> @@ -810,7 +810,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/_modules/networkx/algorithms/assortativity/mixing.html b/_modules/networkx/algorithms/assortativity/mixing.html index 3a674dd1..181cf0f3 100644 --- a/_modules/networkx/algorithms/assortativity/mixing.html +++ b/_modules/networkx/algorithms/assortativity/mixing.html @@ -477,7 +477,7 @@ <div class="viewcode-block" id="attribute_mixing_dict"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.attribute_mixing_dict.html#networkx.algorithms.assortativity.attribute_mixing_dict">[docs]</a><span class="k">def</span> <span class="nf">attribute_mixing_dict</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">attribute</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">normalized</span><span class="o">=</span><span class="kc">False</span><span class="p">):</span> - <span class="sd">"""Returns dictionary representation of mixing matrix for attribute.</span> +<span class="w"> </span><span class="sd">"""Returns dictionary representation of mixing matrix for attribute.</span> <span class="sd"> Parameters</span> <span class="sd"> ----------</span> @@ -515,7 +515,7 @@ <div class="viewcode-block" id="attribute_mixing_matrix"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.attribute_mixing_matrix.html#networkx.algorithms.assortativity.attribute_mixing_matrix">[docs]</a><span class="k">def</span> <span class="nf">attribute_mixing_matrix</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">attribute</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">mapping</span><span class="o">=</span><span class="kc">None</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="sd">"""Returns mixing matrix for attribute.</span> +<span class="w"> </span><span class="sd">"""Returns mixing matrix for attribute.</span> <span class="sd"> Parameters</span> <span class="sd"> ----------</span> @@ -574,7 +574,7 @@ <div class="viewcode-block" id="degree_mixing_dict"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.degree_mixing_dict.html#networkx.algorithms.assortativity.degree_mixing_dict">[docs]</a><span class="k">def</span> <span class="nf">degree_mixing_dict</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">x</span><span class="o">=</span><span class="s2">"out"</span><span class="p">,</span> <span class="n">y</span><span class="o">=</span><span class="s2">"in"</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="kc">None</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">normalized</span><span class="o">=</span><span class="kc">False</span><span class="p">):</span> - <span class="sd">"""Returns dictionary representation of mixing matrix for degree.</span> +<span class="w"> </span><span class="sd">"""Returns dictionary representation of mixing matrix for degree.</span> <span class="sd"> Parameters</span> <span class="sd"> ----------</span> @@ -607,7 +607,7 @@ <div class="viewcode-block" id="degree_mixing_matrix"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.degree_mixing_matrix.html#networkx.algorithms.assortativity.degree_mixing_matrix">[docs]</a><span class="k">def</span> <span class="nf">degree_mixing_matrix</span><span class="p">(</span> <span class="n">G</span><span class="p">,</span> <span class="n">x</span><span class="o">=</span><span class="s2">"out"</span><span class="p">,</span> <span class="n">y</span><span class="o">=</span><span class="s2">"in"</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="kc">None</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">normalized</span><span class="o">=</span><span class="kc">True</span><span class="p">,</span> <span class="n">mapping</span><span class="o">=</span><span class="kc">None</span> <span class="p">):</span> - <span class="sd">"""Returns mixing matrix for attribute.</span> +<span class="w"> </span><span class="sd">"""Returns mixing matrix for attribute.</span> <span class="sd"> Parameters</span> <span class="sd"> ----------</span> @@ -672,7 +672,7 @@ <div class="viewcode-block" id="mixing_dict"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.mixing_dict.html#networkx.algorithms.assortativity.mixing_dict">[docs]</a><span class="k">def</span> <span class="nf">mixing_dict</span><span class="p">(</span><span class="n">xy</span><span class="p">,</span> <span class="n">normalized</span><span class="o">=</span><span class="kc">False</span><span class="p">):</span> - <span class="sd">"""Returns a dictionary representation of mixing matrix.</span> +<span class="w"> </span><span class="sd">"""Returns a dictionary representation of mixing matrix.</span> <span class="sd"> Parameters</span> <span class="sd"> ----------</span> @@ -757,7 +757,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/_modules/networkx/algorithms/assortativity/neighbor_degree.html b/_modules/networkx/algorithms/assortativity/neighbor_degree.html index b4bf73d1..08f5bafa 100644 --- a/_modules/networkx/algorithms/assortativity/neighbor_degree.html +++ b/_modules/networkx/algorithms/assortativity/neighbor_degree.html @@ -467,7 +467,7 @@ <div class="viewcode-block" id="average_neighbor_degree"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.average_neighbor_degree.html#networkx.algorithms.assortativity.average_neighbor_degree">[docs]</a><span class="k">def</span> <span class="nf">average_neighbor_degree</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">source</span><span class="o">=</span><span class="s2">"out"</span><span class="p">,</span> <span class="n">target</span><span class="o">=</span><span class="s2">"out"</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">weight</span><span class="o">=</span><span class="kc">None</span><span class="p">):</span> - <span class="sa">r</span><span class="sd">"""Returns the average degree of the neighborhood of each node.</span> +<span class="w"> </span><span class="sa">r</span><span class="sd">"""Returns the average degree of the neighborhood of each node.</span> <span class="sd"> In an undirected graph, the neighborhood `N(i)` of node `i` contains the</span> <span class="sd"> nodes that are connected to `i` by an edge.</span> @@ -671,7 +671,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/_modules/networkx/algorithms/assortativity/pairs.html b/_modules/networkx/algorithms/assortativity/pairs.html index 808d1ccd..7690d519 100644 --- a/_modules/networkx/algorithms/assortativity/pairs.html +++ b/_modules/networkx/algorithms/assortativity/pairs.html @@ -466,7 +466,7 @@ <div class="viewcode-block" id="node_attribute_xy"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.node_attribute_xy.html#networkx.algorithms.assortativity.node_attribute_xy">[docs]</a><span class="k">def</span> <span class="nf">node_attribute_xy</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">attribute</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="sd">"""Returns iterator of node-attribute pairs for all edges in G.</span> +<span class="w"> </span><span class="sd">"""Returns iterator of node-attribute pairs for all edges in G.</span> <span class="sd"> Parameters</span> <span class="sd"> ----------</span> @@ -520,7 +520,7 @@ <div class="viewcode-block" id="node_degree_xy"><a class="viewcode-back" href="../../../../reference/algorithms/generated/networkx.algorithms.assortativity.node_degree_xy.html#networkx.algorithms.assortativity.node_degree_xy">[docs]</a><span class="k">def</span> <span class="nf">node_degree_xy</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">x</span><span class="o">=</span><span class="s2">"out"</span><span class="p">,</span> <span class="n">y</span><span class="o">=</span><span class="s2">"in"</span><span class="p">,</span> <span class="n">weight</span><span class="o">=</span><span class="kc">None</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="sd">"""Generate node degree-degree pairs for edges in G.</span> +<span class="w"> </span><span class="sd">"""Generate node degree-degree pairs for edges in G.</span> <span class="sd"> Parameters</span> <span class="sd"> ----------</span> @@ -626,7 +626,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> |