try sorting steps

vgteam · Jun 5, 2024 · 8c30879 · 8c30879 · adamnovak · Jun 5, 2024
1 parent dcf4d23
commit 8c30879
Showing 1 changed file with 2 additions and 0 deletions.
diff --git a/src/traversal_finder.cpp b/src/traversal_finder.cpp
@@ -887,6 +887,8 @@ pair<vector<SnarlTraversal>, vector<PathInterval>> PathTraversalFinder::find_pat
 pair<vector<Traversal>, vector<PathInterval>> PathTraversalFinder::find_path_traversals(const handle_t& snarl_start, const handle_t& snarl_end) {
 
     vector<step_handle_t> start_steps = graph.steps_of_handle(snarl_start);
+    // try to make this stable across different systems
+    std::sort(start_steps.begin(), start_steps.end());
     vector<step_handle_t> end_steps = graph.steps_of_handle(snarl_end);
 
     // use this to skip paths that don't reach the end node