search-algorithms/test/test-algorithm.cpp

#include <catch2/catch.hpp>
#include "algorithm.hpp"

TEST_CASE("Adding Graph") {
    Graph testGraph = ReadInGraph("test/input/graphPosLittle");
    INFO("Edge is ");
    for (Edge i : testGraph.vertices.at(1).edges) {
        INFO(i.destination->nodeNumber << ' ');
    }
    //REQUIRE( testGraph.nodeCount > 0 );
    SECTION( "Vertices" ) {
        //REQUIRE( testGraph.vertices.at(1).nodeNumber == 1 );
        //REQUIRE( testGraph.vertices.at(2).nodeNumber == 2 );
        //REQUIRE( testGraph.vertices.at(3).nodeNumber == 3 );
        //REQUIRE( testGraph.vertices.at(4).nodeNumber == 4 );
        //REQUIRE( testGraph.vertices.at(5).nodeNumber == 5 );
        //REQUIRE( testGraph.vertices.at(6).nodeNumber == 6 );
        //REQUIRE( testGraph.vertices.at(7).nodeNumber == 7 );
        //REQUIRE( testGraph.vertices.at(8).nodeNumber == 8 );
        //REQUIRE( testGraph.vertices.at(9).nodeNumber == 9 );
        //REQUIRE( testGraph.vertices.at(10).nodeNumber == 10 );
    }
    SECTION( "Edges" ) {
        //std::cout << std::endl;
        //REQUIRE( testGraph.vertices.at(1).edges.at(1).destination->nodeNumber == 7 );
        //REQUIRE( testGraph.vertices.at(1).edges.at(2).destination->nodeNumber == 2 );
    }
}