Update

Author: adamant-pwn

cp-algo/graph/cycle.hpp

@@ -8,7 +8,7 @@ namespace cp_algo::graph {
     struct cycle_context: dfs_context<graph> {
         using base = dfs_context<graph>;
         using base::base;
-        std::deque<edge_index> cycle;
+        big_deque<edge_index> cycle;
         bool closed = false;
         int v0;
 
@@ -30,7 +30,7 @@ namespace cp_algo::graph {
     };
 
     template<graph_type graph>
-    std::pair<node_index, std::deque<edge_index>> find_cycle(graph const& g) {
+    std::pair<node_index, big_deque<edge_index>> find_cycle(graph const& g) {
         auto context = dfs<cycle_context>(g);
         return {context.v0, context.cycle};
     }

cp-algo/graph/euler.hpp

@@ -45,8 +45,8 @@ namespace cp_algo::graph {
     // Try finding a trail starting from v0
     // may be partial if graph is not Eulerian or disconnected
     template<graph_type graph>
-    std::deque<edge_index> try_euler_trail(graph const& g, node_index v0) {
-        std::deque<edge_index> trail;
+    big_deque<edge_index> try_euler_trail(graph const& g, node_index v0) {
+        big_deque<edge_index> trail;
         enum state { unvisited, visited };
         big_vector<state> state(g.m());
         auto const& adj = g.incidence_lists();
@@ -83,7 +83,7 @@ namespace cp_algo::graph {
         return trail;
     }
     template<graph_type graph>
-    std::optional<std::pair<node_index, std::deque<edge_index>>> euler_trail(graph const& g) {
+    std::optional<std::pair<node_index, big_deque<edge_index>>> euler_trail(graph const& g) {
         auto v0 = euler_start(g);
         if (!v0) {
             return std::nullopt;

cp-algo/structures/eertree.hpp

@@ -11,7 +11,7 @@ namespace cp_algo::structures {
     struct eertree {
         eertree(size_t q) {
             q += 2;
-            s = std::string(q, -1);
+            s = big_string(q, -1);
             len = par = link = big_vector(q, 0);
             to.resize(q);
             link[0] = 1;
@@ -65,7 +65,7 @@ namespace cp_algo::structures {
     private:
         big_vector<std::forward_list<int>> to;
         big_vector<int> len, link, par;
-        std::string s;
+        big_string s;
         int n = 1, sz = 2, last = 0;
     };
 }