Large re-organization to split daggyd away from the core libdaggy.

This paves the way for implementing daggys and other utilities. Squashed commit of the following: commit 1f77239ab3c9e44d190eef94531a39501c8c4dfe Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 16:25:02 2021 -0300 Adding README, stdout support for daggyd logging commit c2c237224e84a3be68aaa597ce98af1365e74a13 Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 16:10:29 2021 -0300 removing old daggyd commit cfea2baf61ca10c535801c5a391d2d525a1a2d04 Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 16:10:09 2021 -0300 Moving tests into their sub-project folders commit e41ca42069bea1db16dd76b6684a3f692fef6b15 Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 15:57:40 2021 -0300 Splitting out daggyd from libdaggy commit be97b146c1d2446f5c03cb78707e921f18c60bd8 Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 15:56:55 2021 -0300 Splitting out daggyd from libdaggy commit cb61e140e9d6d8832d61fb7037fd4c0ff6edad00 Author: Ian Roddis <gitlab@ie2r.com> Date: Mon Oct 18 15:49:47 2021 -0300 moving daggy to libdaggy
2021-10-18 16:28:40 -03:00
parent 612bc8af8a
commit 470a6f2bb7
59 changed files with 586 additions and 52 deletions
--- a/libdaggy/tests/unit_dag.cpp
+++ b/libdaggy/tests/unit_dag.cpp
@@ -0,0 +1,89 @@
+#include <catch2/catch.hpp>
+#include <iostream>
+
+#include "daggy/DAG.hpp"
+
+TEST_CASE("dag_construction", "[dag]")
+{
+  daggy::DAG<size_t, size_t> dag;
+
+  REQUIRE(dag.size() == 0);
+  REQUIRE(dag.empty());
+
+  REQUIRE_NOTHROW(dag.addVertex(0, 0));
+  for (size_t i = 1; i < 10; ++i) {
+    dag.addVertex(i, i);
+    REQUIRE(dag.hasVertex(i));
+    REQUIRE(dag.getVertex(i).data == i);
+    dag.addEdge(i - 1, i);
+  }
+
+  REQUIRE(dag.size() == 10);
+  REQUIRE(!dag.empty());
+
+  // Cannot add an edge that would result in a cycle
+  dag.addEdge(9, 5);
+  REQUIRE(!dag.isValid());
+
+  // Bounds checking
+  SECTION("addEdge Bounds Checking")
+  {
+    REQUIRE_THROWS(dag.addEdge(20, 0));
+    REQUIRE_THROWS(dag.addEdge(0, 20));
+  }
+}
+
+TEST_CASE("dag_traversal", "[dag]")
+{
+  daggy::DAG<size_t, size_t> dag;
+
+  const int N_VERTICES = 10;
+
+  for (int i = 0; i < N_VERTICES; ++i) {
+    dag.addVertex(i, i);
+  }
+
+  /*
+     0 ---------------------\
+     1 ---------- \          \           /-----> 8
+     2 ---- 3 ---- > 5 -------> 6 -----> 7
+     4 -------------------------------/  \-----> 9
+  */
+
+  std::vector<std::pair<int, int>> edges{{0, 6}, {1, 5}, {5, 6}, {6, 7}, {2, 3},
+                                         {3, 5}, {4, 7}, {7, 8}, {7, 9}};
+
+  for (const auto &[from, to] : edges) {
+    dag.addEdge(from, to);
+  }
+
+  SECTION("Basic Traversal")
+  {
+    dag.reset();
+    std::vector<size_t> visitOrder(N_VERTICES);
+    size_t i = 0;
+    while (!dag.allVisited()) {
+      auto o = dag.visitNext();
+      REQUIRE(o.has_value());
+      const auto v = o.value();
+      dag.completeVisit(v.first);
+      visitOrder[v.first] = i;
+      ++i;
+    }
+
+    // Ensure visit order is preserved
+    for (const auto &[from, to] : edges) {
+      REQUIRE(visitOrder[from] <= visitOrder[to]);
+    }
+  }
+
+  SECTION("Iteration")
+  {
+    size_t nVisited = 0;
+    dag.forEach([&](auto &k) {
+      (void)k;
+      ++nVisited;
+    });
+    REQUIRE(nVisited == dag.size());
+  }
+}