Previous commit causes unable to find shortest path

cwida · Feb 13, 2024 · 49494a0 · 49494a0
1 parent cb66073
commit 49494a0
Showing 1 changed file with 13 additions and 13 deletions.
diff --git a/duckpgq/src/duckpgq/functions/scalar/iterativelength.cpp b/duckpgq/src/duckpgq/functions/scalar/iterativelength.cpp
@@ -30,19 +30,19 @@ static bool IterativeLength(int64_t v_size, int64_t *v, vector<int64_t> &e,
     // change |= next[i].any();
   }
 
-  vector<std::bitset<LANE_LIMIT>> next_next = vector<std::bitset<LANE_LIMIT>>(v_size, 0);
-  // If a vertex in next is a successor of other vertices in next, set it as unvisited
-  for (auto i = 0; i < v_size; i++) {
-    if (next[i].any()) {
-      for (auto offset = v[i]; offset < v[i + 1]; offset++) {
-        auto n = e[offset];
-        next_next[n] = next_next[n] | next[i];
-      }
-    }
-  }
-  for (auto i = 0; i < v_size; i++) {
-    next[i] = next[i] & ~next_next[i];
-  }
+  // vector<std::bitset<LANE_LIMIT>> next_next = vector<std::bitset<LANE_LIMIT>>(v_size, 0);
+  // // If a vertex in next is a successor of other vertices in next, set it as unvisited
+  // for (auto i = 0; i < v_size; i++) {
+  //   if (next[i].any()) {
+  //     for (auto offset = v[i]; offset < v[i + 1]; offset++) {
+  //       auto n = e[offset];
+  //       next_next[n] = next_next[n] | next[i];
+  //     }
+  //   }
+  // }
+  // for (auto i = 0; i < v_size; i++) {
+  //   next[i] = next[i] & ~next_next[i];
+  // }
 
   for (auto i = 0; i < v_size; i++) {
     change |= next[i].any();