loot/libloot
0
0
Fork 0
mirror of https://github.com/loot/libloot.git synced 2026-07-27 14:16:01 -07:00
Code Issues Packages Projects Releases Wiki Activity

Use boost::unordered_flat_set to hold visited vertices in FindPath()

Browse Source 
This improves sorting performance by 40%.
This commit is contained in:
Oliver Hamlet
2025-01-17 20:18:34 +00:00
parent ead4f21250
commit bc8701a7ba
1 changed files with 3 additions and 2 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/api/sorting/plugin_graph.cpp
+3 -2
View File
@@ -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);