diff options
| author | MridulS <mail@mriduls.com> | 2023-01-02 13:08:27 +0000 |
|---|---|---|
| committer | MridulS <mail@mriduls.com> | 2023-01-02 13:08:27 +0000 |
| commit | 0b9a02d6b3796e8ce4fed6cbce282fced15e486a (patch) | |
| tree | 8b48b18926291619367d4f9537892bd228bf7987 /reference/algorithms | |
| parent | 6ae99ab58d8b8ba50f66768c0f3aa4bb82b22196 (diff) | |
| download | networkx-0b9a02d6b3796e8ce4fed6cbce282fced15e486a.tar.gz | |
Deploying to gh-pages from @ networkx/networkx@71ad516a90c89c7294e32bf28e1f05c63c5f17e4 🚀
Diffstat (limited to 'reference/algorithms')
684 files changed, 688 insertions, 688 deletions
diff --git a/reference/algorithms/approximation.html b/reference/algorithms/approximation.html index 9d5a534f..752d044f 100644 --- a/reference/algorithms/approximation.html +++ b/reference/algorithms/approximation.html @@ -955,7 +955,7 @@ is incident to at least one node in the subset.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/assortativity.html b/reference/algorithms/assortativity.html index 4e33c365..90bc55a4 100644 --- a/reference/algorithms/assortativity.html +++ b/reference/algorithms/assortativity.html @@ -727,7 +727,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/asteroidal.html b/reference/algorithms/asteroidal.html index 75b0e6de..ba8ace0f 100644 --- a/reference/algorithms/asteroidal.html +++ b/reference/algorithms/asteroidal.html @@ -631,7 +631,7 @@ independent set and coloring.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/bipartite.html b/reference/algorithms/bipartite.html index 98d82872..41f99a26 100644 --- a/reference/algorithms/bipartite.html +++ b/reference/algorithms/bipartite.html @@ -999,7 +999,7 @@ edges included in the matching is minimal.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/boundary.html b/reference/algorithms/boundary.html index 0b638ae8..d37fa182 100644 --- a/reference/algorithms/boundary.html +++ b/reference/algorithms/boundary.html @@ -628,7 +628,7 @@ nodes in <em>S</em> that are outside <em>S</em>.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/bridges.html b/reference/algorithms/bridges.html index 9a1afdde..8e9893db 100644 --- a/reference/algorithms/bridges.html +++ b/reference/algorithms/bridges.html @@ -626,7 +626,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/centrality.html b/reference/algorithms/centrality.html index 6244e337..6918c6f3 100644 --- a/reference/algorithms/centrality.html +++ b/reference/algorithms/centrality.html @@ -955,7 +955,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/chains.html b/reference/algorithms/chains.html index f00b4a13..76c06a7d 100644 --- a/reference/algorithms/chains.html +++ b/reference/algorithms/chains.html @@ -620,7 +620,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/chordal.html b/reference/algorithms/chordal.html index 8ea987dd..bda0a0b5 100644 --- a/reference/algorithms/chordal.html +++ b/reference/algorithms/chordal.html @@ -635,7 +635,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/clique.html b/reference/algorithms/clique.html index a5057332..81554848 100644 --- a/reference/algorithms/clique.html +++ b/reference/algorithms/clique.html @@ -659,7 +659,7 @@ see the Wikipedia article on the clique problem <a class="reference internal" hr <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/clustering.html b/reference/algorithms/clustering.html index 622f8878..73f2ded0 100644 --- a/reference/algorithms/clustering.html +++ b/reference/algorithms/clustering.html @@ -635,7 +635,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/coloring.html b/reference/algorithms/coloring.html index dde9460f..851ba979 100644 --- a/reference/algorithms/coloring.html +++ b/reference/algorithms/coloring.html @@ -651,7 +651,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/communicability_alg.html b/reference/algorithms/communicability_alg.html index 21f78214..f47facd3 100644 --- a/reference/algorithms/communicability_alg.html +++ b/reference/algorithms/communicability_alg.html @@ -623,7 +623,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/community.html b/reference/algorithms/community.html index 9faaab43..2a03755f 100644 --- a/reference/algorithms/community.html +++ b/reference/algorithms/community.html @@ -811,7 +811,7 @@ communities).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/component.html b/reference/algorithms/component.html index f5433417..2b2bda69 100644 --- a/reference/algorithms/component.html +++ b/reference/algorithms/component.html @@ -759,7 +759,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/connectivity.html b/reference/algorithms/connectivity.html index 3cac2076..969d937c 100644 --- a/reference/algorithms/connectivity.html +++ b/reference/algorithms/connectivity.html @@ -836,7 +836,7 @@ least k.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/core.html b/reference/algorithms/core.html index ee95dcc9..b0be1659 100644 --- a/reference/algorithms/core.html +++ b/reference/algorithms/core.html @@ -656,7 +656,7 @@ Scientific Reports 6, 31708 (2016) <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/covering.html b/reference/algorithms/covering.html index bb253b36..61eea6d1 100644 --- a/reference/algorithms/covering.html +++ b/reference/algorithms/covering.html @@ -623,7 +623,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/cuts.html b/reference/algorithms/cuts.html index 9822fcd5..61e3bf90 100644 --- a/reference/algorithms/cuts.html +++ b/reference/algorithms/cuts.html @@ -641,7 +641,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/cycles.html b/reference/algorithms/cycles.html index a16220b9..254fa011 100644 --- a/reference/algorithms/cycles.html +++ b/reference/algorithms/cycles.html @@ -631,7 +631,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/d_separation.html b/reference/algorithms/d_separation.html index 265aa7db..a83bc205 100644 --- a/reference/algorithms/d_separation.html +++ b/reference/algorithms/d_separation.html @@ -774,7 +774,7 @@ Probabilistic graphical models: principles and techniques. The MIT Press.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/dag.html b/reference/algorithms/dag.html index d4794a0f..0a49ab51 100644 --- a/reference/algorithms/dag.html +++ b/reference/algorithms/dag.html @@ -665,7 +665,7 @@ to the user to check for that.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/distance_measures.html b/reference/algorithms/distance_measures.html index e6c831c4..4d78453e 100644 --- a/reference/algorithms/distance_measures.html +++ b/reference/algorithms/distance_measures.html @@ -638,7 +638,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/distance_regular.html b/reference/algorithms/distance_regular.html index 29e59436..f9366612 100644 --- a/reference/algorithms/distance_regular.html +++ b/reference/algorithms/distance_regular.html @@ -628,7 +628,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/dominance.html b/reference/algorithms/dominance.html index f49de56e..17211b6f 100644 --- a/reference/algorithms/dominance.html +++ b/reference/algorithms/dominance.html @@ -623,7 +623,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/dominating.html b/reference/algorithms/dominating.html index f9c628eb..b6fd405b 100644 --- a/reference/algorithms/dominating.html +++ b/reference/algorithms/dominating.html @@ -623,7 +623,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/efficiency_measures.html b/reference/algorithms/efficiency_measures.html index 3662d2b9..349ee6fb 100644 --- a/reference/algorithms/efficiency_measures.html +++ b/reference/algorithms/efficiency_measures.html @@ -626,7 +626,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/euler.html b/reference/algorithms/euler.html index 57d35186..64657957 100644 --- a/reference/algorithms/euler.html +++ b/reference/algorithms/euler.html @@ -635,7 +635,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/flow.html b/reference/algorithms/flow.html index 50dfac90..d0cb1b48 100644 --- a/reference/algorithms/flow.html +++ b/reference/algorithms/flow.html @@ -795,7 +795,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct.html b/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct.html index 9d5b8696..75ddf76c 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.construct.html @@ -657,7 +657,7 @@ node.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_components.html b/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_components.html index 6d745fc9..3ca969d7 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_components.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_components.html @@ -657,7 +657,7 @@ k-edge-ccs in the original graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_subgraphs.html b/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_subgraphs.html index 3ca0d0c6..7b9bf8d4 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_subgraphs.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.k_edge_subgraphs.html @@ -659,7 +659,7 @@ then use this method.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.analyze_symmetry.html b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.analyze_symmetry.html index 0ff7b055..1bdd030b 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.analyze_symmetry.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.analyze_symmetry.html @@ -670,7 +670,7 @@ without changing nodes less than <code class="docutils literal notranslate"><spa <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.find_isomorphisms.html b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.find_isomorphisms.html index f3888b06..7ea95b5b 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.find_isomorphisms.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.find_isomorphisms.html @@ -655,7 +655,7 @@ isomorphisms may be symmetrically equivalent.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.is_isomorphic.html b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.is_isomorphic.html index 4fe9b95f..d2f85433 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.is_isomorphic.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.is_isomorphic.html @@ -647,7 +647,7 @@ False otherwise.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.isomorphisms_iter.html b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.isomorphisms_iter.html index 229436e5..8f355988 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.isomorphisms_iter.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.isomorphisms_iter.html @@ -640,7 +640,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.largest_common_subgraph.html b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.largest_common_subgraph.html index 440335e9..0d60cdca 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.largest_common_subgraph.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.largest_common_subgraph.html @@ -655,7 +655,7 @@ largest common subgraphs may be symmetrically equivalent.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.subgraph_is_isomorphic.html b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.subgraph_is_isomorphic.html index 52fd2d41..8a5b7887 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.subgraph_is_isomorphic.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.subgraph_is_isomorphic.html @@ -647,7 +647,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.subgraph_isomorphisms_iter.html b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.subgraph_isomorphisms_iter.html index d8460328..78c85236 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.subgraph_isomorphisms_iter.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.isomorphism.ISMAGS.subgraph_isomorphisms_iter.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_edge.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_edge.html index 2bcd6b56..57ede3ea 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_edge.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_edge.html @@ -686,7 +686,7 @@ an edge attribute (by default <code class="xref py py-obj docutils literal notra <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_edges_from.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_edges_from.html index 180b57c6..11faed13 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_edges_from.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_edges_from.html @@ -694,7 +694,7 @@ object to <code class="xref py py-obj docutils literal notranslate"><span class= <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_ccw.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_ccw.html index a0146b74..a741c1bc 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_ccw.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_ccw.html @@ -667,7 +667,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_cw.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_cw.html index ceedc75a..3dc31ee6 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_cw.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_cw.html @@ -667,7 +667,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first.html index a5e8c620..fc7f8d0f 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_half_edge_first.html @@ -655,7 +655,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_node.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_node.html index 2bd5ec0b..59e13055 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_node.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_node.html @@ -677,7 +677,7 @@ doesn’t change on mutables.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_nodes_from.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_nodes_from.html index 1be46c53..759d98b7 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_nodes_from.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_nodes_from.html @@ -700,7 +700,7 @@ object to <code class="xref py py-obj docutils literal notranslate"><span class= <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_weighted_edges_from.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_weighted_edges_from.html index 55a848a6..d6b17746 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_weighted_edges_from.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.add_weighted_edges_from.html @@ -688,7 +688,7 @@ object to <code class="xref py py-obj docutils literal notranslate"><span class= <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.adj.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.adj.html index 7c23a118..7f61b1a8 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.adj.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.adj.html @@ -648,7 +648,7 @@ So <code class="xref py py-obj docutils literal notranslate"><span class="pre">f <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.adjacency.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.adjacency.html index 6ec04fe1..92718baf 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.adjacency.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.adjacency.html @@ -655,7 +655,7 @@ the graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.check_structure.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.check_structure.html index a6dca181..d124d2da 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.check_structure.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.check_structure.html @@ -656,7 +656,7 @@ PlanarEmbedding is invalid.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.clear.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.clear.html index 510d2e16..cbad9906 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.clear.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.clear.html @@ -649,7 +649,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.clear_edges.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.clear_edges.html index fd30d103..7a39e85c 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.clear_edges.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.clear_edges.html @@ -648,7 +648,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.connect_components.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.connect_components.html index f95ddf8c..c82e1b8d 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.connect_components.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.connect_components.html @@ -661,7 +661,7 @@ all set correctly after the first call.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.copy.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.copy.html index 536e1ee7..e22ae17d 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.copy.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.copy.html @@ -711,7 +711,7 @@ and deep copies, <a class="reference external" href="https://docs.python.org/3/l <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.degree.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.degree.html index cb091344..bd347d8b 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.degree.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.degree.html @@ -679,7 +679,7 @@ If a single node is requested, returns the degree of the node as an integer.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.edge_subgraph.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.edge_subgraph.html index 0dc3a317..ce3204c9 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.edge_subgraph.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.edge_subgraph.html @@ -674,7 +674,7 @@ of the edge or node attributes, use:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.edges.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.edges.html index c89f1a71..3c2fd0c2 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.edges.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.edges.html @@ -697,7 +697,7 @@ For directed graphs this returns the out-edges.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.get_data.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.get_data.html index b1b69d82..bcd6380a 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.get_data.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.get_data.html @@ -654,7 +654,7 @@ clockwise order.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.get_edge_data.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.get_edge_data.html index 4c670c07..6fcec056 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.get_edge_data.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.get_edge_data.html @@ -681,7 +681,7 @@ But it is safe to assign attributes <code class="xref py py-obj docutils literal <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_edge.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_edge.html index 031866b4..c5a337b6 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_edge.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_edge.html @@ -674,7 +674,7 @@ Nodes must be hashable (and not None) Python objects.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_node.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_node.html index ac201526..9e7f5b98 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_node.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_node.html @@ -658,7 +658,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_predecessor.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_predecessor.html index 83511b9a..a2ba4d70 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_predecessor.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_predecessor.html @@ -640,7 +640,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_successor.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_successor.html index a53a0962..055c0bc0 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_successor.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.has_successor.html @@ -640,7 +640,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.in_degree.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.in_degree.html index 3596ec0d..14237bb9 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.in_degree.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.in_degree.html @@ -681,7 +681,7 @@ The degree is the sum of the edge weights adjacent to the node.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.in_edges.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.in_edges.html index e18e70b8..8f6ca102 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.in_edges.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.in_edges.html @@ -694,7 +694,7 @@ attribute lookup as <code class="xref py py-obj docutils literal notranslate"><s <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.is_directed.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.is_directed.html index fbf1c44e..1db09870 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.is_directed.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.is_directed.html @@ -642,7 +642,7 @@ contained.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.is_multigraph.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.is_multigraph.html index 632968a0..2075b019 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.is_multigraph.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.is_multigraph.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.name.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.name.html index 6b6dbc0a..e01d20a5 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.name.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.name.html @@ -642,7 +642,7 @@ a property) <code class="xref py py-obj docutils literal notranslate"><span clas <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.nbunch_iter.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.nbunch_iter.html index 7ad96c24..03737d86 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.nbunch_iter.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.nbunch_iter.html @@ -678,7 +678,7 @@ nbunch is not hashable, a <code class="xref py py-exc docutils literal notransla <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.neighbors.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.neighbors.html index 6423cbd0..926dfb47 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.neighbors.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.neighbors.html @@ -663,7 +663,7 @@ edge from n to m.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.neighbors_cw_order.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.neighbors_cw_order.html index cac2466b..ffccd8b5 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.neighbors_cw_order.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.neighbors_cw_order.html @@ -651,7 +651,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge.html index 3387a07b..adba63b5 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.next_face_half_edge.html @@ -652,7 +652,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.nodes.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.nodes.html index 369cc863..d59c79da 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.nodes.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.nodes.html @@ -726,7 +726,7 @@ to guarantee the value is never None:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.number_of_edges.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.number_of_edges.html index 0247a781..3d5159ad 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.number_of_edges.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.number_of_edges.html @@ -686,7 +686,7 @@ directed edges from <code class="xref py py-obj docutils literal notranslate"><s <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.number_of_nodes.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.number_of_nodes.html index baf97463..6302a379 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.number_of_nodes.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.number_of_nodes.html @@ -662,7 +662,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.order.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.order.html index 7f54c110..63f51c3c 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.order.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.order.html @@ -662,7 +662,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.out_degree.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.out_degree.html index c341a0bb..34e05c14 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.out_degree.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.out_degree.html @@ -681,7 +681,7 @@ The degree is the sum of the edge weights adjacent to the node.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.out_edges.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.out_edges.html index 1a710d2d..9fb3d65b 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.out_edges.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.out_edges.html @@ -697,7 +697,7 @@ For directed graphs this returns the out-edges.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.pred.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.pred.html index 1cd02366..48af554b 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.pred.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.pred.html @@ -647,7 +647,7 @@ A default can be set via a <code class="xref py py-obj docutils literal notransl <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.predecessors.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.predecessors.html index aedcf304..86b46b8c 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.predecessors.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.predecessors.html @@ -661,7 +661,7 @@ edge from m to n.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_edge.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_edge.html index abff671d..66491911 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_edge.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_edge.html @@ -670,7 +670,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from.html index 85c4fb82..45d9f8af 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_edges_from.html @@ -669,7 +669,7 @@ from the graph. The edges can be:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_node.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_node.html index e2ab6365..514c5494 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_node.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_node.html @@ -670,7 +670,7 @@ Attempting to remove a non-existent node will raise an exception.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_nodes_from.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_nodes_from.html index b3567866..684ee40d 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_nodes_from.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.remove_nodes_from.html @@ -680,7 +680,7 @@ object to <code class="xref py py-obj docutils literal notranslate"><span class= <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.reverse.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.reverse.html index 753bc636..9b215b1d 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.reverse.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.reverse.html @@ -651,7 +651,7 @@ the original graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.set_data.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.set_data.html index 0e86a108..487cf53a 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.set_data.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.set_data.html @@ -655,7 +655,7 @@ clockwise order.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.size.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.size.html index 848cbc70..ec8a0ab4 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.size.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.size.html @@ -678,7 +678,7 @@ as a weight. If None, then each edge has weight 1.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.subgraph.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.subgraph.html index e727754b..f4fac60f 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.subgraph.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.subgraph.html @@ -690,7 +690,7 @@ more sense to just create the subgraph as its own graph with code like:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.succ.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.succ.html index fd2be735..54fd1e8f 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.succ.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.succ.html @@ -650,7 +650,7 @@ So <code class="xref py py-obj docutils literal notranslate"><span class="pre">f <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.successors.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.successors.html index 5a10bb08..e733a776 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.successors.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.successors.html @@ -663,7 +663,7 @@ edge from n to m.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_directed.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_directed.html index 92dd7831..5b18538c 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_directed.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_directed.html @@ -676,7 +676,7 @@ DiGraph created by this method.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_directed_class.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_directed_class.html index fa9d0d40..8a857241 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_directed_class.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_directed_class.html @@ -641,7 +641,7 @@ what directed class to use for <a class="reference internal" href="networkx.algo <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_undirected.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_undirected.html index 20b4b135..fe7df85c 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_undirected.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_undirected.html @@ -693,7 +693,7 @@ Graph created by this method.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_undirected_class.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_undirected_class.html index 069b39f9..d3c96af3 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_undirected_class.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.to_undirected_class.html @@ -641,7 +641,7 @@ what directed class to use for <a class="reference internal" href="networkx.algo <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.traverse_face.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.traverse_face.html index cccc5cae..024c9ed6 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.traverse_face.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.traverse_face.html @@ -662,7 +662,7 @@ any half-edges that belong to the face.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.update.html b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.update.html index e0ac4d82..cdaac7ab 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.update.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.planarity.PlanarEmbedding.update.html @@ -739,7 +739,7 @@ be slightly different and require tweaks of these examples:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/generated/networkx.algorithms.tree.branchings.Edmonds.find_optimum.html b/reference/algorithms/generated/generated/networkx.algorithms.tree.branchings.Edmonds.find_optimum.html index 93788429..d3111dc3 100644 --- a/reference/algorithms/generated/generated/networkx.algorithms.tree.branchings.Edmonds.find_optimum.html +++ b/reference/algorithms/generated/generated/networkx.algorithms.tree.branchings.Edmonds.find_optimum.html @@ -673,7 +673,7 @@ See <a class="reference internal" href="../../../randomness.html#randomness"><sp <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.clique.clique_removal.html b/reference/algorithms/generated/networkx.algorithms.approximation.clique.clique_removal.html index 2fa47dc4..36c28d63 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.clique.clique_removal.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.clique.clique_removal.html @@ -672,7 +672,7 @@ BIT Numerical Mathematics, 32(2), 180–196. Springer.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.clique.large_clique_size.html b/reference/algorithms/generated/networkx.algorithms.approximation.clique.large_clique_size.html index 4e53a2b2..cd28f00e 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.clique.large_clique_size.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.clique.large_clique_size.html @@ -690,7 +690,7 @@ with Applications to Overlapping Community Detection.” <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.clique.max_clique.html b/reference/algorithms/generated/networkx.algorithms.approximation.clique.max_clique.html index b5dfc309..22e04444 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.clique.max_clique.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.clique.max_clique.html @@ -683,7 +683,7 @@ doi:10.1007/BF01994876</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.clique.maximum_independent_set.html b/reference/algorithms/generated/networkx.algorithms.approximation.clique.maximum_independent_set.html index dc6b86af..9ad8cb9c 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.clique.maximum_independent_set.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.clique.maximum_independent_set.html @@ -686,7 +686,7 @@ BIT Numerical Mathematics, 32(2), 180–196. Springer.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.clustering_coefficient.average_clustering.html b/reference/algorithms/generated/networkx.algorithms.approximation.clustering_coefficient.average_clustering.html index 0f81666d..8a1fa01b 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.clustering_coefficient.average_clustering.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.clustering_coefficient.average_clustering.html @@ -684,7 +684,7 @@ Informatik, 2004. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.all_pairs_node_connectivity.html b/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.all_pairs_node_connectivity.html index 76da07fe..db7925ea 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.all_pairs_node_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.all_pairs_node_connectivity.html @@ -696,7 +696,7 @@ nodes in the cycle and connectivity 1 between the extra node and the rest:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.local_node_connectivity.html b/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.local_node_connectivity.html index e97a2bb0..0dd0eef1 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.local_node_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.local_node_connectivity.html @@ -703,7 +703,7 @@ Node-Independent Paths. Santa Fe Institute Working Paper #01-07-035 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.node_connectivity.html b/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.node_connectivity.html index 947c5ce3..dae220d1 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.node_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.connectivity.node_connectivity.html @@ -701,7 +701,7 @@ Node-Independent Paths. Santa Fe Institute Working Paper #01-07-035 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.distance_measures.diameter.html b/reference/algorithms/generated/networkx.algorithms.approximation.distance_measures.diameter.html index 81caa542..21639063 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.distance_measures.diameter.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.distance_measures.diameter.html @@ -699,7 +699,7 @@ International Symposium on Experimental Algorithms. Springer, Berlin, Heidelberg <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.dominating_set.min_edge_dominating_set.html b/reference/algorithms/generated/networkx.algorithms.approximation.dominating_set.min_edge_dominating_set.html index 56f02865..56384cde 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.dominating_set.min_edge_dominating_set.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.dominating_set.min_edge_dominating_set.html @@ -658,7 +658,7 @@ Runtime of the algorithm is <span class="math notranslate nohighlight">\(O(|E|)\ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.dominating_set.min_weighted_dominating_set.html b/reference/algorithms/generated/networkx.algorithms.approximation.dominating_set.min_weighted_dominating_set.html index 28c2cdea..bc2941d9 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.dominating_set.min_weighted_dominating_set.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.dominating_set.min_weighted_dominating_set.html @@ -679,7 +679,7 @@ Springer Science & Business Media, 2001.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.kcomponents.k_components.html b/reference/algorithms/generated/networkx.algorithms.approximation.kcomponents.k_components.html index 5772cc50..232b5236 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.kcomponents.k_components.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.kcomponents.k_components.html @@ -732,7 +732,7 @@ American Sociological Review 68(1), 103–28. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.matching.min_maximal_matching.html b/reference/algorithms/generated/networkx.algorithms.approximation.matching.min_maximal_matching.html index d0964241..99d98a25 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.matching.min_maximal_matching.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.matching.min_maximal_matching.html @@ -668,7 +668,7 @@ Runtime is <span class="math notranslate nohighlight">\(O(|E|)\)</span>.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.maxcut.one_exchange.html b/reference/algorithms/generated/networkx.algorithms.approximation.maxcut.one_exchange.html index 615a0156..7595d65c 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.maxcut.one_exchange.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.maxcut.one_exchange.html @@ -668,7 +668,7 @@ have weight one.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.maxcut.randomized_partitioning.html b/reference/algorithms/generated/networkx.algorithms.approximation.maxcut.randomized_partitioning.html index b48cdb2d..410fbe3c 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.maxcut.randomized_partitioning.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.maxcut.randomized_partitioning.html @@ -667,7 +667,7 @@ have weight one.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.ramsey.ramsey_R2.html b/reference/algorithms/generated/networkx.algorithms.approximation.ramsey.ramsey_R2.html index 6838e6c7..43c9f398 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.ramsey.ramsey_R2.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.ramsey.ramsey_R2.html @@ -663,7 +663,7 @@ for large recursions. Note that self-loop edges are ignored.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.steinertree.metric_closure.html b/reference/algorithms/generated/networkx.algorithms.approximation.steinertree.metric_closure.html index b5c4cd56..bae89542 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.steinertree.metric_closure.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.steinertree.metric_closure.html @@ -654,7 +654,7 @@ is weighted by the shortest path distance between the nodes in <em>G</em> .</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.steinertree.steiner_tree.html b/reference/algorithms/generated/networkx.algorithms.approximation.steinertree.steiner_tree.html index 761bbfcd..105ae1ac 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.steinertree.steiner_tree.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.steinertree.steiner_tree.html @@ -709,7 +709,7 @@ Information Processing Letters 27 (3): 125–28. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.asadpour_atsp.html b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.asadpour_atsp.html index 0490cc2e..b3c8cd83 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.asadpour_atsp.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.asadpour_atsp.html @@ -709,7 +709,7 @@ pp. 1043–1061</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.christofides.html b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.christofides.html index f6c1112b..a6f5f0dd 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.christofides.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.christofides.html @@ -672,7 +672,7 @@ Pittsburgh Pa Management Sciences Research Group, 1976.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.greedy_tsp.html b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.greedy_tsp.html index 6768cf6c..a7d7b903 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.greedy_tsp.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.greedy_tsp.html @@ -701,7 +701,7 @@ as Simulated Annealing, or Threshold Accepting.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.simulated_annealing_tsp.html b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.simulated_annealing_tsp.html index 45d9f9f2..b067416c 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.simulated_annealing_tsp.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.simulated_annealing_tsp.html @@ -767,7 +767,7 @@ outer loop, this algorithm has running time <span class="math notranslate nohigh <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.threshold_accepting_tsp.html b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.threshold_accepting_tsp.html index a4ffafe6..e74b9a7c 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.threshold_accepting_tsp.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.threshold_accepting_tsp.html @@ -774,7 +774,7 @@ of times the outer and inner loop run respectively.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.traveling_salesman_problem.html b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.traveling_salesman_problem.html index e1df5a18..d146d6ad 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.traveling_salesman_problem.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.traveling_salesman.traveling_salesman_problem.html @@ -726,7 +726,7 @@ complete version cannot be generated.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.treewidth.treewidth_min_degree.html b/reference/algorithms/generated/networkx.algorithms.approximation.treewidth.treewidth_min_degree.html index 6c81bf00..6c161e28 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.treewidth.treewidth_min_degree.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.treewidth.treewidth_min_degree.html @@ -656,7 +656,7 @@ degree is chosen, and so on.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.treewidth.treewidth_min_fill_in.html b/reference/algorithms/generated/networkx.algorithms.approximation.treewidth.treewidth_min_fill_in.html index 16d87719..88ec6bff 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.treewidth.treewidth_min_fill_in.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.treewidth.treewidth_min_fill_in.html @@ -655,7 +655,7 @@ small as possible.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.approximation.vertex_cover.min_weighted_vertex_cover.html b/reference/algorithms/generated/networkx.algorithms.approximation.vertex_cover.min_weighted_vertex_cover.html index 627fb934..97076622 100644 --- a/reference/algorithms/generated/networkx.algorithms.approximation.vertex_cover.min_weighted_vertex_cover.html +++ b/reference/algorithms/generated/networkx.algorithms.approximation.vertex_cover.min_weighted_vertex_cover.html @@ -688,7 +688,7 @@ approximating the weighted vertex cover problem.” <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_assortativity_coefficient.html b/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_assortativity_coefficient.html index fee59853..f500b1a7 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_assortativity_coefficient.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_assortativity_coefficient.html @@ -680,7 +680,7 @@ Physical Review E, 67 026126, 2003</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_mixing_dict.html b/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_mixing_dict.html index 938e96ce..8c38f3c6 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_mixing_dict.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_mixing_dict.html @@ -671,7 +671,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_mixing_matrix.html b/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_mixing_matrix.html index cd325469..655594f0 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_mixing_matrix.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.attribute_mixing_matrix.html @@ -685,7 +685,7 @@ by inputting a <code class="xref py py-obj docutils literal notranslate"><span c <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.average_degree_connectivity.html b/reference/algorithms/generated/networkx.algorithms.assortativity.average_degree_connectivity.html index ea10a611..d2bfde7f 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.average_degree_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.average_degree_connectivity.html @@ -704,7 +704,7 @@ PNAS 101 (11): 3747–3752 (2004).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.average_neighbor_degree.html b/reference/algorithms/generated/networkx.algorithms.assortativity.average_neighbor_degree.html index 21194a3e..f6ea863c 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.average_neighbor_degree.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.average_neighbor_degree.html @@ -729,7 +729,7 @@ PNAS 101 (11): 3747–3752 (2004).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.degree_assortativity_coefficient.html b/reference/algorithms/generated/networkx.algorithms.assortativity.degree_assortativity_coefficient.html index 99a678c0..27c6869c 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.degree_assortativity_coefficient.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.degree_assortativity_coefficient.html @@ -699,7 +699,7 @@ Edge direction and the structure of networks, PNAS 107, 10815-20 (2010).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.degree_mixing_dict.html b/reference/algorithms/generated/networkx.algorithms.assortativity.degree_mixing_dict.html index 791a4a2e..e648ce96 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.degree_mixing_dict.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.degree_mixing_dict.html @@ -663,7 +663,7 @@ The degree is the sum of the edge weights adjacent to the node.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.degree_mixing_matrix.html b/reference/algorithms/generated/networkx.algorithms.assortativity.degree_mixing_matrix.html index b84e5e12..e7af3787 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.degree_mixing_matrix.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.degree_mixing_matrix.html @@ -690,7 +690,7 @@ have that degree, use <code class="xref py py-obj docutils literal notranslate"> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.degree_pearson_correlation_coefficient.html b/reference/algorithms/generated/networkx.algorithms.assortativity.degree_pearson_correlation_coefficient.html index 0c3eed1b..f078d735 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.degree_pearson_correlation_coefficient.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.degree_pearson_correlation_coefficient.html @@ -689,7 +689,7 @@ Edge direction and the structure of networks, PNAS 107, 10815-20 (2010).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.mixing_dict.html b/reference/algorithms/generated/networkx.algorithms.assortativity.mixing_dict.html index 7c20280e..161d9b79 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.mixing_dict.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.mixing_dict.html @@ -657,7 +657,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.node_attribute_xy.html b/reference/algorithms/generated/networkx.algorithms.assortativity.node_attribute_xy.html index ab997a45..16b42f04 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.node_attribute_xy.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.node_attribute_xy.html @@ -670,7 +670,7 @@ which only appear once.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.node_degree_xy.html b/reference/algorithms/generated/networkx.algorithms.assortativity.node_degree_xy.html index 14406322..f8612106 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.node_degree_xy.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.node_degree_xy.html @@ -676,7 +676,7 @@ which only appear once.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.assortativity.numeric_assortativity_coefficient.html b/reference/algorithms/generated/networkx.algorithms.assortativity.numeric_assortativity_coefficient.html index 82a7ff38..9e09fe60 100644 --- a/reference/algorithms/generated/networkx.algorithms.assortativity.numeric_assortativity_coefficient.html +++ b/reference/algorithms/generated/networkx.algorithms.assortativity.numeric_assortativity_coefficient.html @@ -679,7 +679,7 @@ Physical Review E, 67 026126, 2003</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.asteroidal.find_asteroidal_triple.html b/reference/algorithms/generated/networkx.algorithms.asteroidal.find_asteroidal_triple.html index d713a096..8c51d6b8 100644 --- a/reference/algorithms/generated/networkx.algorithms.asteroidal.find_asteroidal_triple.html +++ b/reference/algorithms/generated/networkx.algorithms.asteroidal.find_asteroidal_triple.html @@ -684,7 +684,7 @@ Journal of Discrete Algorithms 2, pages 439-452, 2004. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.asteroidal.is_at_free.html b/reference/algorithms/generated/networkx.algorithms.asteroidal.is_at_free.html index 7ff12415..0b715e55 100644 --- a/reference/algorithms/generated/networkx.algorithms.asteroidal.is_at_free.html +++ b/reference/algorithms/generated/networkx.algorithms.asteroidal.is_at_free.html @@ -668,7 +668,7 @@ found the graph is not AT-free and False is returned.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.color.html b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.color.html index 20827091..d541dfb3 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.color.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.color.html @@ -675,7 +675,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.degrees.html b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.degrees.html index b7fd883a..7b136527 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.degrees.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.degrees.html @@ -679,7 +679,7 @@ for further details on how bipartite graphs are handled in NetworkX.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.density.html b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.density.html index b13cbe83..5af18520 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.density.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.density.html @@ -677,7 +677,7 @@ for further details on how bipartite graphs are handled in NetworkX.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.is_bipartite.html b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.is_bipartite.html index 94b632cd..00e439e9 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.is_bipartite.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.is_bipartite.html @@ -659,7 +659,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.is_bipartite_node_set.html b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.is_bipartite_node_set.html index 776bfc3a..0ea6ce37 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.is_bipartite_node_set.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.is_bipartite_node_set.html @@ -661,7 +661,7 @@ disconnected graphs.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.sets.html b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.sets.html index 98e72271..707ebaef 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.basic.sets.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.basic.sets.html @@ -689,7 +689,7 @@ possible if the input graph is disconnected.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.betweenness_centrality.html b/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.betweenness_centrality.html index 3824395b..e8950ecb 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.betweenness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.betweenness_centrality.html @@ -700,7 +700,7 @@ of Social Network Analysis. Sage Publications. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.closeness_centrality.html b/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.closeness_centrality.html index cc93d84d..3d3b0083 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.closeness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.closeness_centrality.html @@ -703,7 +703,7 @@ of Social Network Analysis. Sage Publications. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.degree_centrality.html b/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.degree_centrality.html index 54e3f5c3..44e5ec21 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.degree_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.centrality.degree_centrality.html @@ -692,7 +692,7 @@ of Social Network Analysis. Sage Publications. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.average_clustering.html b/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.average_clustering.html index df875d0a..c962e7c3 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.average_clustering.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.average_clustering.html @@ -703,7 +703,7 @@ Social Networks 30(1), 31–48.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.clustering.html b/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.clustering.html index 8efdd2cc..7708f616 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.clustering.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.clustering.html @@ -705,7 +705,7 @@ Social Networks 30(1), 31–48.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.latapy_clustering.html b/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.latapy_clustering.html index d18017b0..6feac48f 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.latapy_clustering.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.latapy_clustering.html @@ -705,7 +705,7 @@ Social Networks 30(1), 31–48.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.robins_alexander_clustering.html b/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.robins_alexander_clustering.html index 1f3062ed..d5074e90 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.robins_alexander_clustering.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.cluster.robins_alexander_clustering.html @@ -682,7 +682,7 @@ Computational & Mathematical Organization Theory 10(1), 69–94.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.covering.min_edge_cover.html b/reference/algorithms/generated/networkx.algorithms.bipartite.covering.min_edge_cover.html index ca15c971..c890e174 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.covering.min_edge_cover.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.covering.min_edge_cover.html @@ -674,7 +674,7 @@ is bounded by the worst-case running time of the function <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.generate_edgelist.html b/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.generate_edgelist.html index 5b8cf34d..526530a3 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.generate_edgelist.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.generate_edgelist.html @@ -688,7 +688,7 @@ values corresponding to the keys.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.parse_edgelist.html b/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.parse_edgelist.html index 34f1a402..cedd1e3d 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.parse_edgelist.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.parse_edgelist.html @@ -696,7 +696,7 @@ key names and types for edge data.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.read_edgelist.html b/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.read_edgelist.html index aa5dbb7b..e794b49d 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.read_edgelist.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.read_edgelist.html @@ -711,7 +711,7 @@ types (e.g. int, float, str, frozenset - or tuples of those, etc.)</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.write_edgelist.html b/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.write_edgelist.html index 9dc11def..5ef8b66f 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.write_edgelist.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.edgelist.write_edgelist.html @@ -686,7 +686,7 @@ in the list.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.alternating_havel_hakimi_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.alternating_havel_hakimi_graph.html index c48fe145..67f19210 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.alternating_havel_hakimi_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.alternating_havel_hakimi_graph.html @@ -667,7 +667,7 @@ To use it use nx.bipartite.alternating_havel_hakimi_graph</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.complete_bipartite_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.complete_bipartite_graph.html index e5f5c3b6..627ed83f 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.complete_bipartite_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.complete_bipartite_graph.html @@ -661,7 +661,7 @@ To use it use nx.bipartite.complete_bipartite_graph</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.configuration_model.html b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.configuration_model.html index 2ca2fd30..de3e1d4e 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.configuration_model.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.configuration_model.html @@ -667,7 +667,7 @@ To use it use nx.bipartite.configuration_model</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.gnmk_random_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.gnmk_random_graph.html index 236f4c66..e694aa12 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.gnmk_random_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.gnmk_random_graph.html @@ -676,7 +676,7 @@ G = bipartite.gnmk_random_graph(10,20,50)</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.havel_hakimi_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.havel_hakimi_graph.html index 2e54cd17..e9338d23 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.havel_hakimi_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.havel_hakimi_graph.html @@ -666,7 +666,7 @@ To use it use nx.bipartite.havel_hakimi_graph</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.preferential_attachment_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.preferential_attachment_graph.html index ff430c64..52c85c7c 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.preferential_attachment_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.preferential_attachment_graph.html @@ -680,7 +680,7 @@ Inf. Process. Lett. 90, 2004, pg. 215-221 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.random_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.random_graph.html index 6f29cb74..660c40b1 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.random_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.random_graph.html @@ -683,7 +683,7 @@ Phys. Rev. E, 71, 036113, 2005.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.reverse_havel_hakimi_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.reverse_havel_hakimi_graph.html index d4b0eb9b..deb992fb 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.generators.reverse_havel_hakimi_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.generators.reverse_havel_hakimi_graph.html @@ -666,7 +666,7 @@ To use it use nx.bipartite.reverse_havel_hakimi_graph</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.matching.eppstein_matching.html b/reference/algorithms/generated/networkx.algorithms.bipartite.matching.eppstein_matching.html index c2199f0f..01560a84 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.matching.eppstein_matching.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.matching.eppstein_matching.html @@ -681,7 +681,7 @@ for further details on how bipartite graphs are handled in NetworkX.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.matching.hopcroft_karp_matching.html b/reference/algorithms/generated/networkx.algorithms.bipartite.matching.hopcroft_karp_matching.html index dbf3e31c..95d2f9e7 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.matching.hopcroft_karp_matching.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.matching.hopcroft_karp_matching.html @@ -696,7 +696,7 @@ Maximum Matchings in Bipartite Graphs” In: <strong>SIAM Journal of Computing</ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.matching.maximum_matching.html b/reference/algorithms/generated/networkx.algorithms.bipartite.matching.maximum_matching.html index bd171c45..63ed4056 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.matching.maximum_matching.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.matching.maximum_matching.html @@ -640,7 +640,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.matching.minimum_weight_full_matching.html b/reference/algorithms/generated/networkx.algorithms.bipartite.matching.minimum_weight_full_matching.html index a2635d73..ab9705c2 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.matching.minimum_weight_full_matching.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.matching.minimum_weight_full_matching.html @@ -695,7 +695,7 @@ Networks, 10(2):143–152, 1980.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.matching.to_vertex_cover.html b/reference/algorithms/generated/networkx.algorithms.bipartite.matching.to_vertex_cover.html index 9e99dc71..bb726d2f 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.matching.to_vertex_cover.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.matching.to_vertex_cover.html @@ -690,7 +690,7 @@ for further details on how bipartite graphs are handled in NetworkX.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.matrix.biadjacency_matrix.html b/reference/algorithms/generated/networkx.algorithms.bipartite.matrix.biadjacency_matrix.html index 9cdaccd3..d7471a4e 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.matrix.biadjacency_matrix.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.matrix.biadjacency_matrix.html @@ -700,7 +700,7 @@ one to the transpose of the other.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.matrix.from_biadjacency_matrix.html b/reference/algorithms/generated/networkx.algorithms.bipartite.matrix.from_biadjacency_matrix.html index 8469a119..b835ac3c 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.matrix.from_biadjacency_matrix.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.matrix.from_biadjacency_matrix.html @@ -670,7 +670,7 @@ will be ignored.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.projection.collaboration_weighted_projected_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.projection.collaboration_weighted_projected_graph.html index 1c24c0f3..cdfe723a 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.projection.collaboration_weighted_projected_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.projection.collaboration_weighted_projected_graph.html @@ -711,7 +711,7 @@ M. E. J. Newman, Phys. Rev. E 64, 016132 (2001).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.projection.generic_weighted_projected_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.projection.generic_weighted_projected_graph.html index 3f61dde5..7f4c683f 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.projection.generic_weighted_projected_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.projection.generic_weighted_projected_graph.html @@ -726,7 +726,7 @@ for further details on how bipartite graphs are handled in NetworkX.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.projection.overlap_weighted_projected_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.projection.overlap_weighted_projected_graph.html index 17739be1..fbbf42ee 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.projection.overlap_weighted_projected_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.projection.overlap_weighted_projected_graph.html @@ -711,7 +711,7 @@ of Social Network Analysis. Sage Publications.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.projection.projected_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.projection.projected_graph.html index 24f331a3..28b875a5 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.projection.projected_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.projection.projected_graph.html @@ -705,7 +705,7 @@ building a multigraph results in two edges in the projection onto <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.projection.weighted_projected_graph.html b/reference/algorithms/generated/networkx.algorithms.bipartite.projection.weighted_projected_graph.html index b3b6b164..ffc0e8d7 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.projection.weighted_projected_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.projection.weighted_projected_graph.html @@ -708,7 +708,7 @@ of Social Network Analysis. Sage Publications.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.redundancy.node_redundancy.html b/reference/algorithms/generated/networkx.algorithms.bipartite.redundancy.node_redundancy.html index 07659728..597b3d59 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.redundancy.node_redundancy.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.redundancy.node_redundancy.html @@ -711,7 +711,7 @@ Social Networks 30(1), 31–48.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bipartite.spectral.spectral_bipartivity.html b/reference/algorithms/generated/networkx.algorithms.bipartite.spectral.spectral_bipartivity.html index dab40d28..496f4284 100644 --- a/reference/algorithms/generated/networkx.algorithms.bipartite.spectral.spectral_bipartivity.html +++ b/reference/algorithms/generated/networkx.algorithms.bipartite.spectral.spectral_bipartivity.html @@ -682,7 +682,7 @@ bipartivity in complex networks”, PhysRev E 72, 046105 (2005)</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.boundary.edge_boundary.html b/reference/algorithms/generated/networkx.algorithms.boundary.edge_boundary.html index c5ecf07c..f2fd86a5 100644 --- a/reference/algorithms/generated/networkx.algorithms.boundary.edge_boundary.html +++ b/reference/algorithms/generated/networkx.algorithms.boundary.edge_boundary.html @@ -682,7 +682,7 @@ the interest of speed and generality, that is not required here.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.boundary.node_boundary.html b/reference/algorithms/generated/networkx.algorithms.boundary.node_boundary.html index 406cb02f..3b1b8cbf 100644 --- a/reference/algorithms/generated/networkx.algorithms.boundary.node_boundary.html +++ b/reference/algorithms/generated/networkx.algorithms.boundary.node_boundary.html @@ -670,7 +670,7 @@ the interest of speed and generality, that is not required here.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bridges.bridges.html b/reference/algorithms/generated/networkx.algorithms.bridges.bridges.html index a87fd37c..3ef556d1 100644 --- a/reference/algorithms/generated/networkx.algorithms.bridges.bridges.html +++ b/reference/algorithms/generated/networkx.algorithms.bridges.bridges.html @@ -695,7 +695,7 @@ the number of edges.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bridges.has_bridges.html b/reference/algorithms/generated/networkx.algorithms.bridges.has_bridges.html index 551ae7a9..0e914bc7 100644 --- a/reference/algorithms/generated/networkx.algorithms.bridges.has_bridges.html +++ b/reference/algorithms/generated/networkx.algorithms.bridges.has_bridges.html @@ -685,7 +685,7 @@ graph and <span class="math notranslate nohighlight">\(m\)</span> is the number <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.bridges.local_bridges.html b/reference/algorithms/generated/networkx.algorithms.bridges.local_bridges.html index e379d3bb..11b5a149 100644 --- a/reference/algorithms/generated/networkx.algorithms.bridges.local_bridges.html +++ b/reference/algorithms/generated/networkx.algorithms.bridges.local_bridges.html @@ -676,7 +676,7 @@ as a 3-tuple <code class="xref py py-obj docutils literal notranslate"><span cla <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.approximate_current_flow_betweenness_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.approximate_current_flow_betweenness_centrality.html index 44cd3493..cddd2ae3 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.approximate_current_flow_betweenness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.approximate_current_flow_betweenness_centrality.html @@ -700,7 +700,7 @@ LNCS 3404, pp. 533-544. Springer-Verlag, 2005. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.betweenness_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.betweenness_centrality.html index f7f292dc..fde1c9f4 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.betweenness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.betweenness_centrality.html @@ -745,7 +745,7 @@ Sociometry 40: 35–41, 1977 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.betweenness_centrality_subset.html b/reference/algorithms/generated/networkx.algorithms.centrality.betweenness_centrality_subset.html index 0b901284..b02bf31d 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.betweenness_centrality_subset.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.betweenness_centrality_subset.html @@ -719,7 +719,7 @@ Social Networks 30(2):136-145, 2008. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.closeness_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.closeness_centrality.html index 52eb355a..c1a906fd 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.closeness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.closeness_centrality.html @@ -725,7 +725,7 @@ Cambridge University Press.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.communicability_betweenness_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.communicability_betweenness_centrality.html index 79c74c1d..d882d159 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.communicability_betweenness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.communicability_betweenness_centrality.html @@ -700,7 +700,7 @@ Physica A 388 (2009) 764-774. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_betweenness_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_betweenness_centrality.html index e660cede..a01a7643 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_betweenness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_betweenness_centrality.html @@ -709,7 +709,7 @@ M. E. J. Newman, Social Networks 27, 39-54 (2005).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_betweenness_centrality_subset.html b/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_betweenness_centrality_subset.html index a15647b6..0b31a128 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_betweenness_centrality_subset.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_betweenness_centrality_subset.html @@ -713,7 +713,7 @@ M. E. J. Newman, Social Networks 27, 39-54 (2005).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_closeness_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_closeness_centrality.html index 8c850622..81ae2d2a 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_closeness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.current_flow_closeness_centrality.html @@ -695,7 +695,7 @@ Social Networks 11(1):1-37, 1989. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.degree_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.degree_centrality.html index 42b7b7ef..f0adb51f 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.degree_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.degree_centrality.html @@ -673,7 +673,7 @@ are possible.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.dispersion.html b/reference/algorithms/generated/networkx.algorithms.centrality.dispersion.html index 411e532e..604c393d 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.dispersion.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.dispersion.html @@ -687,7 +687,7 @@ Lars Backstrom, Jon Kleinberg. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.edge_betweenness_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.edge_betweenness_centrality.html index d6f766d2..e7d9c75b 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.edge_betweenness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.edge_betweenness_centrality.html @@ -706,7 +706,7 @@ Social Networks 30(2):136-145, 2008. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.edge_betweenness_centrality_subset.html b/reference/algorithms/generated/networkx.algorithms.centrality.edge_betweenness_centrality_subset.html index c56b8813..6e3ed031 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.edge_betweenness_centrality_subset.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.edge_betweenness_centrality_subset.html @@ -705,7 +705,7 @@ Social Networks 30(2):136-145, 2008. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.edge_current_flow_betweenness_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.edge_current_flow_betweenness_centrality.html index 3b031c02..89159547 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.edge_current_flow_betweenness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.edge_current_flow_betweenness_centrality.html @@ -716,7 +716,7 @@ M. E. J. Newman, Social Networks 27, 39-54 (2005).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.edge_current_flow_betweenness_centrality_subset.html b/reference/algorithms/generated/networkx.algorithms.centrality.edge_current_flow_betweenness_centrality_subset.html index 3f2e7871..25ced1bf 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.edge_current_flow_betweenness_centrality_subset.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.edge_current_flow_betweenness_centrality_subset.html @@ -713,7 +713,7 @@ M. E. J. Newman, Social Networks 27, 39-54 (2005).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.edge_load_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.edge_load_centrality.html index bdcb9192..5184d7ef 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.edge_load_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.edge_load_centrality.html @@ -661,7 +661,7 @@ This function is for demonstration and testing purposes.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.eigenvector_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.eigenvector_centrality.html index e1ae68cb..a4efd8cd 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.eigenvector_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.eigenvector_centrality.html @@ -730,7 +730,7 @@ Oxford University Press, USA, 2010, pp. 169.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.eigenvector_centrality_numpy.html b/reference/algorithms/generated/networkx.algorithms.centrality.eigenvector_centrality_numpy.html index bc97b663..c82b0b26 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.eigenvector_centrality_numpy.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.eigenvector_centrality_numpy.html @@ -715,7 +715,7 @@ Oxford University Press, USA, 2010, pp. 169.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.estrada_index.html b/reference/algorithms/generated/networkx.algorithms.centrality.estrada_index.html index 644a9c77..2bf228b6 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.estrada_index.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.estrada_index.html @@ -690,7 +690,7 @@ Linear Algebra and its Applications. 427, 1 (2007). <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.global_reaching_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.global_reaching_centrality.html index 609228c7..98aec1a6 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.global_reaching_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.global_reaching_centrality.html @@ -694,7 +694,7 @@ weights.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.group_betweenness_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.group_betweenness_centrality.html index e40af544..f5b49f7b 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.group_betweenness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.group_betweenness_centrality.html @@ -734,7 +734,7 @@ SIAM International Conference on Data Mining, SDM 2018, 126–134. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.group_closeness_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.group_closeness_centrality.html index bef2d861..bd7a8dbf 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.group_closeness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.group_closeness_centrality.html @@ -711,7 +711,7 @@ WWWConference Proceedings, 2014. 689-694. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.group_degree_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.group_degree_centrality.html index 262c7fec..ce45fc80 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.group_degree_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.group_degree_centrality.html @@ -687,7 +687,7 @@ Journal of Mathematical Sociology. 23(3): 181-201. 1999. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.group_in_degree_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.group_in_degree_centrality.html index 652eb80c..d03adde9 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.group_in_degree_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.group_in_degree_centrality.html @@ -680,7 +680,7 @@ so for group in-degree centrality, the reverse graph is used.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.group_out_degree_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.group_out_degree_centrality.html index 4d4f0f4b..915811be 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.group_out_degree_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.group_out_degree_centrality.html @@ -680,7 +680,7 @@ so for group out-degree centrality, the graph itself is used.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.harmonic_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.harmonic_centrality.html index 10b0f953..b02b0818 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.harmonic_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.harmonic_centrality.html @@ -691,7 +691,7 @@ Internet Mathematics 10.3-4 (2014): 222-262.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.in_degree_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.in_degree_centrality.html index 2def886c..285551ee 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.in_degree_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.in_degree_centrality.html @@ -679,7 +679,7 @@ are possible.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.incremental_closeness_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.incremental_closeness_centrality.html index 8a45b2b2..0cd265ef 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.incremental_closeness_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.incremental_closeness_centrality.html @@ -723,7 +723,7 @@ Algorithms for Closeness Centrality. 2013 IEEE International Conference on Big D <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.information_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.information_centrality.html index e9c5744e..06ceb02e 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.information_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.information_centrality.html @@ -695,7 +695,7 @@ Social Networks 11(1):1-37, 1989. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.katz_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.katz_centrality.html index c8905cfc..34c14353 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.katz_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.katz_centrality.html @@ -755,7 +755,7 @@ Psychometrika 18(1):39–43, 1953 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.katz_centrality_numpy.html b/reference/algorithms/generated/networkx.algorithms.centrality.katz_centrality_numpy.html index 12c0efce..c227eace 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.katz_centrality_numpy.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.katz_centrality_numpy.html @@ -742,7 +742,7 @@ Psychometrika 18(1):39–43, 1953 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.load_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.load_centrality.html index 87255446..d8c66b49 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.load_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.load_centrality.html @@ -691,7 +691,7 @@ Physical Review Letters 87(27):1–4, 2001. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.local_reaching_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.local_reaching_centrality.html index c19c07f3..7f33cc1c 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.local_reaching_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.local_reaching_centrality.html @@ -698,7 +698,7 @@ weights.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.out_degree_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.out_degree_centrality.html index 4ab733ab..d8e24ead 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.out_degree_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.out_degree_centrality.html @@ -679,7 +679,7 @@ are possible.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.percolation_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.percolation_centrality.html index baf3ecf9..2b86f074 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.percolation_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.percolation_centrality.html @@ -706,7 +706,7 @@ Journal of Mathematical Sociology 25(2):163-177, 2001. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.prominent_group.html b/reference/algorithms/generated/networkx.algorithms.centrality.prominent_group.html index 4ead9099..20bc3c81 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.prominent_group.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.prominent_group.html @@ -740,7 +740,7 @@ SIAM International Conference on Data Mining, SDM 2018, 126–134. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.second_order_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.second_order_centrality.html index 3cada15d..04f9240f 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.second_order_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.second_order_centrality.html @@ -696,7 +696,7 @@ complex networks”, Elsevier Computer Communications 34(5):619-628, 2011.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.subgraph_centrality.html b/reference/algorithms/generated/networkx.algorithms.centrality.subgraph_centrality.html index 05d384a1..32c56168 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.subgraph_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.subgraph_centrality.html @@ -711,7 +711,7 @@ Physical Review E 71, 056103 (2005). <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.subgraph_centrality_exp.html b/reference/algorithms/generated/networkx.algorithms.centrality.subgraph_centrality_exp.html index ba0a5756..91154361 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.subgraph_centrality_exp.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.subgraph_centrality_exp.html @@ -708,7 +708,7 @@ Physical Review E 71, 056103 (2005). <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.trophic_differences.html b/reference/algorithms/generated/networkx.algorithms.centrality.trophic_differences.html index 2a75da33..6571fbd5 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.trophic_differences.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.trophic_differences.html @@ -667,7 +667,7 @@ Munoz (2014) PNAS “Trophic coherence determines food-web stability”</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.trophic_incoherence_parameter.html b/reference/algorithms/generated/networkx.algorithms.centrality.trophic_incoherence_parameter.html index fcce2444..0aae5f0f 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.trophic_incoherence_parameter.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.trophic_incoherence_parameter.html @@ -668,7 +668,7 @@ Munoz (2014) PNAS “Trophic coherence determines food-web stability”</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.trophic_levels.html b/reference/algorithms/generated/networkx.algorithms.centrality.trophic_levels.html index 9bf3bdf6..ada50367 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.trophic_levels.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.trophic_levels.html @@ -669,7 +669,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.centrality.voterank.html b/reference/algorithms/generated/networkx.algorithms.centrality.voterank.html index f272de9c..f1a599aa 100644 --- a/reference/algorithms/generated/networkx.algorithms.centrality.voterank.html +++ b/reference/algorithms/generated/networkx.algorithms.centrality.voterank.html @@ -686,7 +686,7 @@ However, the directed version is different in two ways: <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.chains.chain_decomposition.html b/reference/algorithms/generated/networkx.algorithms.chains.chain_decomposition.html index 1ccac40a..aebf9a8c 100644 --- a/reference/algorithms/generated/networkx.algorithms.chains.chain_decomposition.html +++ b/reference/algorithms/generated/networkx.algorithms.chains.chain_decomposition.html @@ -694,7 +694,7 @@ and 2-edge-connectivity.” <em>Information Processing Letters</em>, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.chordal.chordal_graph_cliques.html b/reference/algorithms/generated/networkx.algorithms.chordal.chordal_graph_cliques.html index d8e07949..5e93d30b 100644 --- a/reference/algorithms/generated/networkx.algorithms.chordal.chordal_graph_cliques.html +++ b/reference/algorithms/generated/networkx.algorithms.chordal.chordal_graph_cliques.html @@ -685,7 +685,7 @@ graph is found to be non-chordal, a <code class="xref py py-exc docutils literal <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.chordal.chordal_graph_treewidth.html b/reference/algorithms/generated/networkx.algorithms.chordal.chordal_graph_treewidth.html index 8088c762..a4a02f31 100644 --- a/reference/algorithms/generated/networkx.algorithms.chordal.chordal_graph_treewidth.html +++ b/reference/algorithms/generated/networkx.algorithms.chordal.chordal_graph_treewidth.html @@ -688,7 +688,7 @@ graph is found to be non-chordal, a <code class="xref py py-exc docutils literal <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.chordal.complete_to_chordal_graph.html b/reference/algorithms/generated/networkx.algorithms.chordal.complete_to_chordal_graph.html index 2801cf69..e13e0fb0 100644 --- a/reference/algorithms/generated/networkx.algorithms.chordal.complete_to_chordal_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.chordal.complete_to_chordal_graph.html @@ -679,7 +679,7 @@ Graphs. Algorithmica. 39. 287-298. 10.1007/s00453-004-1084-3.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.chordal.find_induced_nodes.html b/reference/algorithms/generated/networkx.algorithms.chordal.find_induced_nodes.html index c8c82fc6..03311e47 100644 --- a/reference/algorithms/generated/networkx.algorithms.chordal.find_induced_nodes.html +++ b/reference/algorithms/generated/networkx.algorithms.chordal.find_induced_nodes.html @@ -693,7 +693,7 @@ Gal Elidan, Stephen Gould; JMLR, 9(Dec):2699–2731, 2008. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.chordal.is_chordal.html b/reference/algorithms/generated/networkx.algorithms.chordal.is_chordal.html index 2a0e4d59..e1b8b345 100644 --- a/reference/algorithms/generated/networkx.algorithms.chordal.is_chordal.html +++ b/reference/algorithms/generated/networkx.algorithms.chordal.is_chordal.html @@ -693,7 +693,7 @@ pp. 566–579.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.clique.cliques_containing_node.html b/reference/algorithms/generated/networkx.algorithms.clique.cliques_containing_node.html index e246b1b5..ef160907 100644 --- a/reference/algorithms/generated/networkx.algorithms.clique.cliques_containing_node.html +++ b/reference/algorithms/generated/networkx.algorithms.clique.cliques_containing_node.html @@ -641,7 +641,7 @@ Optional list of cliques can be input if already computed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.clique.enumerate_all_cliques.html b/reference/algorithms/generated/networkx.algorithms.clique.enumerate_all_cliques.html index 779d2d45..e865d72c 100644 --- a/reference/algorithms/generated/networkx.algorithms.clique.enumerate_all_cliques.html +++ b/reference/algorithms/generated/networkx.algorithms.clique.enumerate_all_cliques.html @@ -682,7 +682,7 @@ Conference, pp. 12, 12–18 Nov. 2005. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.clique.find_cliques.html b/reference/algorithms/generated/networkx.algorithms.clique.find_cliques.html index f434c0cd..31f82b8e 100644 --- a/reference/algorithms/generated/networkx.algorithms.clique.find_cliques.html +++ b/reference/algorithms/generated/networkx.algorithms.clique.find_cliques.html @@ -724,7 +724,7 @@ Volume 407, Issues 1–3, 6 November 2008, Pages 564–568, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.clique.find_cliques_recursive.html b/reference/algorithms/generated/networkx.algorithms.clique.find_cliques_recursive.html index 5c19d40b..c1ec806a 100644 --- a/reference/algorithms/generated/networkx.algorithms.clique.find_cliques_recursive.html +++ b/reference/algorithms/generated/networkx.algorithms.clique.find_cliques_recursive.html @@ -722,7 +722,7 @@ Volume 407, Issues 1–3, 6 November 2008, Pages 564–568, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.clique.graph_clique_number.html b/reference/algorithms/generated/networkx.algorithms.clique.graph_clique_number.html index 1edf4bcd..3aa97657 100644 --- a/reference/algorithms/generated/networkx.algorithms.clique.graph_clique_number.html +++ b/reference/algorithms/generated/networkx.algorithms.clique.graph_clique_number.html @@ -663,7 +663,7 @@ maximal cliques.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.clique.graph_number_of_cliques.html b/reference/algorithms/generated/networkx.algorithms.clique.graph_number_of_cliques.html index 15cbceb7..4bc31baa 100644 --- a/reference/algorithms/generated/networkx.algorithms.clique.graph_number_of_cliques.html +++ b/reference/algorithms/generated/networkx.algorithms.clique.graph_number_of_cliques.html @@ -661,7 +661,7 @@ maximal cliques.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.clique.make_clique_bipartite.html b/reference/algorithms/generated/networkx.algorithms.clique.make_clique_bipartite.html index 5d1f7a72..8f695183 100644 --- a/reference/algorithms/generated/networkx.algorithms.clique.make_clique_bipartite.html +++ b/reference/algorithms/generated/networkx.algorithms.clique.make_clique_bipartite.html @@ -669,7 +669,7 @@ convention for bipartite graphs in NetworkX.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.clique.make_max_clique_graph.html b/reference/algorithms/generated/networkx.algorithms.clique.make_max_clique_graph.html index d7ca4a0d..becc5234 100644 --- a/reference/algorithms/generated/networkx.algorithms.clique.make_max_clique_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.clique.make_max_clique_graph.html @@ -668,7 +668,7 @@ steps.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.clique.max_weight_clique.html b/reference/algorithms/generated/networkx.algorithms.clique.max_weight_clique.html index e9a7fdf5..46ebe6f2 100644 --- a/reference/algorithms/generated/networkx.algorithms.clique.max_weight_clique.html +++ b/reference/algorithms/generated/networkx.algorithms.clique.max_weight_clique.html @@ -689,7 +689,7 @@ Texas A&M University (2016).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.clique.node_clique_number.html b/reference/algorithms/generated/networkx.algorithms.clique.node_clique_number.html index 992e8f69..ac5d20fb 100644 --- a/reference/algorithms/generated/networkx.algorithms.clique.node_clique_number.html +++ b/reference/algorithms/generated/networkx.algorithms.clique.node_clique_number.html @@ -669,7 +669,7 @@ of the largest maximal clique containing that node.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.clique.number_of_cliques.html b/reference/algorithms/generated/networkx.algorithms.clique.number_of_cliques.html index 479f8946..d8f4d3d8 100644 --- a/reference/algorithms/generated/networkx.algorithms.clique.number_of_cliques.html +++ b/reference/algorithms/generated/networkx.algorithms.clique.number_of_cliques.html @@ -641,7 +641,7 @@ Optional list of cliques can be input if already computed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cluster.average_clustering.html b/reference/algorithms/generated/networkx.algorithms.cluster.average_clustering.html index f105b085..24e83d23 100644 --- a/reference/algorithms/generated/networkx.algorithms.cluster.average_clustering.html +++ b/reference/algorithms/generated/networkx.algorithms.cluster.average_clustering.html @@ -690,7 +690,7 @@ nodes and leafs on clustering measures for small-world networks. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cluster.clustering.html b/reference/algorithms/generated/networkx.algorithms.cluster.clustering.html index c5e8d98d..d6f1bf81 100644 --- a/reference/algorithms/generated/networkx.algorithms.cluster.clustering.html +++ b/reference/algorithms/generated/networkx.algorithms.cluster.clustering.html @@ -720,7 +720,7 @@ Physical Review E, 76(2), 026107 (2007).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cluster.generalized_degree.html b/reference/algorithms/generated/networkx.algorithms.cluster.generalized_degree.html index 0eeee28b..acc65014 100644 --- a/reference/algorithms/generated/networkx.algorithms.cluster.generalized_degree.html +++ b/reference/algorithms/generated/networkx.algorithms.cluster.generalized_degree.html @@ -695,7 +695,7 @@ Volume 97, Number 2 (2012). <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cluster.square_clustering.html b/reference/algorithms/generated/networkx.algorithms.cluster.square_clustering.html index caff2b02..626242e9 100644 --- a/reference/algorithms/generated/networkx.algorithms.cluster.square_clustering.html +++ b/reference/algorithms/generated/networkx.algorithms.cluster.square_clustering.html @@ -695,7 +695,7 @@ Bipartite Networks. Physica A: Statistical Mechanics and its Applications 387.27 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cluster.transitivity.html b/reference/algorithms/generated/networkx.algorithms.cluster.transitivity.html index c53baaa9..ee631069 100644 --- a/reference/algorithms/generated/networkx.algorithms.cluster.transitivity.html +++ b/reference/algorithms/generated/networkx.algorithms.cluster.transitivity.html @@ -665,7 +665,7 @@ present in G.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cluster.triangles.html b/reference/algorithms/generated/networkx.algorithms.cluster.triangles.html index ed70ad1c..57486dc3 100644 --- a/reference/algorithms/generated/networkx.algorithms.cluster.triangles.html +++ b/reference/algorithms/generated/networkx.algorithms.cluster.triangles.html @@ -669,7 +669,7 @@ three times, once at each node. Self loops are ignored.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.coloring.equitable_color.html b/reference/algorithms/generated/networkx.algorithms.coloring.equitable_color.html index 877f97e0..1b05f560 100644 --- a/reference/algorithms/generated/networkx.algorithms.coloring.equitable_color.html +++ b/reference/algorithms/generated/networkx.algorithms.coloring.equitable_color.html @@ -683,7 +683,7 @@ in the graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.coloring.greedy_color.html b/reference/algorithms/generated/networkx.algorithms.coloring.greedy_color.html index f81dafb9..71b9aab1 100644 --- a/reference/algorithms/generated/networkx.algorithms.coloring.greedy_color.html +++ b/reference/algorithms/generated/networkx.algorithms.coloring.greedy_color.html @@ -722,7 +722,7 @@ ISBN 0-486-45353-7.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential.html b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential.html index 9d2976a8..fac77de3 100644 --- a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential.html +++ b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential.html @@ -646,7 +646,7 @@ the first, at least one neighbor appeared earlier in the sequence.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential_bfs.html b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential_bfs.html index 399e6ae6..183c1b63 100644 --- a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential_bfs.html +++ b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential_bfs.html @@ -643,7 +643,7 @@ the first, at least one neighbor appeared earlier in the sequence.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential_dfs.html b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential_dfs.html index c9fb98d5..0cf2a493 100644 --- a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential_dfs.html +++ b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_connected_sequential_dfs.html @@ -643,7 +643,7 @@ the first, at least one neighbor appeared earlier in the sequence.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_independent_set.html b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_independent_set.html index 238085dd..a279a81d 100644 --- a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_independent_set.html +++ b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_independent_set.html @@ -648,7 +648,7 @@ instead of a maximal independent set.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_largest_first.html b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_largest_first.html index c8a628fc..8b24f7a9 100644 --- a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_largest_first.html +++ b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_largest_first.html @@ -641,7 +641,7 @@ degree.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_random_sequential.html b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_random_sequential.html index 062a18d5..da9a3da4 100644 --- a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_random_sequential.html +++ b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_random_sequential.html @@ -645,7 +645,7 @@ See <a class="reference internal" href="../../randomness.html#randomness"><span <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_saturation_largest_first.html b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_saturation_largest_first.html index 8d1b5715..e5a2a0e3 100644 --- a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_saturation_largest_first.html +++ b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_saturation_largest_first.html @@ -642,7 +642,7 @@ known as “DSATUR”).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_smallest_last.html b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_smallest_last.html index 3d47a031..2d362544 100644 --- a/reference/algorithms/generated/networkx.algorithms.coloring.strategy_smallest_last.html +++ b/reference/algorithms/generated/networkx.algorithms.coloring.strategy_smallest_last.html @@ -651,7 +651,7 @@ maximal independent set.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.communicability_alg.communicability.html b/reference/algorithms/generated/networkx.algorithms.communicability_alg.communicability.html index 2503a63c..26ca7df4 100644 --- a/reference/algorithms/generated/networkx.algorithms.communicability_alg.communicability.html +++ b/reference/algorithms/generated/networkx.algorithms.communicability_alg.communicability.html @@ -697,7 +697,7 @@ Phys. Rev. E 77, 036111 (2008). <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.communicability_alg.communicability_exp.html b/reference/algorithms/generated/networkx.algorithms.communicability_alg.communicability_exp.html index 0051b785..4369d963 100644 --- a/reference/algorithms/generated/networkx.algorithms.communicability_alg.communicability_exp.html +++ b/reference/algorithms/generated/networkx.algorithms.communicability_alg.communicability_exp.html @@ -694,7 +694,7 @@ Phys. Rev. E 77, 036111 (2008). <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.asyn_fluid.asyn_fluidc.html b/reference/algorithms/generated/networkx.algorithms.community.asyn_fluid.asyn_fluidc.html index d5bb3a46..85d51674 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.asyn_fluid.asyn_fluidc.html +++ b/reference/algorithms/generated/networkx.algorithms.community.asyn_fluid.asyn_fluidc.html @@ -688,7 +688,7 @@ Competitive and Highly Scalable Community Detection Algorithm”. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.centrality.girvan_newman.html b/reference/algorithms/generated/networkx.algorithms.community.centrality.girvan_newman.html index 761d3cb3..77e6e54e 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.centrality.girvan_newman.html +++ b/reference/algorithms/generated/networkx.algorithms.community.centrality.girvan_newman.html @@ -748,7 +748,7 @@ highest betweenness centrality:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.community_utils.is_partition.html b/reference/algorithms/generated/networkx.algorithms.community.community_utils.is_partition.html index 8b1822e3..05c2f3bd 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.community_utils.is_partition.html +++ b/reference/algorithms/generated/networkx.algorithms.community.community_utils.is_partition.html @@ -651,7 +651,7 @@ If it is an iterator it is exhausted.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.kclique.k_clique_communities.html b/reference/algorithms/generated/networkx.algorithms.community.kclique.k_clique_communities.html index b4f5e2d8..1eeeea37 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.kclique.k_clique_communities.html +++ b/reference/algorithms/generated/networkx.algorithms.community.kclique.k_clique_communities.html @@ -679,7 +679,7 @@ doi:10.1038/nature03607</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.kernighan_lin.kernighan_lin_bisection.html b/reference/algorithms/generated/networkx.algorithms.community.kernighan_lin.kernighan_lin_bisection.html index 620dd2ae..9717d7d7 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.kernighan_lin.kernighan_lin_bisection.html +++ b/reference/algorithms/generated/networkx.algorithms.community.kernighan_lin.kernighan_lin_bisection.html @@ -687,7 +687,7 @@ Oxford University Press 2011.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.label_propagation.asyn_lpa_communities.html b/reference/algorithms/generated/networkx.algorithms.community.label_propagation.asyn_lpa_communities.html index f9b038ea..fd51d970 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.label_propagation.asyn_lpa_communities.html +++ b/reference/algorithms/generated/networkx.algorithms.community.label_propagation.asyn_lpa_communities.html @@ -686,7 +686,7 @@ networks.” Physical Review E 76.3 (2007): 036106.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.label_propagation.label_propagation_communities.html b/reference/algorithms/generated/networkx.algorithms.community.label_propagation.label_propagation_communities.html index c2839162..ea1720af 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.label_propagation.label_propagation_communities.html +++ b/reference/algorithms/generated/networkx.algorithms.community.label_propagation.label_propagation_communities.html @@ -672,7 +672,7 @@ Workshop on (pp. 1-8). IEEE.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.louvain.louvain_communities.html b/reference/algorithms/generated/networkx.algorithms.community.louvain.louvain_communities.html index f1214706..6a500a9e 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.louvain.louvain_communities.html +++ b/reference/algorithms/generated/networkx.algorithms.community.louvain.louvain_communities.html @@ -733,7 +733,7 @@ well-connected communities. Sci Rep 9, 5233 (2019). <a class="reference external <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.louvain.louvain_partitions.html b/reference/algorithms/generated/networkx.algorithms.community.louvain.louvain_partitions.html index 25b3fc65..7caad751 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.louvain.louvain_partitions.html +++ b/reference/algorithms/generated/networkx.algorithms.community.louvain.louvain_partitions.html @@ -689,7 +689,7 @@ large networks. J. Stat. Mech 10008, 1-12(2008)</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.lukes.lukes_partitioning.html b/reference/algorithms/generated/networkx.algorithms.community.lukes.lukes_partitioning.html index 49943011..7ae30f07 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.lukes.lukes_partitioning.html +++ b/reference/algorithms/generated/networkx.algorithms.community.lukes.lukes_partitioning.html @@ -676,7 +676,7 @@ partition.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.modularity_max.greedy_modularity_communities.html b/reference/algorithms/generated/networkx.algorithms.community.modularity_max.greedy_modularity_communities.html index 92c1bcb2..bea0857b 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.modularity_max.greedy_modularity_communities.html +++ b/reference/algorithms/generated/networkx.algorithms.community.modularity_max.greedy_modularity_communities.html @@ -729,7 +729,7 @@ Physical Review E 70(5 Pt 2):056131, 2004.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.modularity_max.naive_greedy_modularity_communities.html b/reference/algorithms/generated/networkx.algorithms.community.modularity_max.naive_greedy_modularity_communities.html index c37d39e4..15160ee6 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.modularity_max.naive_greedy_modularity_communities.html +++ b/reference/algorithms/generated/networkx.algorithms.community.modularity_max.naive_greedy_modularity_communities.html @@ -685,7 +685,7 @@ Sorted by length with largest communities first.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.quality.modularity.html b/reference/algorithms/generated/networkx.algorithms.community.quality.modularity.html index a06d3f1c..09a0c64d 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.quality.modularity.html +++ b/reference/algorithms/generated/networkx.algorithms.community.quality.modularity.html @@ -724,7 +724,7 @@ Phys. Rev. E 94, 052315, 2016. <a class="reference external" href="https://doi.o <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.community.quality.partition_quality.html b/reference/algorithms/generated/networkx.algorithms.community.quality.partition_quality.html index d34eb5c3..0f524e78 100644 --- a/reference/algorithms/generated/networkx.algorithms.community.quality.partition_quality.html +++ b/reference/algorithms/generated/networkx.algorithms.community.quality.partition_quality.html @@ -687,7 +687,7 @@ community.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.articulation_points.html b/reference/algorithms/generated/networkx.algorithms.components.articulation_points.html index c625bb8c..ba80f315 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.articulation_points.html +++ b/reference/algorithms/generated/networkx.algorithms.components.articulation_points.html @@ -706,7 +706,7 @@ Communications of the ACM 16: 372–378. doi:10.1145/362248.362272</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.attracting_components.html b/reference/algorithms/generated/networkx.algorithms.components.attracting_components.html index fe9b1096..17979505 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.attracting_components.html +++ b/reference/algorithms/generated/networkx.algorithms.components.attracting_components.html @@ -674,7 +674,7 @@ the node will be visited infinitely often.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.biconnected_component_edges.html b/reference/algorithms/generated/networkx.algorithms.components.biconnected_component_edges.html index d7b68ccb..fe340165 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.biconnected_component_edges.html +++ b/reference/algorithms/generated/networkx.algorithms.components.biconnected_component_edges.html @@ -709,7 +709,7 @@ Communications of the ACM 16: 372–378. doi:10.1145/362248.362272</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.biconnected_components.html b/reference/algorithms/generated/networkx.algorithms.components.biconnected_components.html index d1a27791..680bebd7 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.biconnected_components.html +++ b/reference/algorithms/generated/networkx.algorithms.components.biconnected_components.html @@ -728,7 +728,7 @@ efficient to use max instead of sort.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.condensation.html b/reference/algorithms/generated/networkx.algorithms.components.condensation.html index fb5c4dc4..3fb50cbe 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.condensation.html +++ b/reference/algorithms/generated/networkx.algorithms.components.condensation.html @@ -696,7 +696,7 @@ using the barbell graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.connected_components.html b/reference/algorithms/generated/networkx.algorithms.components.connected_components.html index 1591c12a..6e762667 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.connected_components.html +++ b/reference/algorithms/generated/networkx.algorithms.components.connected_components.html @@ -685,7 +685,7 @@ efficient to use max instead of sort.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.is_attracting_component.html b/reference/algorithms/generated/networkx.algorithms.components.is_attracting_component.html index 6d705687..046ab1a5 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.is_attracting_component.html +++ b/reference/algorithms/generated/networkx.algorithms.components.is_attracting_component.html @@ -666,7 +666,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.is_biconnected.html b/reference/algorithms/generated/networkx.algorithms.components.is_biconnected.html index 392cee5b..01019b97 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.is_biconnected.html +++ b/reference/algorithms/generated/networkx.algorithms.components.is_biconnected.html @@ -705,7 +705,7 @@ Communications of the ACM 16: 372–378. doi:10.1145/362248.362272</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.is_connected.html b/reference/algorithms/generated/networkx.algorithms.components.is_connected.html index eef420e0..d4616e97 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.is_connected.html +++ b/reference/algorithms/generated/networkx.algorithms.components.is_connected.html @@ -677,7 +677,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.is_semiconnected.html b/reference/algorithms/generated/networkx.algorithms.components.is_semiconnected.html index da1ff627..e8bcb75c 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.is_semiconnected.html +++ b/reference/algorithms/generated/networkx.algorithms.components.is_semiconnected.html @@ -683,7 +683,7 @@ is reachable from the other, or they are mutually reachable.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.is_strongly_connected.html b/reference/algorithms/generated/networkx.algorithms.components.is_strongly_connected.html index d78ca99f..855789e9 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.is_strongly_connected.html +++ b/reference/algorithms/generated/networkx.algorithms.components.is_strongly_connected.html @@ -682,7 +682,7 @@ the graph is reachable from every other vertex.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.is_weakly_connected.html b/reference/algorithms/generated/networkx.algorithms.components.is_weakly_connected.html index 393635b4..ae062793 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.is_weakly_connected.html +++ b/reference/algorithms/generated/networkx.algorithms.components.is_weakly_connected.html @@ -686,7 +686,7 @@ connected as well.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.kosaraju_strongly_connected_components.html b/reference/algorithms/generated/networkx.algorithms.components.kosaraju_strongly_connected_components.html index 823afe18..8b152f3f 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.kosaraju_strongly_connected_components.html +++ b/reference/algorithms/generated/networkx.algorithms.components.kosaraju_strongly_connected_components.html @@ -686,7 +686,7 @@ use max instead of sort.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.node_connected_component.html b/reference/algorithms/generated/networkx.algorithms.components.node_connected_component.html index 51f569f4..e01f0c63 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.node_connected_component.html +++ b/reference/algorithms/generated/networkx.algorithms.components.node_connected_component.html @@ -675,7 +675,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.number_attracting_components.html b/reference/algorithms/generated/networkx.algorithms.components.number_attracting_components.html index 1221d334..9187b0c6 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.number_attracting_components.html +++ b/reference/algorithms/generated/networkx.algorithms.components.number_attracting_components.html @@ -666,7 +666,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.number_connected_components.html b/reference/algorithms/generated/networkx.algorithms.components.number_connected_components.html index 641acf09..5dfef77c 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.number_connected_components.html +++ b/reference/algorithms/generated/networkx.algorithms.components.number_connected_components.html @@ -669,7 +669,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.number_strongly_connected_components.html b/reference/algorithms/generated/networkx.algorithms.components.number_strongly_connected_components.html index 1f950dfe..f47b4b50 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.number_strongly_connected_components.html +++ b/reference/algorithms/generated/networkx.algorithms.components.number_strongly_connected_components.html @@ -675,7 +675,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.number_weakly_connected_components.html b/reference/algorithms/generated/networkx.algorithms.components.number_weakly_connected_components.html index e7807fd2..f9633e65 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.number_weakly_connected_components.html +++ b/reference/algorithms/generated/networkx.algorithms.components.number_weakly_connected_components.html @@ -675,7 +675,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.strongly_connected_components.html b/reference/algorithms/generated/networkx.algorithms.components.strongly_connected_components.html index 970ac9e5..74fd47b3 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.strongly_connected_components.html +++ b/reference/algorithms/generated/networkx.algorithms.components.strongly_connected_components.html @@ -701,7 +701,7 @@ use max instead of sort.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.strongly_connected_components_recursive.html b/reference/algorithms/generated/networkx.algorithms.components.strongly_connected_components_recursive.html index 27b56ef8..7cd4e2e9 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.strongly_connected_components_recursive.html +++ b/reference/algorithms/generated/networkx.algorithms.components.strongly_connected_components_recursive.html @@ -703,7 +703,7 @@ use max instead of sort.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.components.weakly_connected_components.html b/reference/algorithms/generated/networkx.algorithms.components.weakly_connected_components.html index 8581f645..c54bccdf 100644 --- a/reference/algorithms/generated/networkx.algorithms.components.weakly_connected_components.html +++ b/reference/algorithms/generated/networkx.algorithms.components.weakly_connected_components.html @@ -685,7 +685,7 @@ use max instead of sort:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity.html b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity.html index e1b7c2fa..5ce21f40 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.all_pairs_node_connectivity.html @@ -678,7 +678,7 @@ in G, or in nbunch if provided.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.average_node_connectivity.html b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.average_node_connectivity.html index d41a3795..7314f76b 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.average_node_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.average_node_connectivity.html @@ -688,7 +688,7 @@ connectivity of a graph. Discrete mathematics 252(1-3), 31-45. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.edge_connectivity.html b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.edge_connectivity.html index ce4cd191..22c793e0 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.edge_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.edge_connectivity.html @@ -737,7 +737,7 @@ the data structures used in the maximum flow computations. See <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.local_edge_connectivity.html b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.local_edge_connectivity.html index 8a15f074..e6b1a4bb 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.local_edge_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.local_edge_connectivity.html @@ -768,7 +768,7 @@ functions have to be explicitly imported from the flow package.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.local_node_connectivity.html b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.local_node_connectivity.html index d6a6bb3c..96c07ae3 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.local_node_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.local_node_connectivity.html @@ -779,7 +779,7 @@ functions have to be explicitly imported from the flow package.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.node_connectivity.html b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.node_connectivity.html index ec0b4e3e..cfb2031b 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.node_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.connectivity.node_connectivity.html @@ -728,7 +728,7 @@ the data structures used in the maximum flow computations. See <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_edge_cut.html b/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_edge_cut.html index 1c6a726a..b51da2fb 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_edge_cut.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_edge_cut.html @@ -733,7 +733,7 @@ the data structures used in the maximum flow computations. See <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_node_cut.html b/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_node_cut.html index 227b7ad8..8be28629 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_node_cut.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_node_cut.html @@ -730,7 +730,7 @@ the data structures used in the maximum flow computations. See <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_st_edge_cut.html b/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_st_edge_cut.html index c74252c8..9438661c 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_st_edge_cut.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_st_edge_cut.html @@ -744,7 +744,7 @@ functions have to be explicitly imported from the flow package.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_st_node_cut.html b/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_st_node_cut.html index 6e462663..955193e0 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_st_node_cut.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.cuts.minimum_st_node_cut.html @@ -752,7 +752,7 @@ functions have to be explicitly imported from the flow package.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.disjoint_paths.edge_disjoint_paths.html b/reference/algorithms/generated/networkx.algorithms.connectivity.disjoint_paths.edge_disjoint_paths.html index 9724a283..880c3a23 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.disjoint_paths.edge_disjoint_paths.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.disjoint_paths.edge_disjoint_paths.html @@ -756,7 +756,7 @@ functions have to be explicitly imported from the flow package.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.disjoint_paths.node_disjoint_paths.html b/reference/algorithms/generated/networkx.algorithms.connectivity.disjoint_paths.node_disjoint_paths.html index d3f25c81..42061586 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.disjoint_paths.node_disjoint_paths.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.disjoint_paths.node_disjoint_paths.html @@ -750,7 +750,7 @@ functions have to be explicitly imported from the flow package.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected.html b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected.html index 2b41ee89..6d785bde 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.is_k_edge_connected.html @@ -671,7 +671,7 @@ If so, then G is k-edge-connected.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected.html b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected.html index 356e9522..00af796a 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.is_locally_k_edge_connected.html @@ -678,7 +678,7 @@ If so, then s and t are locally k-edge-connected in G.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation.html b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation.html index 82f037cc..44d0c19c 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_augmentation.k_edge_augmentation.html @@ -740,7 +740,7 @@ solution weight.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.html b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.html index d900e69f..3b3b2b63 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.EdgeComponentAuxGraph.html @@ -737,7 +737,7 @@ search space.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.bridge_components.html b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.bridge_components.html index 14d8b73f..a60ab2d7 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.bridge_components.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.bridge_components.html @@ -676,7 +676,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.k_edge_components.html b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.k_edge_components.html index ef9a5c9d..5bf311b3 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.k_edge_components.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.k_edge_components.html @@ -707,7 +707,7 @@ k-edge-connected components. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs.html b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs.html index 7925acca..66a214c9 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.edge_kcomponents.k_edge_subgraphs.html @@ -700,7 +700,7 @@ Technology 2012 480-–491. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.kcomponents.k_components.html b/reference/algorithms/generated/networkx.algorithms.connectivity.kcomponents.k_components.html index f4723123..8359795e 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.kcomponents.k_components.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.kcomponents.k_components.html @@ -730,7 +730,7 @@ Visualization and Heuristics for Fast Computation. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.kcutsets.all_node_cuts.html b/reference/algorithms/generated/networkx.algorithms.connectivity.kcutsets.all_node_cuts.html index 15a5ab66..2af5e42b 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.kcutsets.all_node_cuts.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.kcutsets.all_node_cuts.html @@ -705,7 +705,7 @@ sets in a graph. Networks 23(6), 533–541. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.stoerwagner.stoer_wagner.html b/reference/algorithms/generated/networkx.algorithms.connectivity.stoerwagner.stoer_wagner.html index 8909bfb3..4f7148dc 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.stoerwagner.stoer_wagner.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.stoerwagner.stoer_wagner.html @@ -716,7 +716,7 @@ negative-weighted edge.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity.html b/reference/algorithms/generated/networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity.html index 42bd188c..1d7299b8 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.utils.build_auxiliary_edge_connectivity.html @@ -652,7 +652,7 @@ chapter, look for the reference of the book). <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity.html b/reference/algorithms/generated/networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity.html index 7d7e8b2e..14380c74 100644 --- a/reference/algorithms/generated/networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity.html +++ b/reference/algorithms/generated/networkx.algorithms.connectivity.utils.build_auxiliary_node_connectivity.html @@ -664,7 +664,7 @@ Notes in Computer Science, Volume 3418, Springer-Verlag, 2005. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.core.core_number.html b/reference/algorithms/generated/networkx.algorithms.core.core_number.html index 681a7153..b0de29f8 100644 --- a/reference/algorithms/generated/networkx.algorithms.core.core_number.html +++ b/reference/algorithms/generated/networkx.algorithms.core.core_number.html @@ -676,7 +676,7 @@ Vladimir Batagelj and Matjaz Zaversnik, 2003. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.core.k_core.html b/reference/algorithms/generated/networkx.algorithms.core.k_core.html index eeac9b7f..c0b16c33 100644 --- a/reference/algorithms/generated/networkx.algorithms.core.k_core.html +++ b/reference/algorithms/generated/networkx.algorithms.core.k_core.html @@ -685,7 +685,7 @@ Vladimir Batagelj and Matjaz Zaversnik, 2003. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.core.k_corona.html b/reference/algorithms/generated/networkx.algorithms.core.k_corona.html index c7850aa8..f691af62 100644 --- a/reference/algorithms/generated/networkx.algorithms.core.k_corona.html +++ b/reference/algorithms/generated/networkx.algorithms.core.k_corona.html @@ -688,7 +688,7 @@ Phys. Rev. E 73, 056101 (2006) <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.core.k_crust.html b/reference/algorithms/generated/networkx.algorithms.core.k_crust.html index 9254d19e..d3bb689f 100644 --- a/reference/algorithms/generated/networkx.algorithms.core.k_crust.html +++ b/reference/algorithms/generated/networkx.algorithms.core.k_crust.html @@ -690,7 +690,7 @@ and Eran Shir, PNAS July 3, 2007 vol. 104 no. 27 11150-11154 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.core.k_shell.html b/reference/algorithms/generated/networkx.algorithms.core.k_shell.html index c4590e87..e2a185e8 100644 --- a/reference/algorithms/generated/networkx.algorithms.core.k_shell.html +++ b/reference/algorithms/generated/networkx.algorithms.core.k_shell.html @@ -690,7 +690,7 @@ and Eran Shir, PNAS July 3, 2007 vol. 104 no. 27 11150-11154 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.core.k_truss.html b/reference/algorithms/generated/networkx.algorithms.core.k_truss.html index ee7ef094..53c03dce 100644 --- a/reference/algorithms/generated/networkx.algorithms.core.k_truss.html +++ b/reference/algorithms/generated/networkx.algorithms.core.k_truss.html @@ -686,7 +686,7 @@ Cohen, 2005.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.core.onion_layers.html b/reference/algorithms/generated/networkx.algorithms.core.onion_layers.html index 66791aa5..bea221dd 100644 --- a/reference/algorithms/generated/networkx.algorithms.core.onion_layers.html +++ b/reference/algorithms/generated/networkx.algorithms.core.onion_layers.html @@ -691,7 +691,7 @@ Physical Review X 9, 011023 (2019) <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.covering.is_edge_cover.html b/reference/algorithms/generated/networkx.algorithms.covering.is_edge_cover.html index dcfc0a9e..b0e6d755 100644 --- a/reference/algorithms/generated/networkx.algorithms.covering.is_edge_cover.html +++ b/reference/algorithms/generated/networkx.algorithms.covering.is_edge_cover.html @@ -668,7 +668,7 @@ the graph is incident to at least one edge of the set.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.covering.min_edge_cover.html b/reference/algorithms/generated/networkx.algorithms.covering.min_edge_cover.html index 02648cb0..53b5ac41 100644 --- a/reference/algorithms/generated/networkx.algorithms.covering.min_edge_cover.html +++ b/reference/algorithms/generated/networkx.algorithms.covering.min_edge_cover.html @@ -692,7 +692,7 @@ simply this function with a default matching algorithm of <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cuts.boundary_expansion.html b/reference/algorithms/generated/networkx.algorithms.cuts.boundary_expansion.html index 8b41797c..8a41072d 100644 --- a/reference/algorithms/generated/networkx.algorithms.cuts.boundary_expansion.html +++ b/reference/algorithms/generated/networkx.algorithms.cuts.boundary_expansion.html @@ -675,7 +675,7 @@ of the node boundary and the cardinality of <em>S</em>. [1]</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cuts.conductance.html b/reference/algorithms/generated/networkx.algorithms.cuts.conductance.html index 70d7b263..4b577bf5 100644 --- a/reference/algorithms/generated/networkx.algorithms.cuts.conductance.html +++ b/reference/algorithms/generated/networkx.algorithms.cuts.conductance.html @@ -679,7 +679,7 @@ have weight one.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cuts.cut_size.html b/reference/algorithms/generated/networkx.algorithms.cuts.cut_size.html index 6fca57ac..f0202a3c 100644 --- a/reference/algorithms/generated/networkx.algorithms.cuts.cut_size.html +++ b/reference/algorithms/generated/networkx.algorithms.cuts.cut_size.html @@ -688,7 +688,7 @@ cut size:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cuts.edge_expansion.html b/reference/algorithms/generated/networkx.algorithms.cuts.edge_expansion.html index 3e51c933..a105f4f0 100644 --- a/reference/algorithms/generated/networkx.algorithms.cuts.edge_expansion.html +++ b/reference/algorithms/generated/networkx.algorithms.cuts.edge_expansion.html @@ -680,7 +680,7 @@ American Mathematical Society, 1997, ISBN 0-8218-0315-8 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cuts.mixing_expansion.html b/reference/algorithms/generated/networkx.algorithms.cuts.mixing_expansion.html index 38b0f606..84f4db1e 100644 --- a/reference/algorithms/generated/networkx.algorithms.cuts.mixing_expansion.html +++ b/reference/algorithms/generated/networkx.algorithms.cuts.mixing_expansion.html @@ -680,7 +680,7 @@ in Theoretical Computer Science</em> 7.1–3 (2011): 1–336. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cuts.node_expansion.html b/reference/algorithms/generated/networkx.algorithms.cuts.node_expansion.html index cb5588ea..b193f0bd 100644 --- a/reference/algorithms/generated/networkx.algorithms.cuts.node_expansion.html +++ b/reference/algorithms/generated/networkx.algorithms.cuts.node_expansion.html @@ -675,7 +675,7 @@ in Theoretical Computer Science</em> 7.1–3 (2011): 1–336. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cuts.normalized_cut_size.html b/reference/algorithms/generated/networkx.algorithms.cuts.normalized_cut_size.html index 86a7a59f..8228981d 100644 --- a/reference/algorithms/generated/networkx.algorithms.cuts.normalized_cut_size.html +++ b/reference/algorithms/generated/networkx.algorithms.cuts.normalized_cut_size.html @@ -682,7 +682,7 @@ multiplicity.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cuts.volume.html b/reference/algorithms/generated/networkx.algorithms.cuts.volume.html index ebd4f5dd..b96fec9c 100644 --- a/reference/algorithms/generated/networkx.algorithms.cuts.volume.html +++ b/reference/algorithms/generated/networkx.algorithms.cuts.volume.html @@ -679,7 +679,7 @@ have weight one.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cycles.cycle_basis.html b/reference/algorithms/generated/networkx.algorithms.cycles.cycle_basis.html index c4068ed5..296c2eef 100644 --- a/reference/algorithms/generated/networkx.algorithms.cycles.cycle_basis.html +++ b/reference/algorithms/generated/networkx.algorithms.cycles.cycle_basis.html @@ -684,7 +684,7 @@ cycles of a graph. Comm. ACM 12, 9 (Sept 1969), 514-518.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cycles.find_cycle.html b/reference/algorithms/generated/networkx.algorithms.cycles.find_cycle.html index 0e91dbe1..fe3a1810 100644 --- a/reference/algorithms/generated/networkx.algorithms.cycles.find_cycle.html +++ b/reference/algorithms/generated/networkx.algorithms.cycles.find_cycle.html @@ -625,7 +625,7 @@ is also known as a polytree).</p> <div class="doctest highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="n">G</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="mi">0</span><span class="p">,</span> <span class="mi">1</span><span class="p">),</span> <span class="p">(</span><span class="mi">0</span><span class="p">,</span> <span class="mi">2</span><span class="p">),</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="gp">>>> </span><span class="n">nx</span><span class="o">.</span><span class="n">find_cycle</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">orientation</span><span class="o">=</span><span class="s2">"original"</span><span class="p">)</span> <span class="gt">Traceback (most recent call last):</span> - <span class="o">...</span> +<span class="w"> </span><span class="o">...</span> <span class="gr">networkx.exception.NetworkXNoCycle</span>: <span class="n">No cycle found.</span> <span class="gp">>>> </span><span class="nb">list</span><span class="p">(</span><span class="n">nx</span><span class="o">.</span><span class="n">find_cycle</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="n">orientation</span><span class="o">=</span><span class="s2">"ignore"</span><span class="p">))</span> <span class="go">[(0, 1, 'forward'), (1, 2, 'forward'), (0, 2, 'reverse')]</span> @@ -706,7 +706,7 @@ is also known as a polytree).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cycles.minimum_cycle_basis.html b/reference/algorithms/generated/networkx.algorithms.cycles.minimum_cycle_basis.html index b7ed6a1b..0d73d4dc 100644 --- a/reference/algorithms/generated/networkx.algorithms.cycles.minimum_cycle_basis.html +++ b/reference/algorithms/generated/networkx.algorithms.cycles.minimum_cycle_basis.html @@ -679,7 +679,7 @@ Ph.D. thesis, University of Amsterdam, Netherlands</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cycles.recursive_simple_cycles.html b/reference/algorithms/generated/networkx.algorithms.cycles.recursive_simple_cycles.html index 47fe01d7..af8802a7 100644 --- a/reference/algorithms/generated/networkx.algorithms.cycles.recursive_simple_cycles.html +++ b/reference/algorithms/generated/networkx.algorithms.cycles.recursive_simple_cycles.html @@ -696,7 +696,7 @@ D. B. Johnson, SIAM Journal on Computing 4, no. 1, 77-84, 1975. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.cycles.simple_cycles.html b/reference/algorithms/generated/networkx.algorithms.cycles.simple_cycles.html index c2146079..2514876c 100644 --- a/reference/algorithms/generated/networkx.algorithms.cycles.simple_cycles.html +++ b/reference/algorithms/generated/networkx.algorithms.cycles.simple_cycles.html @@ -706,7 +706,7 @@ For example, to exclude self-loops from the above example:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.d_separation.d_separated.html b/reference/algorithms/generated/networkx.algorithms.d_separation.d_separated.html index b7fea4cb..b2fe7179 100644 --- a/reference/algorithms/generated/networkx.algorithms.d_separation.d_separated.html +++ b/reference/algorithms/generated/networkx.algorithms.d_separation.d_separated.html @@ -677,7 +677,7 @@ is <code class="docutils literal notranslate"><span class="pre">...</span> <span <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.all_topological_sorts.html b/reference/algorithms/generated/networkx.algorithms.dag.all_topological_sorts.html index e2722b00..12e47fec 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.all_topological_sorts.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.all_topological_sorts.html @@ -685,7 +685,7 @@ Elsevier (North-Holland), Amsterdam</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.ancestors.html b/reference/algorithms/generated/networkx.algorithms.dag.ancestors.html index 59882a7d..43f41d94 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.ancestors.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.ancestors.html @@ -676,7 +676,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.antichains.html b/reference/algorithms/generated/networkx.algorithms.dag.antichains.html index 5484fd01..d908d6cd 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.antichains.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.antichains.html @@ -684,7 +684,7 @@ AMS, Vol 42, 1995, p. 226.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.dag_longest_path.html b/reference/algorithms/generated/networkx.algorithms.dag.dag_longest_path.html index e87c780f..475fdd3c 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.dag_longest_path.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.dag_longest_path.html @@ -694,7 +694,7 @@ can be used to specify a specific ordering:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.dag_longest_path_length.html b/reference/algorithms/generated/networkx.algorithms.dag.dag_longest_path_length.html index fa7b65da..339b2dfd 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.dag_longest_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.dag_longest_path_length.html @@ -679,7 +679,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.dag_to_branching.html b/reference/algorithms/generated/networkx.algorithms.dag.dag_to_branching.html index 5b4afbe2..e27af0c6 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.dag_to_branching.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.dag_to_branching.html @@ -717,7 +717,7 @@ example:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.descendants.html b/reference/algorithms/generated/networkx.algorithms.dag.descendants.html index 302f8d42..caba6468 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.descendants.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.descendants.html @@ -676,7 +676,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.is_aperiodic.html b/reference/algorithms/generated/networkx.algorithms.dag.is_aperiodic.html index b61be4c9..7eb0aee9 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.is_aperiodic.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.is_aperiodic.html @@ -707,7 +707,7 @@ the graph is <em>not aperiodic</em>:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.is_directed_acyclic_graph.html b/reference/algorithms/generated/networkx.algorithms.dag.is_directed_acyclic_graph.html index ec2ea423..4e0e7ea7 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.is_directed_acyclic_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.is_directed_acyclic_graph.html @@ -678,7 +678,7 @@ False if not.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.lexicographical_topological_sort.html b/reference/algorithms/generated/networkx.algorithms.dag.lexicographical_topological_sort.html index 9ac9aed3..dbf9fb9e 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.lexicographical_topological_sort.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.lexicographical_topological_sort.html @@ -730,7 +730,7 @@ This groups the strings and integers separately so they can be compared only amo <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.topological_generations.html b/reference/algorithms/generated/networkx.algorithms.dag.topological_generations.html index 60854551..4f931951 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.topological_generations.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.topological_generations.html @@ -686,7 +686,7 @@ be obtained with this function using <code class="xref py py-obj docutils litera <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.topological_sort.html b/reference/algorithms/generated/networkx.algorithms.dag.topological_sort.html index d53cdd4e..2f24b9b7 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.topological_sort.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.topological_sort.html @@ -704,7 +704,7 @@ with <code class="xref py py-func docutils literal notranslate"><span class="pre <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.transitive_closure.html b/reference/algorithms/generated/networkx.algorithms.dag.transitive_closure.html index 8ab49743..5b436f34 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.transitive_closure.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.transitive_closure.html @@ -713,7 +713,7 @@ when <code class="docutils literal notranslate"><span class="pre">reflexive=Fals <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.transitive_closure_dag.html b/reference/algorithms/generated/networkx.algorithms.dag.transitive_closure_dag.html index 12712660..9851a865 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.transitive_closure_dag.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.transitive_closure_dag.html @@ -678,7 +678,7 @@ a mention in the literature.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dag.transitive_reduction.html b/reference/algorithms/generated/networkx.algorithms.dag.transitive_reduction.html index d2886874..83362f74 100644 --- a/reference/algorithms/generated/networkx.algorithms.dag.transitive_reduction.html +++ b/reference/algorithms/generated/networkx.algorithms.dag.transitive_reduction.html @@ -685,7 +685,7 @@ To perform transitive reduction on a DiGraph and transfer node/edge data:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.distance_measures.barycenter.html b/reference/algorithms/generated/networkx.algorithms.distance_measures.barycenter.html index c92223f9..1b18ae70 100644 --- a/reference/algorithms/generated/networkx.algorithms.distance_measures.barycenter.html +++ b/reference/algorithms/generated/networkx.algorithms.distance_measures.barycenter.html @@ -693,7 +693,7 @@ lengths for any pairs.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.distance_measures.center.html b/reference/algorithms/generated/networkx.algorithms.distance_measures.center.html index d1f74622..ba56371b 100644 --- a/reference/algorithms/generated/networkx.algorithms.distance_measures.center.html +++ b/reference/algorithms/generated/networkx.algorithms.distance_measures.center.html @@ -684,7 +684,7 @@ errors in distances. Use integer weights to avoid this.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.distance_measures.diameter.html b/reference/algorithms/generated/networkx.algorithms.distance_measures.diameter.html index e140d077..c3633ef0 100644 --- a/reference/algorithms/generated/networkx.algorithms.distance_measures.diameter.html +++ b/reference/algorithms/generated/networkx.algorithms.distance_measures.diameter.html @@ -683,7 +683,7 @@ errors in distances. Use integer weights to avoid this.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.distance_measures.eccentricity.html b/reference/algorithms/generated/networkx.algorithms.distance_measures.eccentricity.html index 76fbecd9..5d691660 100644 --- a/reference/algorithms/generated/networkx.algorithms.distance_measures.eccentricity.html +++ b/reference/algorithms/generated/networkx.algorithms.distance_measures.eccentricity.html @@ -684,7 +684,7 @@ errors in distances. Use integer weights to avoid this.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.distance_measures.periphery.html b/reference/algorithms/generated/networkx.algorithms.distance_measures.periphery.html index be1f93bc..53b225c2 100644 --- a/reference/algorithms/generated/networkx.algorithms.distance_measures.periphery.html +++ b/reference/algorithms/generated/networkx.algorithms.distance_measures.periphery.html @@ -684,7 +684,7 @@ errors in distances. Use integer weights to avoid this.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.distance_measures.radius.html b/reference/algorithms/generated/networkx.algorithms.distance_measures.radius.html index 9a71661c..ede1ca6f 100644 --- a/reference/algorithms/generated/networkx.algorithms.distance_measures.radius.html +++ b/reference/algorithms/generated/networkx.algorithms.distance_measures.radius.html @@ -677,7 +677,7 @@ errors in distances. Use integer weights to avoid this.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.distance_measures.resistance_distance.html b/reference/algorithms/generated/networkx.algorithms.distance_measures.resistance_distance.html index c799da62..e4e11ffb 100644 --- a/reference/algorithms/generated/networkx.algorithms.distance_measures.resistance_distance.html +++ b/reference/algorithms/generated/networkx.algorithms.distance_measures.resistance_distance.html @@ -701,7 +701,7 @@ Mestrado, Mathematisch Instituut Universiteit Leiden, 2016 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.distance_regular.global_parameters.html b/reference/algorithms/generated/networkx.algorithms.distance_regular.global_parameters.html index 77cd704e..7be19c77 100644 --- a/reference/algorithms/generated/networkx.algorithms.distance_regular.global_parameters.html +++ b/reference/algorithms/generated/networkx.algorithms.distance_regular.global_parameters.html @@ -683,7 +683,7 @@ From MathWorld–A Wolfram Web Resource. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.distance_regular.intersection_array.html b/reference/algorithms/generated/networkx.algorithms.distance_regular.intersection_array.html index fe7adf73..6ddd5948 100644 --- a/reference/algorithms/generated/networkx.algorithms.distance_regular.intersection_array.html +++ b/reference/algorithms/generated/networkx.algorithms.distance_regular.intersection_array.html @@ -678,7 +678,7 @@ From MathWorld–A Wolfram Web Resource. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.distance_regular.is_distance_regular.html b/reference/algorithms/generated/networkx.algorithms.distance_regular.is_distance_regular.html index fe7735f1..5fea1c52 100644 --- a/reference/algorithms/generated/networkx.algorithms.distance_regular.is_distance_regular.html +++ b/reference/algorithms/generated/networkx.algorithms.distance_regular.is_distance_regular.html @@ -684,7 +684,7 @@ Distance-Regular Graphs. New York: Springer-Verlag, 1989.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.distance_regular.is_strongly_regular.html b/reference/algorithms/generated/networkx.algorithms.distance_regular.is_strongly_regular.html index f5a50542..232795ae 100644 --- a/reference/algorithms/generated/networkx.algorithms.distance_regular.is_strongly_regular.html +++ b/reference/algorithms/generated/networkx.algorithms.distance_regular.is_strongly_regular.html @@ -675,7 +675,7 @@ and each pair of nonadjacent vertices has one shared neighbor:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dominance.dominance_frontiers.html b/reference/algorithms/generated/networkx.algorithms.dominance.dominance_frontiers.html index be74fe9f..3dc1f9e0 100644 --- a/reference/algorithms/generated/networkx.algorithms.dominance.dominance_frontiers.html +++ b/reference/algorithms/generated/networkx.algorithms.dominance.dominance_frontiers.html @@ -679,7 +679,7 @@ Software Practice & Experience, 4:110, 2001.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dominance.immediate_dominators.html b/reference/algorithms/generated/networkx.algorithms.dominance.immediate_dominators.html index aeb75069..c42aa4c8 100644 --- a/reference/algorithms/generated/networkx.algorithms.dominance.immediate_dominators.html +++ b/reference/algorithms/generated/networkx.algorithms.dominance.immediate_dominators.html @@ -682,7 +682,7 @@ Software Practice & Experience, 4:110, 2001.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dominating.dominating_set.html b/reference/algorithms/generated/networkx.algorithms.dominating.dominating_set.html index 9f685b55..6692d879 100644 --- a/reference/algorithms/generated/networkx.algorithms.dominating.dominating_set.html +++ b/reference/algorithms/generated/networkx.algorithms.dominating.dominating_set.html @@ -678,7 +678,7 @@ finds some dominating set, not necessarily the smallest one.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.dominating.is_dominating_set.html b/reference/algorithms/generated/networkx.algorithms.dominating.is_dominating_set.html index 0b6a24e5..b62a472e 100644 --- a/reference/algorithms/generated/networkx.algorithms.dominating.is_dominating_set.html +++ b/reference/algorithms/generated/networkx.algorithms.dominating.is_dominating_set.html @@ -664,7 +664,7 @@ member of <em>D</em> <a class="reference internal" href="#rf92913515997-1" id="i <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.efficiency_measures.efficiency.html b/reference/algorithms/generated/networkx.algorithms.efficiency_measures.efficiency.html index 94103f0f..84b74de4 100644 --- a/reference/algorithms/generated/networkx.algorithms.efficiency_measures.efficiency.html +++ b/reference/algorithms/generated/networkx.algorithms.efficiency_measures.efficiency.html @@ -683,7 +683,7 @@ between nodes.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.efficiency_measures.global_efficiency.html b/reference/algorithms/generated/networkx.algorithms.efficiency_measures.global_efficiency.html index 3cf28dec..9f99e6c7 100644 --- a/reference/algorithms/generated/networkx.algorithms.efficiency_measures.global_efficiency.html +++ b/reference/algorithms/generated/networkx.algorithms.efficiency_measures.global_efficiency.html @@ -681,7 +681,7 @@ nodes <a class="reference internal" href="#r9f26066558a1-1" id="id1">[1]</a>.</p <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.efficiency_measures.local_efficiency.html b/reference/algorithms/generated/networkx.algorithms.efficiency_measures.local_efficiency.html index 09483405..2cea11eb 100644 --- a/reference/algorithms/generated/networkx.algorithms.efficiency_measures.local_efficiency.html +++ b/reference/algorithms/generated/networkx.algorithms.efficiency_measures.local_efficiency.html @@ -682,7 +682,7 @@ efficiency</em> is the average of the local efficiencies of each node <a class=" <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.euler.eulerian_circuit.html b/reference/algorithms/generated/networkx.algorithms.euler.eulerian_circuit.html index ec1af461..71aacb7e 100644 --- a/reference/algorithms/generated/networkx.algorithms.euler.eulerian_circuit.html +++ b/reference/algorithms/generated/networkx.algorithms.euler.eulerian_circuit.html @@ -703,7 +703,7 @@ Mathematical programming, Volume 5, Issue 1 (1973), 111-114.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.euler.eulerian_path.html b/reference/algorithms/generated/networkx.algorithms.euler.eulerian_path.html index 75d0ee07..4983d5f6 100644 --- a/reference/algorithms/generated/networkx.algorithms.euler.eulerian_path.html +++ b/reference/algorithms/generated/networkx.algorithms.euler.eulerian_path.html @@ -660,7 +660,7 @@ The default yields edge 2-tuples</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.euler.eulerize.html b/reference/algorithms/generated/networkx.algorithms.euler.eulerize.html index c31f2334..d5c5791a 100644 --- a/reference/algorithms/generated/networkx.algorithms.euler.eulerize.html +++ b/reference/algorithms/generated/networkx.algorithms.euler.eulerize.html @@ -691,7 +691,7 @@ Mathematical programming, Volume 5, Issue 1 (1973), 111-114.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.euler.has_eulerian_path.html b/reference/algorithms/generated/networkx.algorithms.euler.has_eulerian_path.html index 0bd354b9..6a33e23d 100644 --- a/reference/algorithms/generated/networkx.algorithms.euler.has_eulerian_path.html +++ b/reference/algorithms/generated/networkx.algorithms.euler.has_eulerian_path.html @@ -705,7 +705,7 @@ you can first remove such vertices and then call <a class="reference internal" h <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.euler.is_eulerian.html b/reference/algorithms/generated/networkx.algorithms.euler.is_eulerian.html index 295ca016..b0f2e6c8 100644 --- a/reference/algorithms/generated/networkx.algorithms.euler.is_eulerian.html +++ b/reference/algorithms/generated/networkx.algorithms.euler.is_eulerian.html @@ -676,7 +676,7 @@ you can first remove such vertices and then call <a class="reference internal" h <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.euler.is_semieulerian.html b/reference/algorithms/generated/networkx.algorithms.euler.is_semieulerian.html index 8188935d..22b93d9c 100644 --- a/reference/algorithms/generated/networkx.algorithms.euler.is_semieulerian.html +++ b/reference/algorithms/generated/networkx.algorithms.euler.is_semieulerian.html @@ -647,7 +647,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.boykov_kolmogorov.html b/reference/algorithms/generated/networkx.algorithms.flow.boykov_kolmogorov.html index 13be5ac6..48320ce2 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.boykov_kolmogorov.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.boykov_kolmogorov.html @@ -776,7 +776,7 @@ in the graph attribute <code class="xref py py-obj docutils literal notranslate" <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.build_residual_network.html b/reference/algorithms/generated/networkx.algorithms.flow.build_residual_network.html index 05d1f08e..27da8aa1 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.build_residual_network.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.build_residual_network.html @@ -657,7 +657,7 @@ that <code class="samp docutils literal notranslate"><span class="pre">R[u][v][' <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.capacity_scaling.html b/reference/algorithms/generated/networkx.algorithms.flow.capacity_scaling.html index fc53dc0d..8175f645 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.capacity_scaling.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.capacity_scaling.html @@ -761,7 +761,7 @@ algorithm.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.cost_of_flow.html b/reference/algorithms/generated/networkx.algorithms.flow.cost_of_flow.html index 4f5315a2..8317f8ee 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.cost_of_flow.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.cost_of_flow.html @@ -678,7 +678,7 @@ constant factor (eg 100).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.dinitz.html b/reference/algorithms/generated/networkx.algorithms.flow.dinitz.html index 48429362..81dd1aab 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.dinitz.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.dinitz.html @@ -754,7 +754,7 @@ namespace, so you have to explicitly import them from the flow package.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.edmonds_karp.html b/reference/algorithms/generated/networkx.algorithms.flow.edmonds_karp.html index d505bb86..e5b71915 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.edmonds_karp.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.edmonds_karp.html @@ -744,7 +744,7 @@ namespace, so you have to explicitly import them from the flow package.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.gomory_hu_tree.html b/reference/algorithms/generated/networkx.algorithms.flow.gomory_hu_tree.html index fb7716bd..302bfab3 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.gomory_hu_tree.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.gomory_hu_tree.html @@ -752,7 +752,7 @@ SIAM J Comput 19(1):143-155, 1990.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.max_flow_min_cost.html b/reference/algorithms/generated/networkx.algorithms.flow.max_flow_min_cost.html index f146ad4a..b6033ecf 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.max_flow_min_cost.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.max_flow_min_cost.html @@ -730,7 +730,7 @@ constant factor (eg 100).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.maximum_flow.html b/reference/algorithms/generated/networkx.algorithms.flow.maximum_flow.html index 2d9dc2af..6ad2f1a7 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.maximum_flow.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.maximum_flow.html @@ -757,7 +757,7 @@ maximum flow by using the flow_func parameter.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.maximum_flow_value.html b/reference/algorithms/generated/networkx.algorithms.flow.maximum_flow_value.html index b64cdfbd..8357e187 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.maximum_flow_value.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.maximum_flow_value.html @@ -752,7 +752,7 @@ maximum flow by using the flow_func parameter.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.min_cost_flow.html b/reference/algorithms/generated/networkx.algorithms.flow.min_cost_flow.html index 96b3774e..01f4e9ff 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.min_cost_flow.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.min_cost_flow.html @@ -722,7 +722,7 @@ constant factor (eg 100).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.min_cost_flow_cost.html b/reference/algorithms/generated/networkx.algorithms.flow.min_cost_flow_cost.html index a064cf78..cff4e31e 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.min_cost_flow_cost.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.min_cost_flow_cost.html @@ -723,7 +723,7 @@ constant factor (eg 100).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.minimum_cut.html b/reference/algorithms/generated/networkx.algorithms.flow.minimum_cut.html index 849170b0..0a6e6265 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.minimum_cut.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.minimum_cut.html @@ -760,7 +760,7 @@ minimum cut by using the flow_func parameter.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.minimum_cut_value.html b/reference/algorithms/generated/networkx.algorithms.flow.minimum_cut_value.html index 9883faa7..15e18cc6 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.minimum_cut_value.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.minimum_cut_value.html @@ -749,7 +749,7 @@ minimum cut by using the flow_func parameter.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.network_simplex.html b/reference/algorithms/generated/networkx.algorithms.flow.network_simplex.html index 57fea9b8..ed3d1eeb 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.network_simplex.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.network_simplex.html @@ -803,7 +803,7 @@ algorithm.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.preflow_push.html b/reference/algorithms/generated/networkx.algorithms.flow.preflow_push.html index 1c6a9332..2a367ea8 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.preflow_push.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.preflow_push.html @@ -757,7 +757,7 @@ namespace, so you have to explicitly import them from the flow package.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.flow.shortest_augmenting_path.html b/reference/algorithms/generated/networkx.algorithms.flow.shortest_augmenting_path.html index 0ee9fad3..fcb033a0 100644 --- a/reference/algorithms/generated/networkx.algorithms.flow.shortest_augmenting_path.html +++ b/reference/algorithms/generated/networkx.algorithms.flow.shortest_augmenting_path.html @@ -749,7 +749,7 @@ namespace, so you have to explicitly import them from the flow package.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash.html b/reference/algorithms/generated/networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash.html index 09b1d5ec..7b62e7cc 100644 --- a/reference/algorithms/generated/networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash.html +++ b/reference/algorithms/generated/networkx.algorithms.graph_hashing.weisfeiler_lehman_graph_hash.html @@ -731,7 +731,7 @@ the same hash digest.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.graph_hashing.weisfeiler_lehman_subgraph_hashes.html b/reference/algorithms/generated/networkx.algorithms.graph_hashing.weisfeiler_lehman_subgraph_hashes.html index 1233b167..c2aeeddb 100644 --- a/reference/algorithms/generated/networkx.algorithms.graph_hashing.weisfeiler_lehman_subgraph_hashes.html +++ b/reference/algorithms/generated/networkx.algorithms.graph_hashing.weisfeiler_lehman_subgraph_hashes.html @@ -752,7 +752,7 @@ is similar.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.graphical.is_digraphical.html b/reference/algorithms/generated/networkx.algorithms.graphical.is_digraphical.html index 4c5f970f..d731a5ff 100644 --- a/reference/algorithms/generated/networkx.algorithms.graphical.is_digraphical.html +++ b/reference/algorithms/generated/networkx.algorithms.graphical.is_digraphical.html @@ -670,7 +670,7 @@ and Factors, Discrete Mathematics, 6(1), pp. 79-88 (1973)</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.graphical.is_graphical.html b/reference/algorithms/generated/networkx.algorithms.graphical.is_graphical.html index 2a5cde4e..ebfbfd68 100644 --- a/reference/algorithms/generated/networkx.algorithms.graphical.is_graphical.html +++ b/reference/algorithms/generated/networkx.algorithms.graphical.is_graphical.html @@ -695,7 +695,7 @@ Chapman and Hall/CRC, 1996.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.graphical.is_multigraphical.html b/reference/algorithms/generated/networkx.algorithms.graphical.is_multigraphical.html index d83da080..779345ab 100644 --- a/reference/algorithms/generated/networkx.algorithms.graphical.is_multigraphical.html +++ b/reference/algorithms/generated/networkx.algorithms.graphical.is_multigraphical.html @@ -665,7 +665,7 @@ degrees of the vertices of a linear graph”, J. SIAM, 10, pp. 496-506 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.graphical.is_pseudographical.html b/reference/algorithms/generated/networkx.algorithms.graphical.is_pseudographical.html index 21f216f5..0b567f1d 100644 --- a/reference/algorithms/generated/networkx.algorithms.graphical.is_pseudographical.html +++ b/reference/algorithms/generated/networkx.algorithms.graphical.is_pseudographical.html @@ -667,7 +667,7 @@ pp. 778-782 (1976).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.graphical.is_valid_degree_sequence_erdos_gallai.html b/reference/algorithms/generated/networkx.algorithms.graphical.is_valid_degree_sequence_erdos_gallai.html index 09a75667..d142d755 100644 --- a/reference/algorithms/generated/networkx.algorithms.graphical.is_valid_degree_sequence_erdos_gallai.html +++ b/reference/algorithms/generated/networkx.algorithms.graphical.is_valid_degree_sequence_erdos_gallai.html @@ -691,7 +691,7 @@ of graphic sequences”, Discrete Mathematics, 105, pp. 292-303 (1992).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.graphical.is_valid_degree_sequence_havel_hakimi.html b/reference/algorithms/generated/networkx.algorithms.graphical.is_valid_degree_sequence_havel_hakimi.html index 2fc323ef..a191233d 100644 --- a/reference/algorithms/generated/networkx.algorithms.graphical.is_valid_degree_sequence_havel_hakimi.html +++ b/reference/algorithms/generated/networkx.algorithms.graphical.is_valid_degree_sequence_havel_hakimi.html @@ -686,7 +686,7 @@ Chapman and Hall/CRC, 1996.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.hierarchy.flow_hierarchy.html b/reference/algorithms/generated/networkx.algorithms.hierarchy.flow_hierarchy.html index 88e953f2..2c4b0a62 100644 --- a/reference/algorithms/generated/networkx.algorithms.hierarchy.flow_hierarchy.html +++ b/reference/algorithms/generated/networkx.algorithms.hierarchy.flow_hierarchy.html @@ -676,7 +676,7 @@ DOI: 10.1002/cplx.20368 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.hybrid.is_kl_connected.html b/reference/algorithms/generated/networkx.algorithms.hybrid.is_kl_connected.html index ba4babca..df9f5629 100644 --- a/reference/algorithms/generated/networkx.algorithms.hybrid.is_kl_connected.html +++ b/reference/algorithms/generated/networkx.algorithms.hybrid.is_kl_connected.html @@ -680,7 +680,7 @@ Power Law Graphs.” <em>Complex Networks</em>. Springer Berlin Heidelberg, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.hybrid.kl_connected_subgraph.html b/reference/algorithms/generated/networkx.algorithms.hybrid.kl_connected_subgraph.html index b78f23f7..0692e4b0 100644 --- a/reference/algorithms/generated/networkx.algorithms.hybrid.kl_connected_subgraph.html +++ b/reference/algorithms/generated/networkx.algorithms.hybrid.kl_connected_subgraph.html @@ -689,7 +689,7 @@ Power Law Graphs.” <em>Complex Networks</em>. Springer Berlin Heidelberg, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isolate.is_isolate.html b/reference/algorithms/generated/networkx.algorithms.isolate.is_isolate.html index 394a6627..3d91bc96 100644 --- a/reference/algorithms/generated/networkx.algorithms.isolate.is_isolate.html +++ b/reference/algorithms/generated/networkx.algorithms.isolate.is_isolate.html @@ -667,7 +667,7 @@ out-neighbors.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isolate.isolates.html b/reference/algorithms/generated/networkx.algorithms.isolate.isolates.html index 6fa09a46..abeb88a1 100644 --- a/reference/algorithms/generated/networkx.algorithms.isolate.isolates.html +++ b/reference/algorithms/generated/networkx.algorithms.isolate.isolates.html @@ -679,7 +679,7 @@ isolates, then use <code class="xref py py-meth docutils literal notranslate"><s <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isolate.number_of_isolates.html b/reference/algorithms/generated/networkx.algorithms.isolate.number_of_isolates.html index 3b039792..3d4c97af 100644 --- a/reference/algorithms/generated/networkx.algorithms.isolate.number_of_isolates.html +++ b/reference/algorithms/generated/networkx.algorithms.isolate.number_of_isolates.html @@ -655,7 +655,7 @@ out-neighbors.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.__init__.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.__init__.html index 4b4cbc69..8861e588 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.__init__.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.__init__.html @@ -668,7 +668,7 @@ considered when testing for an isomorphism.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.candidate_pairs_iter.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.candidate_pairs_iter.html index 104c7595..0c88d856 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.candidate_pairs_iter.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.candidate_pairs_iter.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.initialize.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.initialize.html index 272c743c..ef2c8b55 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.initialize.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.initialize.html @@ -641,7 +641,7 @@ If only subclassing GraphMatcher, a redefinition is not necessary.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.is_isomorphic.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.is_isomorphic.html index 0b6b983d..3989154e 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.is_isomorphic.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.is_isomorphic.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.isomorphisms_iter.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.isomorphisms_iter.html index 6f703d79..a0cce5de 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.isomorphisms_iter.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.isomorphisms_iter.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.match.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.match.html index f375ec42..ca399b45 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.match.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.match.html @@ -643,7 +643,7 @@ we yield the mapping.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.semantic_feasibility.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.semantic_feasibility.html index 7bd7fb7d..82d31c7c 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.semantic_feasibility.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.semantic_feasibility.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.subgraph_is_isomorphic.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.subgraph_is_isomorphic.html index ce8a2c33..b55361b6 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.subgraph_is_isomorphic.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.subgraph_is_isomorphic.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.subgraph_isomorphisms_iter.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.subgraph_isomorphisms_iter.html index 109dad3d..a84aca43 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.subgraph_isomorphisms_iter.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.subgraph_isomorphisms_iter.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.syntactic_feasibility.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.syntactic_feasibility.html index b6f9e7a0..946f6ac2 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.syntactic_feasibility.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.DiGraphMatcher.syntactic_feasibility.html @@ -643,7 +643,7 @@ not make it impossible for an isomorphism/monomorphism to be found.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.__init__.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.__init__.html index b55f859b..746a9d0a 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.__init__.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.__init__.html @@ -668,7 +668,7 @@ considered when testing for an isomorphism.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.candidate_pairs_iter.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.candidate_pairs_iter.html index 06da30fd..9c2d2d72 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.candidate_pairs_iter.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.candidate_pairs_iter.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.initialize.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.initialize.html index 6dc8f05a..3100537e 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.initialize.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.initialize.html @@ -641,7 +641,7 @@ If only subclassing GraphMatcher, a redefinition is not necessary.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.is_isomorphic.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.is_isomorphic.html index 886a123d..f3334f30 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.is_isomorphic.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.is_isomorphic.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.isomorphisms_iter.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.isomorphisms_iter.html index 70abdfca..76d772d8 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.isomorphisms_iter.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.isomorphisms_iter.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.match.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.match.html index 905cd7c0..a30fb6ae 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.match.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.match.html @@ -643,7 +643,7 @@ we yield the mapping.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.semantic_feasibility.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.semantic_feasibility.html index 7f8dc87a..a7bdeca8 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.semantic_feasibility.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.semantic_feasibility.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.subgraph_is_isomorphic.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.subgraph_is_isomorphic.html index ce88f879..4d2cb95d 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.subgraph_is_isomorphic.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.subgraph_is_isomorphic.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.subgraph_isomorphisms_iter.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.subgraph_isomorphisms_iter.html index 2afe735c..8a6a8fdc 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.subgraph_isomorphisms_iter.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.subgraph_isomorphisms_iter.html @@ -639,7 +639,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.syntactic_feasibility.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.syntactic_feasibility.html index fb8a6182..2272fa6d 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.syntactic_feasibility.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.GraphMatcher.syntactic_feasibility.html @@ -643,7 +643,7 @@ not make it impossible for an isomorphism/monomorphism to be found.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.ISMAGS.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.ISMAGS.html index 3108828b..b9a14171 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.ISMAGS.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.ISMAGS.html @@ -750,7 +750,7 @@ If <a class="reference external" href="https://docs.python.org/3/library/constan <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_edge_match.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_edge_match.html index 2948bfab..6e4cb0f1 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_edge_match.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_edge_match.html @@ -666,7 +666,7 @@ default values for the categorical edge attributes.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_multiedge_match.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_multiedge_match.html index d7f7d2ec..fecc09aa 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_multiedge_match.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_multiedge_match.html @@ -666,7 +666,7 @@ default values for the categorical edge attributes.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_node_match.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_node_match.html index f8ba3484..15879979 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_node_match.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.categorical_node_match.html @@ -666,7 +666,7 @@ default values for the categorical node attributes.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.could_be_isomorphic.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.could_be_isomorphic.html index 70e80bb9..6e4a0fee 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.could_be_isomorphic.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.could_be_isomorphic.html @@ -653,7 +653,7 @@ involving that node.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.fast_could_be_isomorphic.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.fast_could_be_isomorphic.html index 20bdb4e4..71883e4d 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.fast_could_be_isomorphic.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.fast_could_be_isomorphic.html @@ -651,7 +651,7 @@ sequence contains the number of triangles each node is part of.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.faster_could_be_isomorphic.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.faster_could_be_isomorphic.html index 90a61305..c5c9bb0f 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.faster_could_be_isomorphic.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.faster_could_be_isomorphic.html @@ -650,7 +650,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_edge_match.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_edge_match.html index 31e0bd0a..4fb4c3db 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_edge_match.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_edge_match.html @@ -672,7 +672,7 @@ of operators to use when comparing values for each attribute.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_multiedge_match.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_multiedge_match.html index 6181a8ef..6573af92 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_multiedge_match.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_multiedge_match.html @@ -675,7 +675,7 @@ of operators to use when comparing values for each attribute.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_node_match.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_node_match.html index 929efd6d..8bca8f97 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_node_match.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.generic_node_match.html @@ -672,7 +672,7 @@ of operators to use when comparing values for each attribute.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.is_isomorphic.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.is_isomorphic.html index 7c3d55c3..6f3923e8 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.is_isomorphic.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.is_isomorphic.html @@ -735,7 +735,7 @@ default value ‘red’.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_edge_match.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_edge_match.html index 441593a7..7bc200ca 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_edge_match.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_edge_match.html @@ -670,7 +670,7 @@ default values for the numerical edge attributes.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_multiedge_match.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_multiedge_match.html index 8171d262..a36b21dc 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_multiedge_match.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_multiedge_match.html @@ -670,7 +670,7 @@ default values for the numerical edge attributes.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_node_match.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_node_match.html index d0badc3b..cc26610b 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_node_match.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.numerical_node_match.html @@ -670,7 +670,7 @@ default values for the numerical node attributes.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.tree_isomorphism.rooted_tree_isomorphism.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.tree_isomorphism.rooted_tree_isomorphism.html index d1a261ff..fd81aa18 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.tree_isomorphism.rooted_tree_isomorphism.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.tree_isomorphism.rooted_tree_isomorphism.html @@ -672,7 +672,7 @@ will not necessarily be unique.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.tree_isomorphism.tree_isomorphism.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.tree_isomorphism.tree_isomorphism.html index a1c71863..04390860 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.tree_isomorphism.tree_isomorphism.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.tree_isomorphism.tree_isomorphism.html @@ -667,7 +667,7 @@ will not necessarily be unique.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_all_isomorphisms.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_all_isomorphisms.html index b87703e6..a7486837 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_all_isomorphisms.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_all_isomorphisms.html @@ -661,7 +661,7 @@ named <code class="xref py py-obj docutils literal notranslate"><span class="pre <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_is_isomorphic.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_is_isomorphic.html index f0953d5a..d02bb3e2 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_is_isomorphic.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_is_isomorphic.html @@ -661,7 +661,7 @@ named <code class="xref py py-obj docutils literal notranslate"><span class="pre <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_isomorphism.html b/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_isomorphism.html index 05e5c782..90efb052 100644 --- a/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_isomorphism.html +++ b/reference/algorithms/generated/networkx.algorithms.isomorphism.vf2pp.vf2pp_isomorphism.html @@ -661,7 +661,7 @@ named <code class="xref py py-obj docutils literal notranslate"><span class="pre <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.link_analysis.hits_alg.hits.html b/reference/algorithms/generated/networkx.algorithms.link_analysis.hits_alg.hits.html index f64be45f..c5bd6987 100644 --- a/reference/algorithms/generated/networkx.algorithms.link_analysis.hits_alg.hits.html +++ b/reference/algorithms/generated/networkx.algorithms.link_analysis.hits_alg.hits.html @@ -703,7 +703,7 @@ http://www.cs.cornell.edu/home/kleinber/auth.pdf.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.link_analysis.pagerank_alg.google_matrix.html b/reference/algorithms/generated/networkx.algorithms.link_analysis.pagerank_alg.google_matrix.html index 9a6f852f..0224cdc9 100644 --- a/reference/algorithms/generated/networkx.algorithms.link_analysis.pagerank_alg.google_matrix.html +++ b/reference/algorithms/generated/networkx.algorithms.link_analysis.pagerank_alg.google_matrix.html @@ -691,7 +691,7 @@ between those nodes.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.link_analysis.pagerank_alg.pagerank.html b/reference/algorithms/generated/networkx.algorithms.link_analysis.pagerank_alg.pagerank.html index 735f26f7..695b34cb 100644 --- a/reference/algorithms/generated/networkx.algorithms.link_analysis.pagerank_alg.pagerank.html +++ b/reference/algorithms/generated/networkx.algorithms.link_analysis.pagerank_alg.pagerank.html @@ -726,7 +726,7 @@ The PageRank citation ranking: Bringing order to the Web. 1999 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.link_prediction.adamic_adar_index.html b/reference/algorithms/generated/networkx.algorithms.link_prediction.adamic_adar_index.html index db1f11c5..383ffedb 100644 --- a/reference/algorithms/generated/networkx.algorithms.link_prediction.adamic_adar_index.html +++ b/reference/algorithms/generated/networkx.algorithms.link_prediction.adamic_adar_index.html @@ -685,7 +685,7 @@ The Link Prediction Problem for Social Networks (2004). <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.html b/reference/algorithms/generated/networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.html index 31ace9e6..4f011491 100644 --- a/reference/algorithms/generated/networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.html +++ b/reference/algorithms/generated/networkx.algorithms.link_prediction.cn_soundarajan_hopcroft.html @@ -699,7 +699,7 @@ World Wide Web (WWW ‘12 Companion). ACM, New York, NY, USA, 607-608. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.link_prediction.common_neighbor_centrality.html b/reference/algorithms/generated/networkx.algorithms.link_prediction.common_neighbor_centrality.html index 9f767633..fa5c2155 100644 --- a/reference/algorithms/generated/networkx.algorithms.link_prediction.common_neighbor_centrality.html +++ b/reference/algorithms/generated/networkx.algorithms.link_prediction.common_neighbor_centrality.html @@ -704,7 +704,7 @@ Sci Rep 10, 364 (2020). <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.link_prediction.jaccard_coefficient.html b/reference/algorithms/generated/networkx.algorithms.link_prediction.jaccard_coefficient.html index 86a8470e..7f21fc50 100644 --- a/reference/algorithms/generated/networkx.algorithms.link_prediction.jaccard_coefficient.html +++ b/reference/algorithms/generated/networkx.algorithms.link_prediction.jaccard_coefficient.html @@ -683,7 +683,7 @@ The Link Prediction Problem for Social Networks (2004). <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.link_prediction.preferential_attachment.html b/reference/algorithms/generated/networkx.algorithms.link_prediction.preferential_attachment.html index 3463b230..fbc2314e 100644 --- a/reference/algorithms/generated/networkx.algorithms.link_prediction.preferential_attachment.html +++ b/reference/algorithms/generated/networkx.algorithms.link_prediction.preferential_attachment.html @@ -683,7 +683,7 @@ The Link Prediction Problem for Social Networks (2004). <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.html b/reference/algorithms/generated/networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.html index 0a5429ec..2d395c79 100644 --- a/reference/algorithms/generated/networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.html +++ b/reference/algorithms/generated/networkx.algorithms.link_prediction.ra_index_soundarajan_hopcroft.html @@ -699,7 +699,7 @@ World Wide Web (WWW ‘12 Companion). ACM, New York, NY, USA, 607-608. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.link_prediction.resource_allocation_index.html b/reference/algorithms/generated/networkx.algorithms.link_prediction.resource_allocation_index.html index 4ca3497c..ad940034 100644 --- a/reference/algorithms/generated/networkx.algorithms.link_prediction.resource_allocation_index.html +++ b/reference/algorithms/generated/networkx.algorithms.link_prediction.resource_allocation_index.html @@ -684,7 +684,7 @@ Eur. Phys. J. B 71 (2009) 623. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.link_prediction.within_inter_cluster.html b/reference/algorithms/generated/networkx.algorithms.link_prediction.within_inter_cluster.html index 329bd2fa..e6ea1b69 100644 --- a/reference/algorithms/generated/networkx.algorithms.link_prediction.within_inter_cluster.html +++ b/reference/algorithms/generated/networkx.algorithms.link_prediction.within_inter_cluster.html @@ -705,7 +705,7 @@ Artificial Intelligence (SBIA’12) <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.html b/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.html index 97242d96..6abbfade 100644 --- a/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.html +++ b/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.all_pairs_lowest_common_ancestor.html @@ -687,7 +687,7 @@ specified node pairings:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor.html b/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor.html index 1f0c0284..d4880695 100644 --- a/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor.html +++ b/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.lowest_common_ancestor.html @@ -669,7 +669,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor.html b/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor.html index 79439fd5..9fa29076 100644 --- a/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor.html +++ b/reference/algorithms/generated/networkx.algorithms.lowest_common_ancestors.tree_all_pairs_lowest_common_ancestor.html @@ -698,7 +698,7 @@ want to compute lowest common ancestors. Here is an example:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.matching.is_matching.html b/reference/algorithms/generated/networkx.algorithms.matching.is_matching.html index c2fbb7eb..c592fced 100644 --- a/reference/algorithms/generated/networkx.algorithms.matching.is_matching.html +++ b/reference/algorithms/generated/networkx.algorithms.matching.is_matching.html @@ -679,7 +679,7 @@ Or if the matching is not a collection of 2-tuple edges.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.matching.is_maximal_matching.html b/reference/algorithms/generated/networkx.algorithms.matching.is_maximal_matching.html index ce7e13d0..4585ed48 100644 --- a/reference/algorithms/generated/networkx.algorithms.matching.is_maximal_matching.html +++ b/reference/algorithms/generated/networkx.algorithms.matching.is_maximal_matching.html @@ -667,7 +667,7 @@ matching in the graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.matching.is_perfect_matching.html b/reference/algorithms/generated/networkx.algorithms.matching.is_perfect_matching.html index 0c3b54df..1fb34149 100644 --- a/reference/algorithms/generated/networkx.algorithms.matching.is_perfect_matching.html +++ b/reference/algorithms/generated/networkx.algorithms.matching.is_perfect_matching.html @@ -668,7 +668,7 @@ matching in the graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.matching.max_weight_matching.html b/reference/algorithms/generated/networkx.algorithms.matching.max_weight_matching.html index 6c6529ff..00fa4920 100644 --- a/reference/algorithms/generated/networkx.algorithms.matching.max_weight_matching.html +++ b/reference/algorithms/generated/networkx.algorithms.matching.max_weight_matching.html @@ -692,7 +692,7 @@ Zvi Galil, ACM Computing Surveys, 1986.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.matching.maximal_matching.html b/reference/algorithms/generated/networkx.algorithms.matching.maximal_matching.html index c039c174..3c1c8b10 100644 --- a/reference/algorithms/generated/networkx.algorithms.matching.maximal_matching.html +++ b/reference/algorithms/generated/networkx.algorithms.matching.maximal_matching.html @@ -665,7 +665,7 @@ A maximal matching cannot add more edges and still be a matching.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.matching.min_weight_matching.html b/reference/algorithms/generated/networkx.algorithms.matching.min_weight_matching.html index 44975a94..5da4aa38 100644 --- a/reference/algorithms/generated/networkx.algorithms.matching.min_weight_matching.html +++ b/reference/algorithms/generated/networkx.algorithms.matching.min_weight_matching.html @@ -682,7 +682,7 @@ If key not found, uses 1 as weight.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.minors.contracted_edge.html b/reference/algorithms/generated/networkx.algorithms.minors.contracted_edge.html index 6be352f0..4cdbc5d1 100644 --- a/reference/algorithms/generated/networkx.algorithms.minors.contracted_edge.html +++ b/reference/algorithms/generated/networkx.algorithms.minors.contracted_edge.html @@ -612,7 +612,7 @@ appear in the returned graph.</p> <div class="doctest highlight-default notranslate"><div class="highlight"><pre><span></span><span class="gp">>>> </span><span class="n">G</span> <span class="o">=</span> <span class="n">nx</span><span class="o">.</span><span class="n">cycle_graph</span><span class="p">(</span><span class="mi">4</span><span class="p">)</span> <span class="gp">>>> </span><span class="n">nx</span><span class="o">.</span><span class="n">contracted_edge</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="p">(</span><span class="mi">1</span><span class="p">,</span> <span class="mi">3</span><span class="p">))</span> <span class="gt">Traceback (most recent call last):</span> - <span class="c">...</span> +<span class="w"> </span><span class="c">...</span> <span class="gr">ValueError</span>: <span class="n">Edge (1, 3) does not exist in graph G; cannot contract it</span> </pre></div> </div> @@ -700,7 +700,7 @@ cycle graph on <em>n - 1</em> nodes:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.minors.contracted_nodes.html b/reference/algorithms/generated/networkx.algorithms.minors.contracted_nodes.html index e5d5398a..36d10b3c 100644 --- a/reference/algorithms/generated/networkx.algorithms.minors.contracted_nodes.html +++ b/reference/algorithms/generated/networkx.algorithms.minors.contracted_nodes.html @@ -710,7 +710,7 @@ yields the path graph (ignoring parallel edges):</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.minors.equivalence_classes.html b/reference/algorithms/generated/networkx.algorithms.minors.equivalence_classes.html index 016e0ca3..ed366914 100644 --- a/reference/algorithms/generated/networkx.algorithms.minors.equivalence_classes.html +++ b/reference/algorithms/generated/networkx.algorithms.minors.equivalence_classes.html @@ -688,7 +688,7 @@ remainder <code class="xref py py-obj docutils literal notranslate"><span class= <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.minors.identified_nodes.html b/reference/algorithms/generated/networkx.algorithms.minors.identified_nodes.html index 55a03f55..d5da3441 100644 --- a/reference/algorithms/generated/networkx.algorithms.minors.identified_nodes.html +++ b/reference/algorithms/generated/networkx.algorithms.minors.identified_nodes.html @@ -710,7 +710,7 @@ yields the path graph (ignoring parallel edges):</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.minors.quotient_graph.html b/reference/algorithms/generated/networkx.algorithms.minors.quotient_graph.html index a980018a..edc9f3a2 100644 --- a/reference/algorithms/generated/networkx.algorithms.minors.quotient_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.minors.quotient_graph.html @@ -819,7 +819,7 @@ in the right form, in order to call <a class="reference internal" href="#network <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.mis.maximal_independent_set.html b/reference/algorithms/generated/networkx.algorithms.mis.maximal_independent_set.html index f786298a..9635d537 100644 --- a/reference/algorithms/generated/networkx.algorithms.mis.maximal_independent_set.html +++ b/reference/algorithms/generated/networkx.algorithms.mis.maximal_independent_set.html @@ -682,7 +682,7 @@ do not form an independent set, an exception is raised.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.moral.moral_graph.html b/reference/algorithms/generated/networkx.algorithms.moral.moral_graph.html index 021497d0..c5df2bd6 100644 --- a/reference/algorithms/generated/networkx.algorithms.moral.moral_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.moral.moral_graph.html @@ -682,7 +682,7 @@ in artificial intelligence (UAI’95)</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.node_classification.harmonic_function.html b/reference/algorithms/generated/networkx.algorithms.node_classification.harmonic_function.html index 3460902f..decdfa72 100644 --- a/reference/algorithms/generated/networkx.algorithms.node_classification.harmonic_function.html +++ b/reference/algorithms/generated/networkx.algorithms.node_classification.harmonic_function.html @@ -681,7 +681,7 @@ In ICML (Vol. 3, pp. 912-919).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.node_classification.local_and_global_consistency.html b/reference/algorithms/generated/networkx.algorithms.node_classification.local_and_global_consistency.html index 1310718d..70f8c076 100644 --- a/reference/algorithms/generated/networkx.algorithms.node_classification.local_and_global_consistency.html +++ b/reference/algorithms/generated/networkx.algorithms.node_classification.local_and_global_consistency.html @@ -683,7 +683,7 @@ Advances in neural information processing systems, 16(16), 321-328.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.non_randomness.non_randomness.html b/reference/algorithms/generated/networkx.algorithms.non_randomness.non_randomness.html index 1c0b2dc5..73c22a77 100644 --- a/reference/algorithms/generated/networkx.algorithms.non_randomness.non_randomness.html +++ b/reference/algorithms/generated/networkx.algorithms.non_randomness.non_randomness.html @@ -697,7 +697,7 @@ SIAM International Conference on Data Mining. 2009</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.all.compose_all.html b/reference/algorithms/generated/networkx.algorithms.operators.all.compose_all.html index f77d0b76..cb8ec263 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.all.compose_all.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.all.compose_all.html @@ -666,7 +666,7 @@ from the last graph in the list with that attribute is used.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.all.disjoint_union_all.html b/reference/algorithms/generated/networkx.algorithms.operators.all.disjoint_union_all.html index c29fd48f..92e0572f 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.all.disjoint_union_all.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.all.disjoint_union_all.html @@ -665,7 +665,7 @@ from the last graph in the list with that attribute is used.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.all.intersection_all.html b/reference/algorithms/generated/networkx.algorithms.operators.all.intersection_all.html index 9e04087a..21e921d0 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.all.intersection_all.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.all.intersection_all.html @@ -662,7 +662,7 @@ graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.all.union_all.html b/reference/algorithms/generated/networkx.algorithms.operators.all.union_all.html index 9bec58ba..7cc1177c 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.all.union_all.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.all.union_all.html @@ -677,7 +677,7 @@ from the last graph in the list with that attribute is used.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.binary.compose.html b/reference/algorithms/generated/networkx.algorithms.operators.binary.compose.html index c5645511..728fcd94 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.binary.compose.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.binary.compose.html @@ -711,7 +711,7 @@ If you prefer another way of combining attributes, you can update them after the <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.binary.difference.html b/reference/algorithms/generated/networkx.algorithms.operators.binary.difference.html index 4313d6ad..e34d24dd 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.binary.difference.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.binary.difference.html @@ -674,7 +674,7 @@ as follows:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.binary.disjoint_union.html b/reference/algorithms/generated/networkx.algorithms.operators.binary.disjoint_union.html index 4f7eadab..35eb5007 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.binary.disjoint_union.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.binary.disjoint_union.html @@ -685,7 +685,7 @@ or the method, Graph.update().</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.binary.full_join.html b/reference/algorithms/generated/networkx.algorithms.operators.binary.full_join.html index c8518f5c..68f85458 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.binary.full_join.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.binary.full_join.html @@ -687,7 +687,7 @@ G and H the value from H is used.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.binary.intersection.html b/reference/algorithms/generated/networkx.algorithms.operators.binary.intersection.html index 9173e03c..515adbce 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.binary.intersection.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.binary.intersection.html @@ -681,7 +681,7 @@ as follows</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.binary.symmetric_difference.html b/reference/algorithms/generated/networkx.algorithms.operators.binary.symmetric_difference.html index 766cdb90..0f29be6e 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.binary.symmetric_difference.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.binary.symmetric_difference.html @@ -666,7 +666,7 @@ graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.binary.union.html b/reference/algorithms/generated/networkx.algorithms.operators.binary.union.html index f0331061..2a03e8de 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.binary.union.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.binary.union.html @@ -684,7 +684,7 @@ then the value from H is used.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.product.cartesian_product.html b/reference/algorithms/generated/networkx.algorithms.operators.product.cartesian_product.html index 0729c06b..9d28acd8 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.product.cartesian_product.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.product.cartesian_product.html @@ -682,7 +682,7 @@ new product graph</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.product.corona_product.html b/reference/algorithms/generated/networkx.algorithms.operators.product.corona_product.html index 6b1780e3..1d546d86 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.product.corona_product.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.product.corona_product.html @@ -684,7 +684,7 @@ doi: 10.22108/toc.2014.5542.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.product.lexicographic_product.html b/reference/algorithms/generated/networkx.algorithms.operators.product.lexicographic_product.html index deb7a51c..b37ff5de 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.product.lexicographic_product.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.product.lexicographic_product.html @@ -681,7 +681,7 @@ new product graph</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.product.power.html b/reference/algorithms/generated/networkx.algorithms.operators.product.power.html index cfd9076b..48d80cff 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.product.power.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.product.power.html @@ -705,7 +705,7 @@ powers:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.product.rooted_product.html b/reference/algorithms/generated/networkx.algorithms.operators.product.rooted_product.html index 945643c8..0a00cf15 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.product.rooted_product.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.product.rooted_product.html @@ -662,7 +662,7 @@ The nodes of G and H are not relabeled.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.product.strong_product.html b/reference/algorithms/generated/networkx.algorithms.operators.product.strong_product.html index 6e992d18..75eb87f7 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.product.strong_product.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.product.strong_product.html @@ -683,7 +683,7 @@ new product graph</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.product.tensor_product.html b/reference/algorithms/generated/networkx.algorithms.operators.product.tensor_product.html index 65cb4649..e7faa529 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.product.tensor_product.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.product.tensor_product.html @@ -683,7 +683,7 @@ new product graph</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.unary.complement.html b/reference/algorithms/generated/networkx.algorithms.operators.unary.complement.html index 0687b45b..ffd64f0f 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.unary.complement.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.unary.complement.html @@ -663,7 +663,7 @@ does not produce parallel edges for MultiGraphs.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.operators.unary.reverse.html b/reference/algorithms/generated/networkx.algorithms.operators.unary.reverse.html index d28772f7..a4406090 100644 --- a/reference/algorithms/generated/networkx.algorithms.operators.unary.reverse.html +++ b/reference/algorithms/generated/networkx.algorithms.operators.unary.reverse.html @@ -669,7 +669,7 @@ reversed in place.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.planar_drawing.combinatorial_embedding_to_pos.html b/reference/algorithms/generated/networkx.algorithms.planar_drawing.combinatorial_embedding_to_pos.html index 967f1ba9..d293eeb8 100644 --- a/reference/algorithms/generated/networkx.algorithms.planar_drawing.combinatorial_embedding_to_pos.html +++ b/reference/algorithms/generated/networkx.algorithms.planar_drawing.combinatorial_embedding_to_pos.html @@ -670,7 +670,7 @@ A Linear-time Algorithm for Drawing a Planar Graph on a Grid 1989 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.planarity.PlanarEmbedding.html b/reference/algorithms/generated/networkx.algorithms.planarity.PlanarEmbedding.html index b6e1aead..c0ca073a 100644 --- a/reference/algorithms/generated/networkx.algorithms.planarity.PlanarEmbedding.html +++ b/reference/algorithms/generated/networkx.algorithms.planarity.PlanarEmbedding.html @@ -950,7 +950,7 @@ SciPy sparse array, or a PyGraphviz graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.planarity.check_planarity.html b/reference/algorithms/generated/networkx.algorithms.planarity.check_planarity.html index c867644d..0b55235d 100644 --- a/reference/algorithms/generated/networkx.algorithms.planarity.check_planarity.html +++ b/reference/algorithms/generated/networkx.algorithms.planarity.check_planarity.html @@ -704,7 +704,7 @@ Lecture Notes Series on Computing: Volume 12 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.planarity.is_planar.html b/reference/algorithms/generated/networkx.algorithms.planarity.is_planar.html index d03e2d21..4f1398ef 100644 --- a/reference/algorithms/generated/networkx.algorithms.planarity.is_planar.html +++ b/reference/algorithms/generated/networkx.algorithms.planarity.is_planar.html @@ -669,7 +669,7 @@ any edge intersections.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.polynomials.chromatic_polynomial.html b/reference/algorithms/generated/networkx.algorithms.polynomials.chromatic_polynomial.html index c3411087..06b7f229 100644 --- a/reference/algorithms/generated/networkx.algorithms.polynomials.chromatic_polynomial.html +++ b/reference/algorithms/generated/networkx.algorithms.polynomials.chromatic_polynomial.html @@ -748,7 +748,7 @@ Discrete Mathematics, 2006 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.polynomials.tutte_polynomial.html b/reference/algorithms/generated/networkx.algorithms.polynomials.tutte_polynomial.html index e4f835fb..20f3b704 100644 --- a/reference/algorithms/generated/networkx.algorithms.polynomials.tutte_polynomial.html +++ b/reference/algorithms/generated/networkx.algorithms.polynomials.tutte_polynomial.html @@ -770,7 +770,7 @@ Structural Analysis of Complex Networks, 2011 <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.reciprocity.overall_reciprocity.html b/reference/algorithms/generated/networkx.algorithms.reciprocity.overall_reciprocity.html index f4d75c72..2e24fdba 100644 --- a/reference/algorithms/generated/networkx.algorithms.reciprocity.overall_reciprocity.html +++ b/reference/algorithms/generated/networkx.algorithms.reciprocity.overall_reciprocity.html @@ -648,7 +648,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.reciprocity.reciprocity.html b/reference/algorithms/generated/networkx.algorithms.reciprocity.reciprocity.html index 5f44f5e8..f03e447e 100644 --- a/reference/algorithms/generated/networkx.algorithms.reciprocity.reciprocity.html +++ b/reference/algorithms/generated/networkx.algorithms.reciprocity.reciprocity.html @@ -666,7 +666,7 @@ In such cases this function will return None.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.regular.is_k_regular.html b/reference/algorithms/generated/networkx.algorithms.regular.is_k_regular.html index f4c741a7..897b90f5 100644 --- a/reference/algorithms/generated/networkx.algorithms.regular.is_k_regular.html +++ b/reference/algorithms/generated/networkx.algorithms.regular.is_k_regular.html @@ -659,7 +659,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.regular.is_regular.html b/reference/algorithms/generated/networkx.algorithms.regular.is_regular.html index 7562d2a6..f8ca17eb 100644 --- a/reference/algorithms/generated/networkx.algorithms.regular.is_regular.html +++ b/reference/algorithms/generated/networkx.algorithms.regular.is_regular.html @@ -661,7 +661,7 @@ vertex are equal.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.regular.k_factor.html b/reference/algorithms/generated/networkx.algorithms.regular.k_factor.html index 99e80864..729f8f01 100644 --- a/reference/algorithms/generated/networkx.algorithms.regular.k_factor.html +++ b/reference/algorithms/generated/networkx.algorithms.regular.k_factor.html @@ -677,7 +677,7 @@ Information processing letters, 2009.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.richclub.rich_club_coefficient.html b/reference/algorithms/generated/networkx.algorithms.richclub.rich_club_coefficient.html index 91e78560..4dda637f 100644 --- a/reference/algorithms/generated/networkx.algorithms.richclub.rich_club_coefficient.html +++ b/reference/algorithms/generated/networkx.algorithms.richclub.rich_club_coefficient.html @@ -700,7 +700,7 @@ sequences”, 2006. <a class="reference external" href="https://arxiv.org/abs/co <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.astar.astar_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.astar.astar_path.html index de0313f9..be99cbae 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.astar.astar_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.astar.astar_path.html @@ -705,7 +705,7 @@ will find the shortest red path.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.astar.astar_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.astar.astar_path_length.html index 1268f2fb..0464cd3d 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.astar.astar_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.astar.astar_path_length.html @@ -682,7 +682,7 @@ return a number or None to indicate a hidden edge.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall.html index f5afab2c..690bd9ef 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall.html @@ -670,7 +670,7 @@ It has running time <span class="math notranslate nohighlight">\(O(n^3)\)</span> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_numpy.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_numpy.html index ae7c71d7..baebd43e 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_numpy.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_numpy.html @@ -678,7 +678,7 @@ cycles. It has running time <span class="math notranslate nohighlight">\(O(n^3)\ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance.html index 4354c1ff..d4c4745d 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.floyd_warshall_predecessor_and_distance.html @@ -691,7 +691,7 @@ It has running time <span class="math notranslate nohighlight">\(O(n^3)\)</span> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.reconstruct_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.reconstruct_path.html index 5b3db4fc..c74df4d3 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.reconstruct_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.dense.reconstruct_path.html @@ -669,7 +669,7 @@ floyd_warshall_predecessor_and_distance function</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.all_shortest_paths.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.all_shortest_paths.html index 9055ff49..ece88a39 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.all_shortest_paths.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.all_shortest_paths.html @@ -700,7 +700,7 @@ length – instead, we only produce the shortest simple paths.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.average_shortest_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.average_shortest_path_length.html index f9934c5e..5636dc6b 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.average_shortest_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.average_shortest_path_length.html @@ -699,7 +699,7 @@ length for each component</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.has_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.has_path.html index a757d211..771e07bc 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.has_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.has_path.html @@ -650,7 +650,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.shortest_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.shortest_path.html index dfeeaf94..ac22940c 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.shortest_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.shortest_path.html @@ -720,7 +720,7 @@ This returns only one of them.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.shortest_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.shortest_path_length.html index ef96625e..8484cb5d 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.shortest_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.generic.shortest_path_length.html @@ -725,7 +725,7 @@ the edge orientation.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path.html index e6a21367..8af004fc 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path.html @@ -668,7 +668,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length.html index 7c8ceb80..a5e73b5d 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.all_pairs_shortest_path_length.html @@ -674,7 +674,7 @@ shortest path length as the key value.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path.html index 742f2154..7b02ee28 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.bidirectional_shortest_path.html @@ -670,7 +670,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.predecessor.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.predecessor.html index 143fc236..542e8680 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.predecessor.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.predecessor.html @@ -678,7 +678,7 @@ during breadth-first-search).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path.html index aa6cadba..9c42cc39 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path.html @@ -675,7 +675,7 @@ only one of those paths.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length.html index 26ff04d9..4efe791f 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_source_shortest_path_length.html @@ -676,7 +676,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path.html index 1122ec5c..893cf43f 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path.html @@ -674,7 +674,7 @@ only one of those paths.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length.html index 583b550c..407c9084 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.unweighted.single_target_shortest_path_length.html @@ -676,7 +676,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path.html index 3f543ebd..d3edf61d 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path.html @@ -679,7 +679,7 @@ Distances are calculated as sums of weighted edges traversed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path_length.html index aa2dd5f4..ff7030c5 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_bellman_ford_path_length.html @@ -684,7 +684,7 @@ Distances are calculated as sums of weighted edges traversed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra.html index 77464f63..7a29416e 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra.html @@ -697,7 +697,7 @@ Distances are calculated as sums of weighted edges traversed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path.html index e09cb97a..dfcec6e2 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path.html @@ -682,7 +682,7 @@ Distances are calculated as sums of weighted edges traversed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path_length.html index de5212c7..3a0b7574 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.all_pairs_dijkstra_path_length.html @@ -687,7 +687,7 @@ Distances are calculated as sums of weighted edges traversed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path.html index b2475d8c..1cc268ec 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path.html @@ -690,7 +690,7 @@ Distances are calculated as sums of weighted edges traversed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path_length.html index 66035310..2c4c92eb 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_path_length.html @@ -691,7 +691,7 @@ Distances are calculated as sums of weighted edges traversed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_predecessor_and_distance.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_predecessor_and_distance.html index 78c4798d..493937aa 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_predecessor_and_distance.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bellman_ford_predecessor_and_distance.html @@ -654,7 +654,7 @@ In NetworkX v2.2 this changed to the source node having predecessor <code class= <span class="gp">>>> </span><span class="n">G</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="s2">"weight"</span><span class="p">]</span> <span class="o">=</span> <span class="o">-</span><span class="mi">7</span> <span class="gp">>>> </span><span class="n">nx</span><span class="o">.</span><span class="n">bellman_ford_predecessor_and_distance</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="mi">0</span><span class="p">)</span> <span class="gt">Traceback (most recent call last):</span> - <span class="o">...</span> +<span class="w"> </span><span class="o">...</span> <span class="gr">networkx.exception.NetworkXUnbounded</span>: <span class="n">Negative cycle detected.</span> </pre></div> </div> @@ -733,7 +733,7 @@ In NetworkX v2.2 this changed to the source node having predecessor <code class= <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bidirectional_dijkstra.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bidirectional_dijkstra.html index 03f92807..9cfa68a8 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bidirectional_dijkstra.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.bidirectional_dijkstra.html @@ -709,7 +709,7 @@ are negative or are floating point numbers <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_path.html index ccfb1b32..3b3e6761 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_path.html @@ -709,7 +709,7 @@ path and length-of-path if you need both, use that.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_path_length.html index a645b0e3..f0160133 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_path_length.html @@ -699,7 +699,7 @@ path and length-of-path if you need both, use that.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_predecessor_and_distance.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_predecessor_and_distance.html index 78985307..ec7f846c 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_predecessor_and_distance.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.dijkstra_predecessor_and_distance.html @@ -699,7 +699,7 @@ there are more than one shortest paths to the key node.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.find_negative_cycle.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.find_negative_cycle.html index c1a7c8a4..5b3c1bf1 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.find_negative_cycle.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.find_negative_cycle.html @@ -688,7 +688,7 @@ equals the first to indicate a cycle.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.goldberg_radzik.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.goldberg_radzik.html index e78bb105..acb2777d 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.goldberg_radzik.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.goldberg_radzik.html @@ -630,7 +630,7 @@ will not be detected.</p> <span class="gp">>>> </span><span class="n">G</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="s2">"weight"</span><span class="p">]</span> <span class="o">=</span> <span class="o">-</span><span class="mi">7</span> <span class="gp">>>> </span><span class="n">nx</span><span class="o">.</span><span class="n">goldberg_radzik</span><span class="p">(</span><span class="n">G</span><span class="p">,</span> <span class="mi">0</span><span class="p">)</span> <span class="gt">Traceback (most recent call last):</span> - <span class="o">...</span> +<span class="w"> </span><span class="o">...</span> <span class="gr">networkx.exception.NetworkXUnbounded</span>: <span class="n">Negative cycle detected.</span> </pre></div> </div> @@ -709,7 +709,7 @@ will not be detected.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.johnson.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.johnson.html index acba93c7..f38152df 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.johnson.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.johnson.html @@ -704,7 +704,7 @@ algorithm.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra.html index bda599e2..ee79a841 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra.html @@ -731,7 +731,7 @@ are negative or are floating point numbers <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path.html index 8c6c24f7..ae4ece83 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path.html @@ -703,7 +703,7 @@ will find the shortest red path.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length.html index 5af370ee..33770e1b 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.multi_source_dijkstra_path_length.html @@ -706,7 +706,7 @@ will find the shortest red path.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.negative_edge_cycle.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.negative_edge_cycle.html index 3048e1ae..977cc6bf 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.negative_edge_cycle.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.negative_edge_cycle.html @@ -683,7 +683,7 @@ node. It then removes that extra node.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford.html index 341ddc86..114e7470 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford.html @@ -711,7 +711,7 @@ Distances are calculated as sums of weighted edges traversed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path.html index 72d04f46..409cd282 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path.html @@ -688,7 +688,7 @@ Distances are calculated as sums of weighted edges traversed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length.html index 5b4f4c3e..e1c81faf 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_bellman_ford_path_length.html @@ -695,7 +695,7 @@ Distances are calculated as sums of weighted edges traversed.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra.html index 2257714d..313566e8 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra.html @@ -726,7 +726,7 @@ are negative or are floating point numbers <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path.html index 74e4916a..35e9ebe5 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path.html @@ -695,7 +695,7 @@ will find the shortest red path.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length.html b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length.html index ec068061..7f90479e 100644 --- a/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length.html +++ b/reference/algorithms/generated/networkx.algorithms.shortest_paths.weighted.single_source_dijkstra_path_length.html @@ -702,7 +702,7 @@ will find the shortest red path.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.similarity.generate_random_paths.html b/reference/algorithms/generated/networkx.algorithms.similarity.generate_random_paths.html index ae853180..36cc9534 100644 --- a/reference/algorithms/generated/networkx.algorithms.similarity.generate_random_paths.html +++ b/reference/algorithms/generated/networkx.algorithms.similarity.generate_random_paths.html @@ -689,7 +689,7 @@ inverted index mapping of nodes to the paths in which that node is present:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.similarity.graph_edit_distance.html b/reference/algorithms/generated/networkx.algorithms.similarity.graph_edit_distance.html index 3ab4a020..5cf0ead0 100644 --- a/reference/algorithms/generated/networkx.algorithms.similarity.graph_edit_distance.html +++ b/reference/algorithms/generated/networkx.algorithms.similarity.graph_edit_distance.html @@ -761,7 +761,7 @@ Lisbon, Portugal. 2015, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.similarity.optimal_edit_paths.html b/reference/algorithms/generated/networkx.algorithms.similarity.optimal_edit_paths.html index e430dd0f..37fff626 100644 --- a/reference/algorithms/generated/networkx.algorithms.similarity.optimal_edit_paths.html +++ b/reference/algorithms/generated/networkx.algorithms.similarity.optimal_edit_paths.html @@ -753,7 +753,7 @@ Lisbon, Portugal. 2015, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.similarity.optimize_edit_paths.html b/reference/algorithms/generated/networkx.algorithms.similarity.optimize_edit_paths.html index e691ee5e..82730c0b 100644 --- a/reference/algorithms/generated/networkx.algorithms.similarity.optimize_edit_paths.html +++ b/reference/algorithms/generated/networkx.algorithms.similarity.optimize_edit_paths.html @@ -755,7 +755,7 @@ Lisbon, Portugal. 2015, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.similarity.optimize_graph_edit_distance.html b/reference/algorithms/generated/networkx.algorithms.similarity.optimize_graph_edit_distance.html index bca62e28..5548c505 100644 --- a/reference/algorithms/generated/networkx.algorithms.similarity.optimize_graph_edit_distance.html +++ b/reference/algorithms/generated/networkx.algorithms.similarity.optimize_graph_edit_distance.html @@ -750,7 +750,7 @@ Lisbon, Portugal. 2015, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.similarity.panther_similarity.html b/reference/algorithms/generated/networkx.algorithms.similarity.panther_similarity.html index 0e4421df..d1de4549 100644 --- a/reference/algorithms/generated/networkx.algorithms.similarity.panther_similarity.html +++ b/reference/algorithms/generated/networkx.algorithms.similarity.panther_similarity.html @@ -691,7 +691,7 @@ Association for Computing Machinery. <a class="reference external" href="https:/ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.similarity.simrank_similarity.html b/reference/algorithms/generated/networkx.algorithms.similarity.simrank_similarity.html index 74389293..11956e12 100644 --- a/reference/algorithms/generated/networkx.algorithms.similarity.simrank_similarity.html +++ b/reference/algorithms/generated/networkx.algorithms.similarity.simrank_similarity.html @@ -733,7 +733,7 @@ Other ordering of nodes is also possible.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.simple_paths.all_simple_edge_paths.html b/reference/algorithms/generated/networkx.algorithms.simple_paths.all_simple_edge_paths.html index b20620df..8653f4f7 100644 --- a/reference/algorithms/generated/networkx.algorithms.simple_paths.all_simple_edge_paths.html +++ b/reference/algorithms/generated/networkx.algorithms.simple_paths.all_simple_edge_paths.html @@ -707,7 +707,7 @@ their associated keys:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.simple_paths.all_simple_paths.html b/reference/algorithms/generated/networkx.algorithms.simple_paths.all_simple_paths.html index 616080d5..cea2406c 100644 --- a/reference/algorithms/generated/networkx.algorithms.simple_paths.all_simple_paths.html +++ b/reference/algorithms/generated/networkx.algorithms.simple_paths.all_simple_paths.html @@ -787,7 +787,7 @@ nodes, this sequence of nodes will be returned multiple times:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.simple_paths.is_simple_path.html b/reference/algorithms/generated/networkx.algorithms.simple_paths.is_simple_path.html index b4cd142a..eba3e50f 100644 --- a/reference/algorithms/generated/networkx.algorithms.simple_paths.is_simple_path.html +++ b/reference/algorithms/generated/networkx.algorithms.simple_paths.is_simple_path.html @@ -688,7 +688,7 @@ like the following:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.simple_paths.shortest_simple_paths.html b/reference/algorithms/generated/networkx.algorithms.simple_paths.shortest_simple_paths.html index a6e88e6e..d470a71f 100644 --- a/reference/algorithms/generated/networkx.algorithms.simple_paths.shortest_simple_paths.html +++ b/reference/algorithms/generated/networkx.algorithms.simple_paths.shortest_simple_paths.html @@ -723,7 +723,7 @@ paths between two nodes.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.smallworld.lattice_reference.html b/reference/algorithms/generated/networkx.algorithms.smallworld.lattice_reference.html index d64546b7..a750bf9e 100644 --- a/reference/algorithms/generated/networkx.algorithms.smallworld.lattice_reference.html +++ b/reference/algorithms/generated/networkx.algorithms.smallworld.lattice_reference.html @@ -686,7 +686,7 @@ Science 296.5569 (2002): 910-913.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.smallworld.omega.html b/reference/algorithms/generated/networkx.algorithms.smallworld.omega.html index 7eafad3e..ac1fa42c 100644 --- a/reference/algorithms/generated/networkx.algorithms.smallworld.omega.html +++ b/reference/algorithms/generated/networkx.algorithms.smallworld.omega.html @@ -684,7 +684,7 @@ doi:10.1089/brain.2011.0038.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.smallworld.random_reference.html b/reference/algorithms/generated/networkx.algorithms.smallworld.random_reference.html index 422903e1..5c649fe8 100644 --- a/reference/algorithms/generated/networkx.algorithms.smallworld.random_reference.html +++ b/reference/algorithms/generated/networkx.algorithms.smallworld.random_reference.html @@ -678,7 +678,7 @@ Science 296.5569 (2002): 910-913.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.smallworld.sigma.html b/reference/algorithms/generated/networkx.algorithms.smallworld.sigma.html index ed6001cc..4ca6bec3 100644 --- a/reference/algorithms/generated/networkx.algorithms.smallworld.sigma.html +++ b/reference/algorithms/generated/networkx.algorithms.smallworld.sigma.html @@ -687,7 +687,7 @@ PLoS One. 3 (4). PMID 18446219. doi:10.1371/journal.pone.0002051.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.smetric.s_metric.html b/reference/algorithms/generated/networkx.algorithms.smetric.s_metric.html index 155b4cbc..d07abf3a 100644 --- a/reference/algorithms/generated/networkx.algorithms.smetric.s_metric.html +++ b/reference/algorithms/generated/networkx.algorithms.smetric.s_metric.html @@ -669,7 +669,7 @@ Definition, Properties, and Implications (Extended Version), 2005. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.sparsifiers.spanner.html b/reference/algorithms/generated/networkx.algorithms.sparsifiers.spanner.html index 22a77ea4..c34268d6 100644 --- a/reference/algorithms/generated/networkx.algorithms.sparsifiers.spanner.html +++ b/reference/algorithms/generated/networkx.algorithms.sparsifiers.spanner.html @@ -684,7 +684,7 @@ Random Struct. Algorithms 30(4): 532-563 (2007).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.structuralholes.constraint.html b/reference/algorithms/generated/networkx.algorithms.structuralholes.constraint.html index 5adc26a8..79a6361f 100644 --- a/reference/algorithms/generated/networkx.algorithms.structuralholes.constraint.html +++ b/reference/algorithms/generated/networkx.algorithms.structuralholes.constraint.html @@ -685,7 +685,7 @@ American Journal of Sociology (110): 349–399.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.structuralholes.effective_size.html b/reference/algorithms/generated/networkx.algorithms.structuralholes.effective_size.html index b4b7c80a..c172758c 100644 --- a/reference/algorithms/generated/networkx.algorithms.structuralholes.effective_size.html +++ b/reference/algorithms/generated/networkx.algorithms.structuralholes.effective_size.html @@ -716,7 +716,7 @@ CONNECTIONS 20(1):35-38. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.structuralholes.local_constraint.html b/reference/algorithms/generated/networkx.algorithms.structuralholes.local_constraint.html index 65ac0a22..39fe4c77 100644 --- a/reference/algorithms/generated/networkx.algorithms.structuralholes.local_constraint.html +++ b/reference/algorithms/generated/networkx.algorithms.structuralholes.local_constraint.html @@ -688,7 +688,7 @@ American Journal of Sociology (110): 349–399.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.summarization.dedensify.html b/reference/algorithms/generated/networkx.algorithms.summarization.dedensify.html index 6b0eb8b4..1701866a 100644 --- a/reference/algorithms/generated/networkx.algorithms.summarization.dedensify.html +++ b/reference/algorithms/generated/networkx.algorithms.summarization.dedensify.html @@ -743,7 +743,7 @@ original graph:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.summarization.snap_aggregation.html b/reference/algorithms/generated/networkx.algorithms.summarization.snap_aggregation.html index 58cf005a..8a6c7fca 100644 --- a/reference/algorithms/generated/networkx.algorithms.summarization.snap_aggregation.html +++ b/reference/algorithms/generated/networkx.algorithms.summarization.snap_aggregation.html @@ -739,7 +739,7 @@ analyze the information represented by the graph</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.swap.connected_double_edge_swap.html b/reference/algorithms/generated/networkx.algorithms.swap.connected_double_edge_swap.html index 0ba540c0..cf721c14 100644 --- a/reference/algorithms/generated/networkx.algorithms.swap.connected_double_edge_swap.html +++ b/reference/algorithms/generated/networkx.algorithms.swap.connected_double_edge_swap.html @@ -700,7 +700,7 @@ power law random graphs, 2003. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.swap.directed_edge_swap.html b/reference/algorithms/generated/networkx.algorithms.swap.directed_edge_swap.html index a1592f84..86cec27a 100644 --- a/reference/algorithms/generated/networkx.algorithms.swap.directed_edge_swap.html +++ b/reference/algorithms/generated/networkx.algorithms.swap.directed_edge_swap.html @@ -695,7 +695,7 @@ Degree Sequence with 2-Edge Swaps.” Mathematics Stack Exchange, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.swap.double_edge_swap.html b/reference/algorithms/generated/networkx.algorithms.swap.double_edge_swap.html index 311ff9c1..1c33f84d 100644 --- a/reference/algorithms/generated/networkx.algorithms.swap.double_edge_swap.html +++ b/reference/algorithms/generated/networkx.algorithms.swap.double_edge_swap.html @@ -682,7 +682,7 @@ If there are fewer than 4 nodes or 2 edges in <code class="xref py py-obj docuti <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.threshold.find_threshold_graph.html b/reference/algorithms/generated/networkx.algorithms.threshold.find_threshold_graph.html index 74421e2a..ca453740 100644 --- a/reference/algorithms/generated/networkx.algorithms.threshold.find_threshold_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.threshold.find_threshold_graph.html @@ -672,7 +672,7 @@ If <a class="reference external" href="https://docs.python.org/3/library/constan <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.threshold.is_threshold_graph.html b/reference/algorithms/generated/networkx.algorithms.threshold.is_threshold_graph.html index 2a00d044..14f32ce9 100644 --- a/reference/algorithms/generated/networkx.algorithms.threshold.is_threshold_graph.html +++ b/reference/algorithms/generated/networkx.algorithms.threshold.is_threshold_graph.html @@ -670,7 +670,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tournament.hamiltonian_path.html b/reference/algorithms/generated/networkx.algorithms.tournament.hamiltonian_path.html index 739d08df..13f5d78b 100644 --- a/reference/algorithms/generated/networkx.algorithms.tournament.hamiltonian_path.html +++ b/reference/algorithms/generated/networkx.algorithms.tournament.hamiltonian_path.html @@ -668,7 +668,7 @@ of <span class="math notranslate nohighlight">\(O(n^2)\)</span>, ignoring multip <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tournament.is_reachable.html b/reference/algorithms/generated/networkx.algorithms.tournament.is_reachable.html index b5177a22..3fdaa2bc 100644 --- a/reference/algorithms/generated/networkx.algorithms.tournament.is_reachable.html +++ b/reference/algorithms/generated/networkx.algorithms.tournament.is_reachable.html @@ -689,7 +689,7 @@ tournaments.” <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tournament.is_strongly_connected.html b/reference/algorithms/generated/networkx.algorithms.tournament.is_strongly_connected.html index 305c9f07..4741ad8a 100644 --- a/reference/algorithms/generated/networkx.algorithms.tournament.is_strongly_connected.html +++ b/reference/algorithms/generated/networkx.algorithms.tournament.is_strongly_connected.html @@ -685,7 +685,7 @@ tournaments.” <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tournament.is_tournament.html b/reference/algorithms/generated/networkx.algorithms.tournament.is_tournament.html index a136909d..4733afb1 100644 --- a/reference/algorithms/generated/networkx.algorithms.tournament.is_tournament.html +++ b/reference/algorithms/generated/networkx.algorithms.tournament.is_tournament.html @@ -666,7 +666,7 @@ the convention used here.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tournament.random_tournament.html b/reference/algorithms/generated/networkx.algorithms.tournament.random_tournament.html index 9f169681..f87c8561 100644 --- a/reference/algorithms/generated/networkx.algorithms.tournament.random_tournament.html +++ b/reference/algorithms/generated/networkx.algorithms.tournament.random_tournament.html @@ -662,7 +662,7 @@ graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tournament.score_sequence.html b/reference/algorithms/generated/networkx.algorithms.tournament.score_sequence.html index 1cdae9c2..5bf4d6bc 100644 --- a/reference/algorithms/generated/networkx.algorithms.tournament.score_sequence.html +++ b/reference/algorithms/generated/networkx.algorithms.tournament.score_sequence.html @@ -662,7 +662,7 @@ nodes of the graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.beamsearch.bfs_beam_edges.html b/reference/algorithms/generated/networkx.algorithms.traversal.beamsearch.bfs_beam_edges.html index 4dcac653..cc147438 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.beamsearch.bfs_beam_edges.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.beamsearch.bfs_beam_edges.html @@ -701,7 +701,7 @@ value of the node:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_edges.html b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_edges.html index 0e75ba50..d58c107c 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_edges.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_edges.html @@ -713,7 +713,7 @@ as described in <a class="reference internal" href="#reccb7b97bcd5-2" id="id2">[ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_layers.html b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_layers.html index 4477f3dd..467075bc 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_layers.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_layers.html @@ -667,7 +667,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_predecessors.html b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_predecessors.html index 7434357d..1c8822fb 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_predecessors.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_predecessors.html @@ -693,7 +693,7 @@ to allow depth limits based on the Wikipedia article <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_successors.html b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_successors.html index 304cca29..c9a0e473 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_successors.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_successors.html @@ -693,7 +693,7 @@ to allow depth limits based on the Wikipedia article <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_tree.html b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_tree.html index 7fca2a5d..c21cc80c 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_tree.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.bfs_tree.html @@ -686,7 +686,7 @@ to allow depth limits based on the Wikipedia article <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.descendants_at_distance.html b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.descendants_at_distance.html index fac7cbe4..31fb386d 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.descendants_at_distance.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.breadth_first_search.descendants_at_distance.html @@ -669,7 +669,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_edges.html b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_edges.html index 3aace4d4..2c3ab867 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_edges.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_edges.html @@ -696,7 +696,7 @@ to allow depth limits based on the Wikipedia article <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges.html b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges.html index f4b7f0b8..b665562c 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_labeled_edges.html @@ -698,7 +698,7 @@ algorithm in more detail than, for example, <a class="reference internal" href=" <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes.html b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes.html index 37ff1633..ec25a668 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_postorder_nodes.html @@ -681,7 +681,7 @@ to allow depth limits based on the Wikipedia article <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_predecessors.html b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_predecessors.html index cf59d1b3..6b898484 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_predecessors.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_predecessors.html @@ -681,7 +681,7 @@ to allow depth limits based on the Wikipedia article <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes.html b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes.html index e2cc0d43..6205d826 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_preorder_nodes.html @@ -681,7 +681,7 @@ to allow depth limits based on the Wikipedia article <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_successors.html b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_successors.html index d544f29e..e22d925e 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_successors.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_successors.html @@ -681,7 +681,7 @@ to allow depth limits based on the Wikipedia article <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_tree.html b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_tree.html index c5fb5771..ee67a200 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_tree.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.depth_first_search.dfs_tree.html @@ -676,7 +676,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.edgebfs.edge_bfs.html b/reference/algorithms/generated/networkx.algorithms.traversal.edgebfs.edge_bfs.html index 2ae66ea1..3baa9bc7 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.edgebfs.edge_bfs.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.edgebfs.edge_bfs.html @@ -728,7 +728,7 @@ while ‘edge_bfs’ reports all edges in the order they are explored.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.traversal.edgedfs.edge_dfs.html b/reference/algorithms/generated/networkx.algorithms.traversal.edgedfs.edge_dfs.html index 739e045f..b5f7bbbe 100644 --- a/reference/algorithms/generated/networkx.algorithms.traversal.edgedfs.edge_dfs.html +++ b/reference/algorithms/generated/networkx.algorithms.traversal.edgedfs.edge_dfs.html @@ -718,7 +718,7 @@ if not for the functionality provided by this function.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.branchings.ArborescenceIterator.html b/reference/algorithms/generated/networkx.algorithms.tree.branchings.ArborescenceIterator.html index c66611f6..cdcb44b0 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.branchings.ArborescenceIterator.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.branchings.ArborescenceIterator.html @@ -696,7 +696,7 @@ the arborescences, <code class="xref py py-obj docutils literal notranslate"><sp <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.branchings.Edmonds.html b/reference/algorithms/generated/networkx.algorithms.tree.branchings.Edmonds.html index 227f6ab5..89418806 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.branchings.Edmonds.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.branchings.Edmonds.html @@ -679,7 +679,7 @@ Bureau of Standards, 1967, Vol. 71B, p.233-240, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.branchings.branching_weight.html b/reference/algorithms/generated/networkx.algorithms.tree.branchings.branching_weight.html index 88fee247..8ccc7d3c 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.branchings.branching_weight.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.branchings.branching_weight.html @@ -667,7 +667,7 @@ treated equally with a weight of 1.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.branchings.greedy_branching.html b/reference/algorithms/generated/networkx.algorithms.tree.branchings.greedy_branching.html index 58837e65..3ca8d006 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.branchings.greedy_branching.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.branchings.greedy_branching.html @@ -669,7 +669,7 @@ See <a class="reference internal" href="../../randomness.html#randomness"><span <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.branchings.maximum_branching.html b/reference/algorithms/generated/networkx.algorithms.tree.branchings.maximum_branching.html index 2f03aadb..0646ceb9 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.branchings.maximum_branching.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.branchings.maximum_branching.html @@ -665,7 +665,7 @@ data on the graph. Edges can be included, excluded or open using the <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.branchings.maximum_spanning_arborescence.html b/reference/algorithms/generated/networkx.algorithms.tree.branchings.maximum_spanning_arborescence.html index c571a655..1b7951dd 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.branchings.maximum_spanning_arborescence.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.branchings.maximum_spanning_arborescence.html @@ -671,7 +671,7 @@ data on the graph. Edges can be included, excluded or open using the <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.branchings.minimum_branching.html b/reference/algorithms/generated/networkx.algorithms.tree.branchings.minimum_branching.html index 58e6d6f5..f9a50db0 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.branchings.minimum_branching.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.branchings.minimum_branching.html @@ -665,7 +665,7 @@ data on the graph. Edges can be included, excluded or open using the <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.branchings.minimum_spanning_arborescence.html b/reference/algorithms/generated/networkx.algorithms.tree.branchings.minimum_spanning_arborescence.html index b5594d13..830a826d 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.branchings.minimum_spanning_arborescence.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.branchings.minimum_spanning_arborescence.html @@ -671,7 +671,7 @@ data on the graph. Edges can be included, excluded or open using the <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.coding.NotATree.html b/reference/algorithms/generated/networkx.algorithms.tree.coding.NotATree.html index 760de62b..1135b423 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.coding.NotATree.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.coding.NotATree.html @@ -641,7 +641,7 @@ instead.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.coding.from_nested_tuple.html b/reference/algorithms/generated/networkx.algorithms.tree.coding.from_nested_tuple.html index e54b87be..abe84b6c 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.coding.from_nested_tuple.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.coding.from_nested_tuple.html @@ -685,7 +685,7 @@ starting at 0:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.coding.from_prufer_sequence.html b/reference/algorithms/generated/networkx.algorithms.tree.coding.from_prufer_sequence.html index 383cdf77..ac3b5501 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.coding.from_prufer_sequence.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.coding.from_prufer_sequence.html @@ -700,7 +700,7 @@ function:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.coding.to_nested_tuple.html b/reference/algorithms/generated/networkx.algorithms.tree.coding.to_nested_tuple.html index f3765a01..912bb293 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.coding.to_nested_tuple.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.coding.to_nested_tuple.html @@ -700,7 +700,7 @@ nested tuples will be sorted:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.coding.to_prufer_sequence.html b/reference/algorithms/generated/networkx.algorithms.tree.coding.to_prufer_sequence.html index c30253ba..74b40ece 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.coding.to_prufer_sequence.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.coding.to_prufer_sequence.html @@ -710,7 +710,7 @@ function:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.decomposition.junction_tree.html b/reference/algorithms/generated/networkx.algorithms.tree.decomposition.junction_tree.html index fb4bb741..d0689647 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.decomposition.junction_tree.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.decomposition.junction_tree.html @@ -692,7 +692,7 @@ Morgan Kaufmann Publishers Inc., San Francisco, CA, USA, 360–366.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.mst.SpanningTreeIterator.html b/reference/algorithms/generated/networkx.algorithms.tree.mst.SpanningTreeIterator.html index 3ec077ed..e11668e9 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.mst.SpanningTreeIterator.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.mst.SpanningTreeIterator.html @@ -693,7 +693,7 @@ If <code class="xref py py-obj docutils literal notranslate"><span class="pre">i <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.mst.maximum_spanning_edges.html b/reference/algorithms/generated/networkx.algorithms.tree.mst.maximum_spanning_edges.html index 723a76f6..988f6903 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.mst.maximum_spanning_edges.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.mst.maximum_spanning_edges.html @@ -707,7 +707,7 @@ attribute a default weight of 1 will be used.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.mst.maximum_spanning_tree.html b/reference/algorithms/generated/networkx.algorithms.tree.mst.maximum_spanning_tree.html index cecf4254..eae803c9 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.mst.maximum_spanning_tree.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.mst.maximum_spanning_tree.html @@ -679,7 +679,7 @@ See <code class="xref py py-mod docutils literal notranslate"><span class="pre"> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.mst.minimum_spanning_edges.html b/reference/algorithms/generated/networkx.algorithms.tree.mst.minimum_spanning_edges.html index 81420e45..807e104f 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.mst.minimum_spanning_edges.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.mst.minimum_spanning_edges.html @@ -707,7 +707,7 @@ attribute a default weight of 1 will be used.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.mst.minimum_spanning_tree.html b/reference/algorithms/generated/networkx.algorithms.tree.mst.minimum_spanning_tree.html index b9c49e87..98cf041e 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.mst.minimum_spanning_tree.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.mst.minimum_spanning_tree.html @@ -679,7 +679,7 @@ See <code class="xref py py-mod docutils literal notranslate"><span class="pre"> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.mst.random_spanning_tree.html b/reference/algorithms/generated/networkx.algorithms.tree.mst.random_spanning_tree.html index ec47ebc6..af86f3e9 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.mst.random_spanning_tree.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.mst.random_spanning_tree.html @@ -680,7 +680,7 @@ Algorithms, 11 (1990), pp. 185–207</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.operations.join.html b/reference/algorithms/generated/networkx.algorithms.tree.operations.join.html index 49a53bee..32179347 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.operations.join.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.operations.join.html @@ -681,7 +681,7 @@ balanced binary tree of depth <em>h</em> + 1:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_arborescence.html b/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_arborescence.html index 22d40ccd..e58fa3df 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_arborescence.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_arborescence.html @@ -672,7 +672,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_branching.html b/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_branching.html index 8fede871..db51b164 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_branching.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_branching.html @@ -672,7 +672,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_forest.html b/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_forest.html index 0fba0647..32b66b12 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_forest.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_forest.html @@ -682,7 +682,7 @@ then <em>forest</em> corresponds to a <em>branching</em>.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_tree.html b/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_tree.html index e5749c11..fa922f47 100644 --- a/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_tree.html +++ b/reference/algorithms/generated/networkx.algorithms.tree.recognition.is_tree.html @@ -682,7 +682,7 @@ undirected edge in a multigraph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.triads.all_triads.html b/reference/algorithms/generated/networkx.algorithms.triads.all_triads.html index 11698833..e38cd9ec 100644 --- a/reference/algorithms/generated/networkx.algorithms.triads.all_triads.html +++ b/reference/algorithms/generated/networkx.algorithms.triads.all_triads.html @@ -663,7 +663,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.triads.all_triplets.html b/reference/algorithms/generated/networkx.algorithms.triads.all_triplets.html index d7ef31fb..f40bf61b 100644 --- a/reference/algorithms/generated/networkx.algorithms.triads.all_triplets.html +++ b/reference/algorithms/generated/networkx.algorithms.triads.all_triplets.html @@ -659,7 +659,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.triads.is_triad.html b/reference/algorithms/generated/networkx.algorithms.triads.is_triad.html index 9c5f595e..682de859 100644 --- a/reference/algorithms/generated/networkx.algorithms.triads.is_triad.html +++ b/reference/algorithms/generated/networkx.algorithms.triads.is_triad.html @@ -662,7 +662,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.triads.random_triad.html b/reference/algorithms/generated/networkx.algorithms.triads.random_triad.html index d16814ef..cd986c7d 100644 --- a/reference/algorithms/generated/networkx.algorithms.triads.random_triad.html +++ b/reference/algorithms/generated/networkx.algorithms.triads.random_triad.html @@ -663,7 +663,7 @@ See <a class="reference internal" href="../../randomness.html#randomness"><span <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.triads.triad_type.html b/reference/algorithms/generated/networkx.algorithms.triads.triad_type.html index 5c099cce..428b12a1 100644 --- a/reference/algorithms/generated/networkx.algorithms.triads.triad_type.html +++ b/reference/algorithms/generated/networkx.algorithms.triads.triad_type.html @@ -689,7 +689,7 @@ Oxford. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.triads.triadic_census.html b/reference/algorithms/generated/networkx.algorithms.triads.triadic_census.html index f0112cd7..74eb66a2 100644 --- a/reference/algorithms/generated/networkx.algorithms.triads.triadic_census.html +++ b/reference/algorithms/generated/networkx.algorithms.triads.triadic_census.html @@ -709,7 +709,7 @@ University of Ljubljana, <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.triads.triads_by_type.html b/reference/algorithms/generated/networkx.algorithms.triads.triads_by_type.html index c35c99c1..21724dd5 100644 --- a/reference/algorithms/generated/networkx.algorithms.triads.triads_by_type.html +++ b/reference/algorithms/generated/networkx.algorithms.triads.triads_by_type.html @@ -694,7 +694,7 @@ Oxford. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.vitality.closeness_vitality.html b/reference/algorithms/generated/networkx.algorithms.vitality.closeness_vitality.html index 76d1f167..cce03c51 100644 --- a/reference/algorithms/generated/networkx.algorithms.vitality.closeness_vitality.html +++ b/reference/algorithms/generated/networkx.algorithms.vitality.closeness_vitality.html @@ -698,7 +698,7 @@ Springer, 2005. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.voronoi.voronoi_cells.html b/reference/algorithms/generated/networkx.algorithms.voronoi.voronoi_cells.html index d4c6d7c4..569a2655 100644 --- a/reference/algorithms/generated/networkx.algorithms.voronoi.voronoi_cells.html +++ b/reference/algorithms/generated/networkx.algorithms.voronoi.voronoi_cells.html @@ -702,7 +702,7 @@ take the collection of all values in the returned dictionary:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/generated/networkx.algorithms.wiener.wiener_index.html b/reference/algorithms/generated/networkx.algorithms.wiener.wiener_index.html index 4d5ae9ba..45abdcf7 100644 --- a/reference/algorithms/generated/networkx.algorithms.wiener.wiener_index.html +++ b/reference/algorithms/generated/networkx.algorithms.wiener.wiener_index.html @@ -688,7 +688,7 @@ nodes is at distance one:</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/graph_hashing.html b/reference/algorithms/graph_hashing.html index 4721ab14..5d2112b3 100644 --- a/reference/algorithms/graph_hashing.html +++ b/reference/algorithms/graph_hashing.html @@ -625,7 +625,7 @@ For now, only Weisfeiler-Lehman hashing is implemented.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/graphical.html b/reference/algorithms/graphical.html index 747ec46f..2c596274 100644 --- a/reference/algorithms/graphical.html +++ b/reference/algorithms/graphical.html @@ -635,7 +635,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/hierarchy.html b/reference/algorithms/hierarchy.html index 584a4709..e78d69e7 100644 --- a/reference/algorithms/hierarchy.html +++ b/reference/algorithms/hierarchy.html @@ -620,7 +620,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/hybrid.html b/reference/algorithms/hybrid.html index 7775fd5b..24fade9b 100644 --- a/reference/algorithms/hybrid.html +++ b/reference/algorithms/hybrid.html @@ -624,7 +624,7 @@ graphs.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/index.html b/reference/algorithms/index.html index 1416f035..58ae5e29 100644 --- a/reference/algorithms/index.html +++ b/reference/algorithms/index.html @@ -1157,7 +1157,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/isolates.html b/reference/algorithms/isolates.html index 93a776ee..f464aeda 100644 --- a/reference/algorithms/isolates.html +++ b/reference/algorithms/isolates.html @@ -626,7 +626,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/isomorphism.html b/reference/algorithms/isomorphism.html index 58b5253c..a30d3194 100644 --- a/reference/algorithms/isomorphism.html +++ b/reference/algorithms/isomorphism.html @@ -791,7 +791,7 @@ by Matthew Suderman <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/isomorphism.ismags.html b/reference/algorithms/isomorphism.ismags.html index d80d49f2..39e63e04 100644 --- a/reference/algorithms/isomorphism.ismags.html +++ b/reference/algorithms/isomorphism.ismags.html @@ -764,7 +764,7 @@ Enumeration”, PLoS One 9(5): e97896, 2014. <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/isomorphism.vf2.html b/reference/algorithms/isomorphism.vf2.html index b71d26cd..99e3da1d 100644 --- a/reference/algorithms/isomorphism.vf2.html +++ b/reference/algorithms/isomorphism.vf2.html @@ -890,7 +890,7 @@ polynomial-time algorithm is known to exist).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/link_analysis.html b/reference/algorithms/link_analysis.html index 3a83a5ad..669b78af 100644 --- a/reference/algorithms/link_analysis.html +++ b/reference/algorithms/link_analysis.html @@ -659,7 +659,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/link_prediction.html b/reference/algorithms/link_prediction.html index 401940c8..d60091d9 100644 --- a/reference/algorithms/link_prediction.html +++ b/reference/algorithms/link_prediction.html @@ -641,7 +641,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/lowest_common_ancestors.html b/reference/algorithms/lowest_common_ancestors.html index c5f0065a..ca7144b6 100644 --- a/reference/algorithms/lowest_common_ancestors.html +++ b/reference/algorithms/lowest_common_ancestors.html @@ -626,7 +626,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/matching.html b/reference/algorithms/matching.html index 78b67098..e14c16aa 100644 --- a/reference/algorithms/matching.html +++ b/reference/algorithms/matching.html @@ -635,7 +635,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/minors.html b/reference/algorithms/minors.html index 599c08b2..91a35a74 100644 --- a/reference/algorithms/minors.html +++ b/reference/algorithms/minors.html @@ -661,7 +661,7 @@ can be formed from G by deleting edges and vertices and by contracting edges <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/mis.html b/reference/algorithms/mis.html index 559a857a..e942e8ff 100644 --- a/reference/algorithms/mis.html +++ b/reference/algorithms/mis.html @@ -620,7 +620,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/moral.html b/reference/algorithms/moral.html index c69472ca..c802989e 100644 --- a/reference/algorithms/moral.html +++ b/reference/algorithms/moral.html @@ -620,7 +620,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/node_classification.html b/reference/algorithms/node_classification.html index 3784d073..70ee0f64 100644 --- a/reference/algorithms/node_classification.html +++ b/reference/algorithms/node_classification.html @@ -662,7 +662,7 @@ In ICML (Vol. 3, pp. 912-919).</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/non_randomness.html b/reference/algorithms/non_randomness.html index 343d2256..eb925902 100644 --- a/reference/algorithms/non_randomness.html +++ b/reference/algorithms/non_randomness.html @@ -620,7 +620,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/operators.html b/reference/algorithms/operators.html index 4a5c9c44..02b8cd65 100644 --- a/reference/algorithms/operators.html +++ b/reference/algorithms/operators.html @@ -692,7 +692,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/planar_drawing.html b/reference/algorithms/planar_drawing.html index e4337c2d..c46b1565 100644 --- a/reference/algorithms/planar_drawing.html +++ b/reference/algorithms/planar_drawing.html @@ -619,7 +619,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/planarity.html b/reference/algorithms/planarity.html index 26c78117..8f44b226 100644 --- a/reference/algorithms/planarity.html +++ b/reference/algorithms/planarity.html @@ -625,7 +625,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/polynomials.html b/reference/algorithms/polynomials.html index 662bc2e1..a38dc0ea 100644 --- a/reference/algorithms/polynomials.html +++ b/reference/algorithms/polynomials.html @@ -646,7 +646,7 @@ matrix of a graph. Consider the complete graph <code class="docutils literal not <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/reciprocity.html b/reference/algorithms/reciprocity.html index 51492cdc..c6df96c2 100644 --- a/reference/algorithms/reciprocity.html +++ b/reference/algorithms/reciprocity.html @@ -623,7 +623,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/regular.html b/reference/algorithms/regular.html index 5e5063de..0cb98ac1 100644 --- a/reference/algorithms/regular.html +++ b/reference/algorithms/regular.html @@ -626,7 +626,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/rich_club.html b/reference/algorithms/rich_club.html index 3fbe98ce..8834a270 100644 --- a/reference/algorithms/rich_club.html +++ b/reference/algorithms/rich_club.html @@ -620,7 +620,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/shortest_paths.html b/reference/algorithms/shortest_paths.html index 3e8b0904..692774f5 100644 --- a/reference/algorithms/shortest_paths.html +++ b/reference/algorithms/shortest_paths.html @@ -808,7 +808,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/similarity.html b/reference/algorithms/similarity.html index 8f62e9e1..0a263e74 100644 --- a/reference/algorithms/similarity.html +++ b/reference/algorithms/similarity.html @@ -647,7 +647,7 @@ alternative GED algorithms, in order to improve the choices available.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/simple_paths.html b/reference/algorithms/simple_paths.html index 90b04d98..b39f1af4 100644 --- a/reference/algorithms/simple_paths.html +++ b/reference/algorithms/simple_paths.html @@ -628,7 +628,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/smallworld.html b/reference/algorithms/smallworld.html index be64305b..d498a1b7 100644 --- a/reference/algorithms/smallworld.html +++ b/reference/algorithms/smallworld.html @@ -642,7 +642,7 @@ or lattice graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/smetric.html b/reference/algorithms/smetric.html index 8dbff0cc..fb902e2c 100644 --- a/reference/algorithms/smetric.html +++ b/reference/algorithms/smetric.html @@ -619,7 +619,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/sparsifiers.html b/reference/algorithms/sparsifiers.html index 01b37227..72dfe1e5 100644 --- a/reference/algorithms/sparsifiers.html +++ b/reference/algorithms/sparsifiers.html @@ -620,7 +620,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/structuralholes.html b/reference/algorithms/structuralholes.html index fefadd64..f0282dcd 100644 --- a/reference/algorithms/structuralholes.html +++ b/reference/algorithms/structuralholes.html @@ -626,7 +626,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/summarization.html b/reference/algorithms/summarization.html index 3886eca6..5d32a0b8 100644 --- a/reference/algorithms/summarization.html +++ b/reference/algorithms/summarization.html @@ -674,7 +674,7 @@ and Applications: A Survey</a></p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/swap.html b/reference/algorithms/swap.html index a399f170..3aa58858 100644 --- a/reference/algorithms/swap.html +++ b/reference/algorithms/swap.html @@ -626,7 +626,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/threshold.html b/reference/algorithms/threshold.html index b57c233e..15352527 100644 --- a/reference/algorithms/threshold.html +++ b/reference/algorithms/threshold.html @@ -623,7 +623,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/tournament.html b/reference/algorithms/tournament.html index 63990749..2c3d6076 100644 --- a/reference/algorithms/tournament.html +++ b/reference/algorithms/tournament.html @@ -649,7 +649,7 @@ graph.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/traversal.html b/reference/algorithms/traversal.html index 8fddb159..7a2afc46 100644 --- a/reference/algorithms/traversal.html +++ b/reference/algorithms/traversal.html @@ -739,7 +739,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/tree.html b/reference/algorithms/tree.html index 4e28debd..59505e07 100644 --- a/reference/algorithms/tree.html +++ b/reference/algorithms/tree.html @@ -877,7 +877,7 @@ sequences to labeled trees.</p> <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/triads.html b/reference/algorithms/triads.html index 8df00e07..bc0d3ee3 100644 --- a/reference/algorithms/triads.html +++ b/reference/algorithms/triads.html @@ -638,7 +638,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/vitality.html b/reference/algorithms/vitality.html index 9e1550ee..df5d0379 100644 --- a/reference/algorithms/vitality.html +++ b/reference/algorithms/vitality.html @@ -620,7 +620,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/voronoi.html b/reference/algorithms/voronoi.html index 13cfb47c..81282393 100644 --- a/reference/algorithms/voronoi.html +++ b/reference/algorithms/voronoi.html @@ -620,7 +620,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> diff --git a/reference/algorithms/wiener.html b/reference/algorithms/wiener.html index 8314b653..f79fb4db 100644 --- a/reference/algorithms/wiener.html +++ b/reference/algorithms/wiener.html @@ -620,7 +620,7 @@ <p class="copyright"> - © Copyright 2004-2022, NetworkX Developers.<br> + © Copyright 2004-2023, NetworkX Developers.<br> </p> |