From bc8701a7ba3e105b5a90591f1c51627c0dd0e09e Mon Sep 17 00:00:00 2001
From: Oliver Hamlet <git@ortham.net>
Date: Fri, 17 Jan 2025 17:48:19 +0000
Subject: [PATCH] Use boost::unordered_flat_set to hold visited vertices in
 FindPath()

This improves sorting performance by 40%.
---
 src/api/sorting/plugin_graph.cpp | 5 +++--
 1 file changed, 3 insertions(+), 2 deletions(-)

diff --git a/src/api/sorting/plugin_graph.cpp b/src/api/sorting/plugin_graph.cpp
index 1c5452b8..12b44165 100644
--- a/src/api/sorting/plugin_graph.cpp
+++ b/src/api/sorting/plugin_graph.cpp
@@ -28,6 +28,7 @@
 #include <boost/graph/breadth_first_search.hpp>
 #include <boost/graph/iteration_macros.hpp>
 #include <boost/graph/topological_sort.hpp>
+#include <boost/unordered/unordered_flat_set.hpp>
 #include <queue>
 
 #include "api/helpers/logging.h"
@@ -476,8 +477,8 @@ bool FindPath(RawPluginGraph& graph,
               BidirVisitor& visitor) {
   std::queue<vertex_t> forwardQueue;
   std::queue<vertex_t> reverseQueue;
-  std::unordered_set<vertex_t> forwardVisited;
-  std::unordered_set<vertex_t> reverseVisited;
+  boost::unordered_flat_set<vertex_t> forwardVisited;
+  boost::unordered_flat_set<vertex_t> reverseVisited;
 
   forwardQueue.push(fromVertex);
   forwardVisited.insert(fromVertex);