feat: Added single_source_all_shortest_paths (Qiskit#1458)

* feat: Added single_source_all_shortest_paths

* modified rust and python wrapper to handle extra tests

* ran cargo clippy

* re-ran cargo fmt

* precompute edge weight and use fixedbitset for collect_paths

* modify edge_cost_fn to take EdgeIndex

Author: gluonhiggs

docs/source/api/algorithm_functions/shortest_paths.rst

@@ -26,3 +26,4 @@ Shortest Paths
    rustworkx.unweighted_average_shortest_path_length
    rustworkx.all_shortest_paths
    rustworkx.digraph_all_shortest_paths
+   rustworkx.single_source_all_shortest_paths

docs/source/api/pydigraph_api_functions.rst

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

docs/source/api/pygraph_api_functions.rst

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

releasenotes/notes/single_source_all_shortest_paths-cd23a45f973a5aba.yaml

@@ -0,0 +1,5 @@
+features:
+  - |
+      Added `single_source_all_shortest_paths` function to compute all shortest paths from a source node to all other nodes using Dijkstra's algorithm.
+      This function supports both PyGraph and PyDiGraph, with an option to treat directed graphs as undirected.
+      See the documentation for usage and performance warnings.

rustworkx-core/src/shortest_path/mod.rs

@@ -20,9 +20,11 @@ mod astar;
 mod bellman_ford;
 mod dijkstra;
 mod k_shortest_path;
+mod single_source_all_shortest_paths;
 
 pub use all_shortest_paths::all_shortest_paths;
 pub use astar::astar;
 pub use bellman_ford::{bellman_ford, negative_cycle_finder};
 pub use dijkstra::dijkstra;
 pub use k_shortest_path::k_shortest_path;
+pub use single_source_all_shortest_paths::single_source_all_shortest_paths;