Kinesin/daggy
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

making test a bit more interesting

Browse Source
This commit is contained in:
Ian Roddis
2021-06-10 09:35:53 -03:00
parent df854fc370
commit 7a6dbb85c2
1 changed files with 4 additions and 9 deletions
Download Patch File Download Diff File Expand all files Collapse all files

13
tests/unit_dag.cpp
View File

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