Add 2.8.x release notes (#6255)

4 files changed, 199 insertions, 0 deletions

diff --git a/doc/release/index.rst b/doc/release/index.rst
index a0b592be..7ab33c98 100644
--- a/doc/release/index.rst
+++ b/doc/release/index.rst
@@ -15,6 +15,9 @@ period.
    :maxdepth: 2
 
    release_dev
+   release_2.8.8
+   release_2.8.7
+   release_2.8.6
    release_2.8.5
    release_2.8.4
    release_2.8.3
diff --git a/doc/release/release_2.8.6.rst b/doc/release/release_2.8.6.rst
new file mode 100644
index 00000000..fbc43f2a
--- /dev/null
+++ b/doc/release/release_2.8.6.rst
@@ -0,0 +1,74 @@
+NetworkX 2.8.6
+==============
+
+Release date: 22 August 2022
+
+Supports Python 3.8, 3.9, and 3.10.
+
+NetworkX is a Python package for the creation, manipulation, and study of the
+structure, dynamics, and functions of complex networks.
+
+For more information, please visit our `website <https://networkx.org/>`_
+and our :ref:`gallery of examples <examples_gallery>`.
+Please send comments and questions to the `networkx-discuss mailing list
+<http://groups.google.com/group/networkx-discuss>`_.
+
+Highlights
+----------
+
+Minor documentation and bug fixes.
+
+Merged PRs
+----------
+
+- Add random_spanning_tree to documentation (#5810)
+- DOC: Switch to enumerated list in quotient_graph docstring (#5837)
+- Add warning to nx_agraph about layout nondeterminism. (#5832)
+- Update docs to include description of the `return_seen` kwarg (#5891)
+- Add cache reset for when G._node is changed (#5894)
+- Allow classes to relabel nodes -- casting (#5903)
+- Update lattice.py (#5914)
+- Add to about_us.rst (#5919)
+- Update precommit hooks (#5923)
+- Remove old Appveyor cruft (#5924)
+- signature change for `node_link` functions: for issue #5787 (#5899)
+- Allow unsortable nodes in approximation.treewidth functions (#5921)
+- Fix Louvain_partitions by yielding a copy of the sets in the partition gh-5901 (#5902)
+- Adds ```nx.bfs_layers``` method (#5879)
+- Add function bfs_layers to docs (#5932)
+- Propose to make new node_link arguments keyword only. (#5928)
+- Bump nodelink args deprecation expiration to v3.2 (#5933)
+- Add examples to lowest common ancestors algorithms (#5531)
+- Naive lowest common ancestor implementation (#5736)
+- Add examples for the condensation function (#5452)
+- Minor doc fixups (#5868)
+- update all_pairs_lca docstrings (#5876)
+- Improve LCA input validation (#5877)
+- Replace LCA with naive implementations (#5883)
+- Update release notes
+- docstring update to lexicographical_topological_sort issue 5681 (#5930)
+- Support matplotlb 3.6rc1 failure (#5937)
+
+Improvements
+------------
+
+- [`#5883 <https://github.com/networkx/networkx/pull/5883>`_]
+  Replace the implementation of ``lowest_common_ancestor`` and
+  ``all_pairs_lowest_common_ancestor`` with a "naive" algorithm to fix
+  several bugs and improve performance.
+
+Contributors
+------------
+
+- Tanmay Aeron
+- Ross Barnowski
+- Kevin Brown
+- Matthias Bussonnier
+- Tigran Khachatryan
+- Dhaval Kumar
+- Jarrod Millman
+- Sultan Orazbayev
+- Dan Schult
+- Matt Schwennesen
+- Dilara Tekinoglu
+- kpetridis
diff --git a/doc/release/release_2.8.7.rst b/doc/release/release_2.8.7.rst
new file mode 100644
index 00000000..71b5aec3
--- /dev/null
+++ b/doc/release/release_2.8.7.rst
@@ -0,0 +1,52 @@
+NetworkX 2.8.7
+==============
+
+Release date: 1 October 2022
+
+Supports Python 3.8, 3.9, and 3.10.
+
+NetworkX is a Python package for the creation, manipulation, and study of the
+structure, dynamics, and functions of complex networks.
+
+For more information, please visit our `website <https://networkx.org/>`_
+and our :ref:`gallery of examples <examples_gallery>`.
+Please send comments and questions to the `networkx-discuss mailing list
+<http://groups.google.com/group/networkx-discuss>`_.
+
+Highlights
+----------
+
+Minor documentation and bug fixes.
+
+Merged PRs
+----------
+
+- Bump release version
+- Fixed unused root argument in has_bridges (#5846)
+- docstring updates for `union`, `disjoint_union`, and `compose` (#5892)
+- Updated networkx/classes/function.py . Solves Issue #5463 (#5474)
+- Improved documentation for all_simple_paths (#5944)
+- Change is_path to return False when node not in G instead of raising exception (#5943)
+- Minor docstring touchups and test refactor for `is_path` (#5967)
+- Update documentation header links for latest pydata-sphinx-theme (#5966)
+- Fix failing example due to mpl 3.6 colorbar. (#5994)
+- Add Tidelift security vulnerability link (#6001)
+- Update linters (#6006)
+
+Improvements
+------------
+
+- [`#5943 <https://github.com/networkx/networkx/pull/5943>`_]
+  ``is_path`` used to raise a `KeyError` when the ``path`` argument contained
+  a node that was not in the Graph. The behavior has been updated so that
+  ``is_path`` returns `False` in this case rather than raising the exception.
+
+Contributors
+------------
+
+- Juanita Gomez
+- Kevin Brown
+- 0ddoes
+- pmlpm1986
+- Dan Schult
+- Jarrod Millman
diff --git a/doc/release/release_2.8.8.rst b/doc/release/release_2.8.8.rst
new file mode 100644
index 00000000..750230fb
--- /dev/null
+++ b/doc/release/release_2.8.8.rst
@@ -0,0 +1,70 @@
+NetworkX 2.8.7
+==============
+
+Release date: 1 November 2022
+
+Supports Python 3.8, 3.9, 3.10, and 3.11.
+
+NetworkX is a Python package for the creation, manipulation, and study of the
+structure, dynamics, and functions of complex networks.
+
+For more information, please visit our `website <https://networkx.org/>`_
+and our :ref:`gallery of examples <examples_gallery>`.
+Please send comments and questions to the `networkx-discuss mailing list
+<http://groups.google.com/group/networkx-discuss>`_.
+
+Highlights
+----------
+
+Minor documentation and bug fixes.
+
+Merged PRs
+----------
+
+- Bump release version
+- Fix warnings from running tests in randomized order (#6014)
+- Update pydata-sphinx-theme (#6012)
+- update secutiry link to tidelift (#6019)
+- Update numpydoc (#6022)
+- Support Python 3.11 (#6023)
+- Update linters (#6024)
+- Minor updates to expanders generator tests (#6027)
+- Add missing asserts to tests (#6039)
+- fixes #6036 (#6080)
+- Improve test coverage expanders line graph generators solved (PR for issue #6034) (#6071)
+- Replace .A call with .toarray for sparse array in example. (#6106)
+- Improve test coverage for algorithms/richclub.py (#6089)
+- Tested boykov_kolmogorov and dinitz with cutoff (#6104)
+- Improve test coverage for multigraph class (#6101)
+- Improve test coverage for algorithms in dominating_set.py (PR for issue 6032) (#6068)
+- Improve test coverage for graph class (#6105)
+- added coverage in generators/tree.py (#6082)
+- DOC: Specifically branch off main, instead of current branch (#6127)
+- Improve test coverage for multidigraph class (#6131)
+- Improve test coverage for digraph class (#6130)
+- Improve test coverage for algorithms in dispersion.py (#6100)
+- Test on Python 3.11 (#6159)
+- Improve test coverage in algorithms shortest paths unweighted.py (#6121)
+- Increased test coverage algorithms/matching.py (#6095)
+- Renamed test functions in test_lowest_common_ancestors (#6110)
+- Increase covering coverage (#6099)
+- Add example for fiedler_vector (#6155)
+- Improve test coverage for cycles.py (#6152)
+- Added an example in all_pairs_node_connectivity  (#6126)
+- Amount of nodes and edges have mistakes when reading adjlist file (#6132)
+- Update pytest (#6165)
+
+Contributors
+------------
+
+- Ross Barnowski
+- Paula Pérez Bianchi
+- DiamondJoseph
+- Jarrod Millman
+- Mjh9122
+- Alimi Qudirah
+- Okite chimaobi Samuel
+- Jefter Santiago
+- Dan Schult
+- Mridul Seth
+- Tindi Sommers