#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);
    }

    dag.addEdge(5, 9);

    auto sp = dag.shortest_path(1,9);
    std::cout << "Shortest path from 1 to 10: (";
    for (auto k : sp) {
      std::cout << k << " -> ";
    }
    std::cout << std::endl;
}