diff --git a/.mailmap b/.mailmap new file mode 100644 index 000000000..fde9630de --- /dev/null +++ b/.mailmap @@ -0,0 +1,20 @@ +# Entries in this file are made for two reasons: +# 1) to merge multiple git commit authors that correspond to a single author +# 2) to change the canonical name and/or email address of an author. +# +# Format is: +# Canonical Name commit name +# \--------------+---------------/ \----------+-------------/ +# replace find +# See also: 'git shortlog --help' and 'git check-mailmap --help'. +# +# If you don't like the way your name is cited by qiskit, please feel free to +# open a pull request against this file to set your preferred naming. +# +# Note that each qiskit element uses its own mailmap so it may be necessary to +# propagate changes in other repos for consistency. +# + +Ivan Carvalho +Ivan Carvalho +Ivan Carvalho <8753214+IvanIsCoding@users.noreply.github.com> diff --git a/releasenotes/notes/0.11/add-cartesian-product-f57b4aeb8cbebee7.yaml b/releasenotes/notes/0.11/add-cartesian-product-f57b4aeb8cbebee7.yaml new file mode 100644 index 000000000..d04d88e49 --- /dev/null +++ b/releasenotes/notes/0.11/add-cartesian-product-f57b4aeb8cbebee7.yaml @@ -0,0 +1,19 @@ +--- +features: + - | + Added a new function, :func:`~retworkx.cartesian_product` (and its per + type variants :func:`~retworkx.digraph_cartesian_product` and + :func:`~retworkx.graph_cartesian_product`), which calculates the Cartesian + product of two graphs. For example: + + .. jupyter-execute:: + + import retworkx + from retworkx.visualization import mpl_draw + + graph_1 = retworkx.generators.path_graph(2) + graph_2 = retworkx.generators.path_graph(3) + + graph_product, _ = retworkx.cartesian_product(graph_1, graph_2) + + mpl_draw(graph_product) diff --git a/releasenotes/notes/add-node-indices-3c7c37ed4ea75a2c.yaml b/releasenotes/notes/0.11/add-node-indices-3c7c37ed4ea75a2c.yaml similarity index 87% rename from releasenotes/notes/add-node-indices-3c7c37ed4ea75a2c.yaml rename to releasenotes/notes/0.11/add-node-indices-3c7c37ed4ea75a2c.yaml index b25d54af3..94374368e 100644 --- a/releasenotes/notes/add-node-indices-3c7c37ed4ea75a2c.yaml +++ b/releasenotes/notes/0.11/add-node-indices-3c7c37ed4ea75a2c.yaml @@ -2,7 +2,7 @@ features: - | Added a new method, :meth:`~retworkx.PyDiGraph.node_indices`, to the - :class:`~retworkx.PyDigraph` and :class:`~retworkx.PyGraph` classes. + :class:`~retworkx.PyDiGraph` and :class:`~retworkx.PyGraph` classes. This method is identical to the previously existing :meth:`~retworkx.PyDiGraph.node_indexes` method but changes the name to be consistent with the use of "indices" throughout the rest of diff --git a/releasenotes/notes/0.11/average-path-length-disconnected-56b118a964af085a.yaml b/releasenotes/notes/0.11/average-path-length-disconnected-56b118a964af085a.yaml new file mode 100644 index 000000000..76ec2c3eb --- /dev/null +++ b/releasenotes/notes/0.11/average-path-length-disconnected-56b118a964af085a.yaml @@ -0,0 +1,28 @@ +--- +features: + - | + The :func:`~retworkx.unweighted_average_shortest_path_length` function + has a new kwarg ``disconnected``. When ``disconnected`` is set to ``True`` + the output value calculated by the function will only account for connected + node pairs. +upgrade: + - | + The default behavior for how the + :func:`~retworkx.unweighted_average_shortest_path_length` function handles + disconnected graphs has been changed. Previously, disconnected pairs of nodes + was assumed to have zero distance which is arguably incorrect/unexpected + behavior. To make this more consistent with user expectations this has been + changed to an infinite value. In addition, an extra kwarg ``disconnected`` + was added where, if set to ``True``, the average is taken only over connected + node pairs. By default, it's set to ``False``. If the previous behavior of + treating disconnected pairs of nodes as having a distance of zero is desired, + it can be reproduced using the rest of retworkx API like: + + .. code-block:: python + + import retworkx + + graph = retworkx.undirected_gnm_random_graph(20, 10, seed=42) + n = len(graph) + d_mat = retworkx.distance_matrix(graph, null_value=0.0) + avg_shortest_path = d_mat.sum() / (n * (n - 1.0)) diff --git a/releasenotes/notes/0.11/barbell-graph-generator-5cc9df7148b1a09e.yaml b/releasenotes/notes/0.11/barbell-graph-generator-5cc9df7148b1a09e.yaml new file mode 100644 index 000000000..02e31108a --- /dev/null +++ b/releasenotes/notes/0.11/barbell-graph-generator-5cc9df7148b1a09e.yaml @@ -0,0 +1,14 @@ +--- +features: + - | + Added a new generator function, :func:`~retworkx.generators.barbell_graph`, + to the ``retworkx.generators`` module that will generate a barbell graph. + For example: + + .. jupyter-execute:: + + import retworkx.generators + from retworkx.visualization import mpl_draw + + graph = retworkx.generators.barbell_graph(4, 3) + mpl_draw(graph) diff --git a/releasenotes/notes/bfs-search-da8ba99e8ecdd7ba.yaml b/releasenotes/notes/0.11/bfs-search-da8ba99e8ecdd7ba.yaml similarity index 100% rename from releasenotes/notes/bfs-search-da8ba99e8ecdd7ba.yaml rename to releasenotes/notes/0.11/bfs-search-da8ba99e8ecdd7ba.yaml diff --git a/releasenotes/notes/biconnected-28c23631a466ec09.yaml b/releasenotes/notes/0.11/biconnected-28c23631a466ec09.yaml similarity index 100% rename from releasenotes/notes/biconnected-28c23631a466ec09.yaml rename to releasenotes/notes/0.11/biconnected-28c23631a466ec09.yaml diff --git a/releasenotes/notes/binomial-tree-alloc-fix-c24c8c4f3c27d489.yaml b/releasenotes/notes/0.11/binomial-tree-alloc-fix-c24c8c4f3c27d489.yaml similarity index 100% rename from releasenotes/notes/binomial-tree-alloc-fix-c24c8c4f3c27d489.yaml rename to releasenotes/notes/0.11/binomial-tree-alloc-fix-c24c8c4f3c27d489.yaml diff --git a/releasenotes/notes/0.11/bugfix-node-holes-210d1b4d329df6dc.yaml b/releasenotes/notes/0.11/bugfix-node-holes-210d1b4d329df6dc.yaml new file mode 100644 index 000000000..a0fe4b7de --- /dev/null +++ b/releasenotes/notes/0.11/bugfix-node-holes-210d1b4d329df6dc.yaml @@ -0,0 +1,6 @@ +--- +fixes: + - | + Fixed an issue where :func:`~retworkx.distance_matrix` and + :func:`~retworkx.k_shortest_path_lengths` would previously panic if the + input graph contains holes in the node indices. diff --git a/releasenotes/notes/chain-decomposition-3fdf4b283b5b9ad1.yaml b/releasenotes/notes/0.11/chain-decomposition-3fdf4b283b5b9ad1.yaml similarity index 100% rename from releasenotes/notes/chain-decomposition-3fdf4b283b5b9ad1.yaml rename to releasenotes/notes/0.11/chain-decomposition-3fdf4b283b5b9ad1.yaml diff --git a/releasenotes/notes/complex-adj-matrix-41897bc8f134d971.yaml b/releasenotes/notes/0.11/complex-adj-matrix-41897bc8f134d971.yaml similarity index 100% rename from releasenotes/notes/complex-adj-matrix-41897bc8f134d971.yaml rename to releasenotes/notes/0.11/complex-adj-matrix-41897bc8f134d971.yaml diff --git a/releasenotes/notes/connected-components-undirected-graphs-d81d3fb8c844ef83.yaml b/releasenotes/notes/0.11/connected-components-undirected-graphs-d81d3fb8c844ef83.yaml similarity index 100% rename from releasenotes/notes/connected-components-undirected-graphs-d81d3fb8c844ef83.yaml rename to releasenotes/notes/0.11/connected-components-undirected-graphs-d81d3fb8c844ef83.yaml diff --git a/releasenotes/notes/contract-nodes-6ef30bb227fab68d.yaml b/releasenotes/notes/0.11/contract-nodes-6ef30bb227fab68d.yaml similarity index 94% rename from releasenotes/notes/contract-nodes-6ef30bb227fab68d.yaml rename to releasenotes/notes/0.11/contract-nodes-6ef30bb227fab68d.yaml index 40d67a0dd..0334054f7 100644 --- a/releasenotes/notes/contract-nodes-6ef30bb227fab68d.yaml +++ b/releasenotes/notes/0.11/contract-nodes-6ef30bb227fab68d.yaml @@ -1,7 +1,7 @@ --- features: - | - New graph class methods :meth:`retworkx.PyDiGraph.contract_nodes`, + Added new graph methods :meth:`retworkx.PyDiGraph.contract_nodes`, and :meth:`retworkx.PyGraph.contract_nodes`. These methods can be used to replace a set of graph nodes with a single new equivalent node. Incoming edges and outgoing edges of and to the diff --git a/releasenotes/notes/dfs-search-6083680bf62356b0.yaml b/releasenotes/notes/0.11/dfs-search-6083680bf62356b0.yaml similarity index 100% rename from releasenotes/notes/dfs-search-6083680bf62356b0.yaml rename to releasenotes/notes/0.11/dfs-search-6083680bf62356b0.yaml diff --git a/releasenotes/notes/dijkstra-search-2d1899241f5166ea.yaml b/releasenotes/notes/0.11/dijkstra-search-2d1899241f5166ea.yaml similarity index 100% rename from releasenotes/notes/dijkstra-search-2d1899241f5166ea.yaml rename to releasenotes/notes/0.11/dijkstra-search-2d1899241f5166ea.yaml diff --git a/releasenotes/notes/edge-index-methods-427f7301c720f565.yaml b/releasenotes/notes/0.11/edge-index-methods-427f7301c720f565.yaml similarity index 84% rename from releasenotes/notes/edge-index-methods-427f7301c720f565.yaml rename to releasenotes/notes/0.11/edge-index-methods-427f7301c720f565.yaml index ce28ea80b..81f208a95 100644 --- a/releasenotes/notes/edge-index-methods-427f7301c720f565.yaml +++ b/releasenotes/notes/0.11/edge-index-methods-427f7301c720f565.yaml @@ -29,8 +29,8 @@ features: its index. - | Added two new methods, :meth:`~retworkx.PyGraph.out_edges` and - :meth:`~retworkx.PyGraph.in_edges`. These methods are the dual of the - :class:`~retworkx.PyDiGraph` methods, :meth:`~retworkx.PyDiGraph.out_edges` - and :meth:`~retworkx.PyDiGraph.in_edges` and return a + :meth:`~retworkx.PyGraph.in_edges` to the :class:`~retworkx.PyGraph` class. + These methods are the duals of the :class:`~retworkx.PyDiGraph` methods, + :meth:`~retworkx.PyDiGraph.out_edges` and + :meth:`~retworkx.PyDiGraph.in_edges` and return a :class:`~retworkx.WeightedEdgeList` of the incident edges for a node. - diff --git a/releasenotes/notes/0.11/faster-steiner-tree-0066d7cd2df1b28d.yaml b/releasenotes/notes/0.11/faster-steiner-tree-0066d7cd2df1b28d.yaml new file mode 100644 index 000000000..e0c2ecd51 --- /dev/null +++ b/releasenotes/notes/0.11/faster-steiner-tree-0066d7cd2df1b28d.yaml @@ -0,0 +1,8 @@ +--- +features: + - | + The algorithm used for the :func:`~retworkx.steiner_tree` implementation + has been replaced by a faster algorithm based on: + https://doi.org/10.1016/0020-0190(88)90066-X. This new implementation + achieves the same approximation ratio as the algorithm used previously, + so there should be no change in functionality. diff --git a/releasenotes/notes/0.11/fix-degree-with-self-loops-5b40c45cc61fcebe.yaml b/releasenotes/notes/0.11/fix-degree-with-self-loops-5b40c45cc61fcebe.yaml new file mode 100644 index 000000000..db4d3e2f7 --- /dev/null +++ b/releasenotes/notes/0.11/fix-degree-with-self-loops-5b40c45cc61fcebe.yaml @@ -0,0 +1,7 @@ +--- +fixes: + - | + Fixed the :meth:`retworkx.PyGraph.degree` method when running on a node + that has self-loops. Previously, the method would increment the node's + degree of a self-loop by one instead of two. + Fixed `#517 `__. diff --git a/releasenotes/notes/0.11/fix-dispatch-3596ef110cc68338.yaml b/releasenotes/notes/0.11/fix-dispatch-3596ef110cc68338.yaml new file mode 100644 index 000000000..48ee89b08 --- /dev/null +++ b/releasenotes/notes/0.11/fix-dispatch-3596ef110cc68338.yaml @@ -0,0 +1,11 @@ +--- +fixes: + - | + Fixed the :func:`~retworkx.dfs_edges` function to have the ``source`` + argument default to ``None`` as was documented. Previously, the ``source`` + argument was incorrectly required and had no default value. + Fixed `#515 `__. + - | + Fixed an oversight in the :func:`~retworkx.union` function where + user-defined values for the ``merge_nodes`` and ``merge_edges`` arguments + were being ingored. diff --git a/releasenotes/notes/full-rary-tree-generator-4c533fd73dbd3e48.yaml b/releasenotes/notes/0.11/full-rary-tree-generator-4c533fd73dbd3e48.yaml similarity index 77% rename from releasenotes/notes/full-rary-tree-generator-4c533fd73dbd3e48.yaml rename to releasenotes/notes/0.11/full-rary-tree-generator-4c533fd73dbd3e48.yaml index 286e6a389..020d7cedd 100644 --- a/releasenotes/notes/full-rary-tree-generator-4c533fd73dbd3e48.yaml +++ b/releasenotes/notes/0.11/full-rary-tree-generator-4c533fd73dbd3e48.yaml @@ -2,7 +2,7 @@ features: - | Added a new function, :func:`~retworkx.generators.full_rary_tree` that adds - support for generating a full r-ary tree of n nodes. For example: + support for generating a full :math:`r`\ -ary tree of :math:`n` nodes. For example: .. jupyter-execute:: diff --git a/releasenotes/notes/lollipop-graph-generator-4203007331f63e9e.yaml b/releasenotes/notes/0.11/lollipop-graph-generator-4203007331f63e9e.yaml similarity index 100% rename from releasenotes/notes/lollipop-graph-generator-4203007331f63e9e.yaml rename to releasenotes/notes/0.11/lollipop-graph-generator-4203007331f63e9e.yaml diff --git a/releasenotes/notes/0.11/negative-weights-in-shortest-path-algos-b205b63bd12d1a26.yaml b/releasenotes/notes/0.11/negative-weights-in-shortest-path-algos-b205b63bd12d1a26.yaml new file mode 100644 index 000000000..d6d413891 --- /dev/null +++ b/releasenotes/notes/0.11/negative-weights-in-shortest-path-algos-b205b63bd12d1a26.yaml @@ -0,0 +1,12 @@ +--- +fixes: + - | + Fixed an oversight in shortest path algorithms functions, such as: + :func:`~retworkx.dijkstra_shortest_paths`, + :func:`~retworkx.dijkstra_shortest_path_lengths`, + :func:`~retworkx.all_pairs_dijkstra_path_lengths`, + :func:`~retworkx.all_pairs_dijkstra_shortest_paths`, + :func:`~retworkx.astar_shortest_path`, and + :func:`~retworkx.k_shortest_path_lengths` which would previously incorrectly + accept edge weights with negative or ``NaN`` values. + Fixed `#525 `__. diff --git a/releasenotes/notes/no-more-pydot-d57c3b0e7456e3d4.yaml b/releasenotes/notes/0.11/no-more-pydot-d57c3b0e7456e3d4.yaml similarity index 100% rename from releasenotes/notes/no-more-pydot-d57c3b0e7456e3d4.yaml rename to releasenotes/notes/0.11/no-more-pydot-d57c3b0e7456e3d4.yaml diff --git a/releasenotes/notes/online-topo-sort-f94bcd2064a5cde7.yaml b/releasenotes/notes/0.11/online-topo-sort-f94bcd2064a5cde7.yaml similarity index 100% rename from releasenotes/notes/online-topo-sort-f94bcd2064a5cde7.yaml rename to releasenotes/notes/0.11/online-topo-sort-f94bcd2064a5cde7.yaml diff --git a/releasenotes/notes/parallel-betweenness-033423569770dc53.yaml b/releasenotes/notes/0.11/parallel-betweenness-033423569770dc53.yaml similarity index 100% rename from releasenotes/notes/parallel-betweenness-033423569770dc53.yaml rename to releasenotes/notes/0.11/parallel-betweenness-033423569770dc53.yaml diff --git a/releasenotes/notes/petersen-graph-7ebe5d3b4cc0c946.yaml b/releasenotes/notes/0.11/petersen-graph-7ebe5d3b4cc0c946.yaml similarity index 100% rename from releasenotes/notes/petersen-graph-7ebe5d3b4cc0c946.yaml rename to releasenotes/notes/0.11/petersen-graph-7ebe5d3b4cc0c946.yaml diff --git a/releasenotes/notes/0.11/prepare-0.11-af688e532712c830.yaml b/releasenotes/notes/0.11/prepare-0.11-af688e532712c830.yaml new file mode 100644 index 000000000..590caec6b --- /dev/null +++ b/releasenotes/notes/0.11/prepare-0.11-af688e532712c830.yaml @@ -0,0 +1,69 @@ +--- +prelude: | + This release includes many new features and bug fixes. Highlights include + additional methods to improve working with edges in both + :class:`~retworkx.PyGraph` and :class:`~retworkx.PyDiGraph`, + several new graph generators, and a new set of interactive traversal + functions: :func:`~retworkx.bfs_search`, :func:`~retworkx.dfs_search`, + :func:`~retworkx.dijkstra_search`, and :class:`~retworkx.TopologicalSorter`, + which enable iterative interaction with the graph during different types + of traversal. + + This release also introduces a new separate Rust crate + `retworkx-core `__ which + is a library for use in Rust that's built on top of + `petgraph `__ that extends the + functionality provided by petgraph. The functionality in this crate is generic + and can work with any petgraph graph, not just the :class:`~retworkx.PyGraph` + amd :class:`~retworkx.PyDiGraph`. + + The 0.11.0 release fully supports Python 3.10. Precompiled binaries + for Python 3.10 are published on PyPI (previous releases worked with 3.10 but + required compiling from source to install). This is also the last release to + support Python 3.6. Starting in retworkx 0.12.0, Python >=3.7 will be required + to run retworkx. Additionally, for users compiling retworkx from source, this + will be the last release with a minimum supported Rust version (MSRV) of 1.41. + In retworkx 0.12.0, the MSRV will be increased to 1.48. + +features: + - | + Added a new workspace crate, + `retworkx-core `__ as part of + retworkx. This is a standalone Rust library that is built on top of + petgraph that provides general algorithms and graph functionality that + retworkx needs. This new crate only exposes a Rust interface that is + general for any petgraph graph and can be used by any downstream Rust + project that wants the extra functionality that retworkx exposes, but + without Python. + + It's also worth noting as this is the first release of ``retworkx-core`` + there may be breaking API changes in a subsequent release. While we will + attempt to follow the standard deprecation and stability policy, since + we're not necessarily fully committed to the current API and without having + a user outside of retworkx, there may be gaps or issues which require + breaking changes. + - | + A new kwarg, ``keep_attributes``, has been added to the NetworkX graph + converter function :func:`~retworkx.networkx_converter`. When this argument + is set to ``True`` the node attributes from the input NetworkX graph will + be preserved. The data payload for the output retworkx graph will be + a dictionary containing the attributes, with an extra ``"__networkx_node__"`` key + containing the node from NetworkX. For example:: + + import networkx as nx + import retworkx as rx + + g = nx.Graph() + g.add_nodes_from([ + ("A", {"color": "turquoise", "size": "extra large"}), + ("B", {"color": "fuschia", "size": "tiny"}), + ]) + g.add_edge("A", "B") + rx_graph = rx.networkx_converter(g, keep_attributes=True) + print(rx_graph.nodes()) + print(rx_graph.weighted_edge_list()) + + will output:: + + [{'color': 'turquoise', 'size': 'extra large', '__networkx_node__': 'A'}, {'color': 'fuschia', 'size': 'tiny', '__networkx_node__': 'B'}] + WeightedEdgeList[(0, 1, {})] diff --git a/releasenotes/notes/add-cartesian-product-f57b4aeb8cbebee7.yaml b/releasenotes/notes/add-cartesian-product-f57b4aeb8cbebee7.yaml deleted file mode 100644 index 6cffbb3be..000000000 --- a/releasenotes/notes/add-cartesian-product-f57b4aeb8cbebee7.yaml +++ /dev/null @@ -1,17 +0,0 @@ ---- -features: - - | - Add two new functions which calculates the cartesian product of two graphs :func:`~retworkx.graph_cartesian_product` - for undirected graphs and :func:`~retworkx.digraph_cartesian_product` for directed graphs. For example: - - .. jupyter-execute:: - - import retworkx - from retworkx.visualization import mpl_draw - - graph_1 = retworkx.generators.path_graph(2) - graph_2 = retworkx.generators.path_graph(3) - - graph_product, _ = retworkx.graph_cartesian_product(graph_1, graph_2) - - mpl_draw(graph_product) diff --git a/releasenotes/notes/average-path-length-disconnected-56b118a964af085a.yaml b/releasenotes/notes/average-path-length-disconnected-56b118a964af085a.yaml deleted file mode 100644 index 4409b8529..000000000 --- a/releasenotes/notes/average-path-length-disconnected-56b118a964af085a.yaml +++ /dev/null @@ -1,19 +0,0 @@ ---- -upgrade: - - | - Updates the way :func:`~unweighted_average_shortest_path_length` handles - disconnected graphs. Previously, disconnected pairs of nodes was assumed - to have zero distance and this has been changed to an infinite value. - In addition, an extra kwarg ``disconnected`` was added where, if set to - ``True``, the average is taken only over connected node pairs. By default, - it's set to ``False``. If the old behavior is desired, it can be reproduced - using the rest of retworkx API like: - - .. code-block:: python - - import retworkx - - graph = retworkx.undirected_gnm_random_graph(20, 10, seed=42) - n = len(graph) - d_mat = retworkx.distance_matrix(graph, null_value=0.0) - avg_shortest_path = d_mat.sum() / (n * (n - 1.0)) diff --git a/releasenotes/notes/barbell-graph-generator-5cc9df7148b1a09e.yaml b/releasenotes/notes/barbell-graph-generator-5cc9df7148b1a09e.yaml deleted file mode 100644 index 4c4638fa9..000000000 --- a/releasenotes/notes/barbell-graph-generator-5cc9df7148b1a09e.yaml +++ /dev/null @@ -1,11 +0,0 @@ ---- -features: - - | - Added a new function, :func:`~retworkx.generators.barbell_graph` that adds - support for generating lollipop graphs. For example:: - - import retworkx.generators - from retworkx.visualization import mpl_draw() - - graph = retworkx.generators.barbell_graph(4, 3) - mpl_draw(graph) diff --git a/releasenotes/notes/bugfix-node-holes-210d1b4d329df6dc.yaml b/releasenotes/notes/bugfix-node-holes-210d1b4d329df6dc.yaml deleted file mode 100644 index 0aa082526..000000000 --- a/releasenotes/notes/bugfix-node-holes-210d1b4d329df6dc.yaml +++ /dev/null @@ -1,6 +0,0 @@ ---- -fixes: - - | - Fixes a bug where :func:`~retworkx.distance_matrix` and - :func:`~retworkx.k_shortest_path` would panic if the input graph - contains holes in node indices. diff --git a/releasenotes/notes/faster-steiner-tree-0066d7cd2df1b28d.yaml b/releasenotes/notes/faster-steiner-tree-0066d7cd2df1b28d.yaml deleted file mode 100644 index 88c2a5f2e..000000000 --- a/releasenotes/notes/faster-steiner-tree-0066d7cd2df1b28d.yaml +++ /dev/null @@ -1,6 +0,0 @@ ---- -features: - - | - Implements a faster algorithm that achieves the same approximation - ratio for the :func:`~retworkx.steiner_tree` problem based on - https://doi.org/10.1016/0020-0190(88)90066-X diff --git a/releasenotes/notes/fix-degree-with-self-loops-5b40c45cc61fcebe.yaml b/releasenotes/notes/fix-degree-with-self-loops-5b40c45cc61fcebe.yaml deleted file mode 100644 index 8be225513..000000000 --- a/releasenotes/notes/fix-degree-with-self-loops-5b40c45cc61fcebe.yaml +++ /dev/null @@ -1,6 +0,0 @@ ---- -fixes: - - | - Fixes :meth:`~retworkx.PyGraph.degree` where self-loops should increment - by two (and not by one) the degree of a node in a :class:`~retworkx.PyGraph` - object. diff --git a/releasenotes/notes/fix-dispatch-3596ef110cc68338.yaml b/releasenotes/notes/fix-dispatch-3596ef110cc68338.yaml deleted file mode 100644 index c261e7768..000000000 --- a/releasenotes/notes/fix-dispatch-3596ef110cc68338.yaml +++ /dev/null @@ -1,8 +0,0 @@ ---- -fixes: - - | - Updates :func:`~retworkx.dfs_edges` to set `source` argument to `None` - by default, as already stated in the documentation. - - | - Fixes an oversight in :func:`~retworkx.union` where user-defined values - of `merge_nodes` and `merge_edges` arguments were being ingored. diff --git a/releasenotes/notes/negative-weights-in-shortest-path-algos-b205b63bd12d1a26.yaml b/releasenotes/notes/negative-weights-in-shortest-path-algos-b205b63bd12d1a26.yaml deleted file mode 100644 index b9e5ad51f..000000000 --- a/releasenotes/notes/negative-weights-in-shortest-path-algos-b205b63bd12d1a26.yaml +++ /dev/null @@ -1,11 +0,0 @@ ---- -fixes: - - | - Fixes an oversight in shortest path algorithms like: - :func:`~retworkx.dijkstra_shortest_paths`, - :func:`~retworkx.dijkstra_shortest_path_lengths`, - :func:`~retworkx.all_pairs_dijkstra_path_lengths`, - :func:`~retworkx.all_pairs_dijkstra_shortest_paths`, - :func:`~retworkx.astar_shortest_path`, - :func:`~retworkx.k_shortest_path_lengths`, that would previously - accept edge weights with negative or NaN values.