Fixed failed benchmark

CMakeLists.txt

@@ -38,15 +38,6 @@ else()
     message(FATAL_ERROR "OpenMP requested but not found")
 endif()
 
-add_executable(bench bench.cpp)
-target_include_directories(bench PUBLIC datastructures)
-
-target_link_libraries(bench PRIVATE ips4o)
-
-if(OpenMP_CXX_FOUND)
-    target_link_libraries(bench PUBLIC OpenMP::OpenMP_CXX)
-endif()
-
 enable_testing()
 
 add_executable(unit_test 

datastructures/hldag.h

@@ -233,9 +233,9 @@ struct HLDAG {
       };
 
       parallel_iota(ordering, Vertex(0));
-      /* ips4o::parallel::sort(ordering.begin(), ordering.end(),
-       * degreeCompRandom); */
-      std::sort(ordering.begin(), ordering.end(), degreeCompRandom);
+      ips4o::parallel::sort(ordering.begin(), ordering.end(), degreeCompRandom);
+      assert(
+          std::is_sorted(ordering.begin(), ordering.end(), degreeCompRandom));
     } else {
       std::ifstream file(fileName);
       if (!file.is_open()) {
@@ -307,12 +307,16 @@ struct HLDAG {
       }
     }
 
-    /* ips4o::parallel::sort(edges.begin(), edges.end(), */
-    std::sort(edges.begin(), edges.end(),
-              [&](const auto &left, const auto &right) {
-                return std::tie(rank[left.from], rank[left.to]) <
-                       std::tie(rank[right.from], rank[right.to]);
-              });
+    ips4o::parallel::sort(edges.begin(), edges.end(),
+                          [&](const auto &left, const auto &right) {
+                            return std::tie(rank[left.from], rank[left.to]) <
+                                   std::tie(rank[right.from], rank[right.to]);
+                          });
+    assert(std::is_sorted(edges.begin(), edges.end(),
+                          [&](const auto &left, const auto &right) {
+                            return std::tie(rank[left.from], rank[left.to]) <
+                                   std::tie(rank[right.from], rank[right.to]);
+                          }));
   }
 
   void resetReachability() {

main.cpp

@@ -61,8 +61,6 @@ int main(int argc, char *argv[]) {
     g.showStats();
   }
 
-  bfs::BFSParallelFrontier bfs(g, numThreads);
-
   Graph rev = g.reverseGraph();
 
   HLDAG<K, LabelThreadSafe> hl(g, rev, numThreads);