perf: use absl::chunked_queue instead of deque

Author: omicsnut

src/lancet/cbdg/graph.cpp

@@ -2,7 +2,6 @@
 
 #include <algorithm>
 #include <cmath>
-#include <deque>
 #include <filesystem>
 #include <fstream>
 #include <ios>
@@ -14,6 +13,7 @@
 #include <utility>
 #include <vector>
 
+#include "absl/container/chunked_queue.h"
 #include "absl/container/flat_hash_set.h"
 #include "absl/strings/string_view.h"
 #include "absl/types/span.h"
@@ -457,7 +457,7 @@ auto Graph::MarkConnectedComponents() -> std::vector<ComponentInfo> {
     current_component++;
     results_info.emplace_back(ComponentInfo{.mCompId = current_component, .mNumNodes = 0});
 
-    std::deque<Node*> connected_nodes;
+    absl::chunked_queue<Node*, 128, 1024> connected_nodes;
     connected_nodes.push_back(item.second.get());
 
     while (!connected_nodes.empty()) {

src/lancet/cbdg/max_flow.h

@@ -1,11 +1,11 @@
 #ifndef SRC_LANCET_CBDG_MAX_FLOW_H_
 #define SRC_LANCET_CBDG_MAX_FLOW_H_
 
-#include <deque>
 #include <optional>
 #include <string>
 #include <vector>
 
+#include "absl/container/chunked_queue.h"
 #include "absl/container/flat_hash_set.h"
 #include "absl/container/inlined_vector.h"
 #include "absl/types/span.h"
@@ -36,7 +36,7 @@ class MaxFlow {
 
   using Walk = std::vector<Edge>;
   using WalkView = absl::Span<const Edge>;
-  using CandidateWalks = std::deque<Walk>;
+  using CandidateWalks = absl::chunked_queue<Walk, 128, 1024>;
 
   [[nodiscard]] auto BuildNextWalk() -> std::optional<Walk>;