making test a bit more interesting

tests/unit_dag.cpp

@@ -39,10 +39,9 @@ TEST_CASE("DAG Traversal Tests", "[dag]") {
 
     /*
        0 ---------------------\
-       1 ---------- \          \
+       1 ---------- \          \           /-----> 8
        2 ---- 3 ---- > 5 -------> 6 -----> 7
-       4 -------------------------------/
-       8 --> 9
+       4 -------------------------------/  \-----> 9
     */
 
     std::vector<std::pair<int,int>> edges{
@@ -53,7 +52,8 @@ TEST_CASE("DAG Traversal Tests", "[dag]") {
       , {2, 3}
       , {3, 5}
       , {4, 7}
-      , {8, 9}
+      , {7, 8}
+      , {7, 9}
     };
 
     for (auto const [from, to] : edges) {
@@ -71,11 +71,6 @@ TEST_CASE("DAG Traversal Tests", "[dag]") {
         ++i;
       }
 
-      std::cout << "ORDER:";
-      for (size_t i = 0; i < N_VERTICES; ++i) std::cout << " (" << i << ',' << visitOrder[i] << ')';
-      //for (auto v : visitOrder) std::cout << " " << v;
-      std::cout << std::endl;
-
       // Ensure visit order is preserved
       for (auto const [from, to] : edges) {
         REQUIRE(visitOrder[from] <= visitOrder[to]);