Prepare 0.14.0 release (#1065)

* Prepare 0.14.0 release

This commit prepares the 0.14.0 release. It moves the release notes for
the release into a separate directory and adds a prelude to the release
notes. This should be the last commit to merge for the 0.14.0 release
and after it merges that commit will be what is should be tagged as the
0.14.0 release.

As part of this there are few small changes other changes being made.
The release notes are update to have consistent formatting and wording,
a missing universal function for `all_shortest_paths` is added, missing
doc toctree entries are added, and the ahash version in the lock file is
downgraded to 0.8.6 as 0.8.7 has an undocumented MSRV on Rust 1.72 when
building for aarch64 CPU architectures which is incompatible with
rustworkx's documented MSRV.

* Move new release notes

* New release note fixes

Author: mtreinish

Cargo.lock

@@ -24,7 +24,7 @@ repository = "https://github.com/Qiskit/rustworkx"
 license = "Apache-2.0"
 
 [workspace.dependencies]
-ahash = "0.8.7"
+ahash = "0.8.6"
 fixedbitset = "0.4.2"
 hashbrown = { version = ">=0.13, <0.15", features = ["rayon"] }
 indexmap = { version = ">=1.9, <3", features = ["rayon"] }

Cargo.toml

@@ -10,3 +10,4 @@ Coloring
    rustworkx.graph_bipartite_edge_color
    rustworkx.graph_greedy_edge_color
    rustworkx.graph_misra_gries_edge_color
+   rustworkx.two_color

docs/source/api/algorithm_functions/coloring.rst

@@ -25,3 +25,6 @@ Connectivity and Cycles
    rustworkx.all_pairs_all_simple_paths
    rustworkx.stoer_wagner_min_cut
    rustworkx.longest_simple_path
+   rustworkx.is_bipartite
+   rustworkx.isolates
+   rustworkx.has_path

docs/source/api/algorithm_functions/connectivity_and_cycles.rst

@@ -12,4 +12,5 @@ DAG Algorithms
    rustworkx.dag_weighted_longest_path_length
    rustworkx.is_directed_acyclic_graph
    rustworkx.layers
-   rustworkx.transitive_reduction
+   rustworkx.transitive_reduction
+   rustworkx.topological_generations

docs/source/api/algorithm_functions/dag_algorithms.rst

@@ -24,3 +24,5 @@ Shortest Paths
    rustworkx.k_shortest_path_lengths
    rustworkx.num_shortest_paths_unweighted
    rustworkx.unweighted_average_shortest_path_length
+   rustworkx.all_shortest_paths
+   rustworkx.digraph_all_shortest_paths

docs/source/api/algorithm_functions/shortest_paths.rst

@@ -15,3 +15,5 @@ Exceptions
    rustworkx.visit.StopSearch
    rustworkx.visit.PruneSearch
    rustworkx.JSONSerializationError
+   rustworkx.InvalidMapping
+   rustworkx.GraphNotBipartite

docs/source/api/exceptions.rst

@@ -31,6 +31,7 @@ the functions from the explicitly typed based on the data type.
    rustworkx.digraph_all_pairs_bellman_ford_shortest_paths
    rustworkx.digraph_all_pairs_bellman_ford_path_lengths
    rustworkx.digraph_k_shortest_path_lengths
+   rustworkx.digraph_all_shortest_paths
    rustworkx.digraph_dfs_edges
    rustworkx.digraph_dfs_search
    rustworkx.digraph_find_cycle

docs/source/api/pydigraph_api_functions.rst

@@ -31,6 +31,7 @@ typed API based on the data type.
    rustworkx.graph_bellman_ford_shortest_path_lengths
    rustworkx.graph_all_pairs_bellman_ford_shortest_paths
    rustworkx.graph_all_pairs_bellman_ford_path_lengths
+   rustworkx.graph_all_shortest_paths
    rustworkx.graph_dfs_edges
    rustworkx.graph_dfs_search
    rustworkx.graph_transitivity