Improve all simple paths multi-target performance (#1520)

* Integrate petgraph's mult-target version of all_simple_paths

* Add release note

* Resolve review comments

Author: lazyhope

Cargo.lock

@@ -0,0 +1,4 @@
+other:
+  - |
+    Avoid unnecessary hashing operations in `rustworkx.all_simple_paths` with
+    multiple targets, improving performance for the use case.

releasenotes/notes/replace-api-for-all-simple-paths-0c44a6c18dbdaaf4.yaml

@@ -1036,19 +1036,17 @@ pub fn graph_all_simple_paths(
             Ok(result)
         }
         TargetNodes::Multiple(target_set) => {
-            let result = connectivity::all_simple_paths_multiple_targets(
-                &graph.graph,
-                from_index,
-                &target_set,
-                min_intermediate_nodes,
-                cutoff_petgraph,
-            );
-
-            Ok(result
-                .into_values()
-                .flatten()
-                .map(|path| path.into_iter().map(|node| node.index()).collect())
-                .collect())
+            let result: Vec<Vec<usize>> =
+                algo::all_simple_paths_multi::<Vec<_>, _, foldhash::fast::RandomState>(
+                    &graph.graph,
+                    from_index,
+                    &target_set,
+                    min_intermediate_nodes,
+                    cutoff_petgraph,
+                )
+                .map(|v: Vec<NodeIndex>| v.into_iter().map(|i| i.index()).collect())
+                .collect();
+            Ok(result)
         }
     }
 }
@@ -1111,19 +1109,17 @@ pub fn digraph_all_simple_paths(
             Ok(result)
         }
         TargetNodes::Multiple(target_set) => {
-            let result = connectivity::all_simple_paths_multiple_targets(
-                &graph.graph,
-                from_index,
-                &target_set,
-                min_intermediate_nodes,
-                cutoff_petgraph,
-            );
-
-            Ok(result
-                .into_values()
-                .flatten()
-                .map(|path| path.into_iter().map(|node| node.index()).collect())
-                .collect())
+            let result: Vec<Vec<usize>> =
+                algo::all_simple_paths_multi::<Vec<_>, _, foldhash::fast::RandomState>(
+                    &graph.graph,
+                    from_index,
+                    &target_set,
+                    min_intermediate_nodes,
+                    cutoff_petgraph,
+                )
+                .map(|v: Vec<NodeIndex>| v.into_iter().map(|i| i.index()).collect())
+                .collect();
+            Ok(result)
         }
     }
 }