Adding code for finding k shortest paths in a graph. This implements Yen's algorithm to find the k paths in time O(kn^3).

Author: nitsatiisc

rustworkx-core/src/shortest_path/mod.rs

@@ -20,6 +20,7 @@ mod astar;
 mod bellman_ford;
 mod dijkstra;
 mod k_shortest_path;
+mod simple_shortest_paths;
 
 pub use all_shortest_paths::all_shortest_paths;
 pub use astar::astar;