23 lines
415 B
C++
23 lines
415 B
C++
#include <iostream>
|
|
|
|
#include "daggy/DAG.hpp"
|
|
|
|
#include "catch.hpp"
|
|
|
|
TEST_CASE("DAG Basic Tests", "[dag]") {
|
|
daggy::DAG<int> dag;
|
|
|
|
dag.addVertex(0);
|
|
for (int i = 1; i < 10; ++i) {
|
|
dag.addVertex(i);
|
|
dag.addEdge(i-1, i);
|
|
}
|
|
|
|
REQUIRE(dag.shortest_path(0,9).size() == 10);
|
|
|
|
dag.addEdge(5, 9);
|
|
REQUIRE(dag.shortest_path(0,9).size() == 7);
|
|
|
|
REQUIRE_THROWS(dag.addEdge(9, 5));
|
|
}
|