stack, queue -> big_stack, big_queue

Author: adamant-pwn

cp-algo/graph/dfs.hpp

@@ -46,7 +46,7 @@ namespace cp_algo::graph {
             enum { INIT, PROCESS_EDGES, HANDLE_CHILD } state;
         };
 
-        std::stack<frame> dfs_stack;
+        big_stack<frame> dfs_stack;
 
         for (auto root: g.nodes()) {
             if (context.done) break;

cp-algo/graph/euler.hpp

@@ -56,7 +56,7 @@ namespace cp_algo::graph {
             edge_index ep;
             node_index v;
         };
-        std::stack<stack_frame> stack;
+        big_stack<stack_frame> stack;
         stack.push({-1, v0});
 
         while (!empty(stack)) {

cp-algo/graph/shortest_path.hpp

@@ -41,7 +41,7 @@ namespace cp_algo::graph {
     };
 
     struct spfa_context: shortest_path_context {
-        std::queue<node_index> que;
+        big_queue<node_index> que;
         big_vector<char> flags;
         static constexpr char in_queue = 1;
         static constexpr char invalidated = 2;

cp-algo/graph/tarjan.hpp

@@ -11,7 +11,7 @@ namespace cp_algo::graph {
     template<graph_type graph>
     struct tarjan_context: dfs_low_context<graph> {
         using base = dfs_low_context<graph>;
-        std::stack<int> stack;
+        big_stack<int> stack;
         structures::csr<node_index> components;
 
         tarjan_context(graph const& g): base(g) {

cp-algo/util/big_alloc.hpp

@@ -3,6 +3,8 @@
 
 #include <map>
 #include <deque>
+#include <stack>
+#include <queue>
 #include <vector>
 #include <string>
 #include <cstddef>
@@ -73,5 +75,9 @@ namespace cp_algo {
     template<typename Key, typename Value, typename Compare = std::less<Key>>
     using big_map = std::map<Key, Value, Compare, big_alloc<std::pair<const Key, Value>>>;
     using big_string = big_basic_string<char>;
+    template<typename T>
+    using big_stack = std::stack<T, big_deque<T>>;
+    template<typename T>
+    using big_queue = std::queue<T, big_deque<T>>;
 }
 #endif // CP_ALGO_UTIL_big_alloc_HPP