trianta/search-algorithms
1
0
Fork 0
Code Issues Pull Requests Packages Projects Releases Wiki Activity

It broke at the end and idk why

Browse Source
This commit is contained in:
TriantaTV
2023-09-10 21:39:59 -05:00
parent 755fed86e5
commit dc29da26ee
4 changed files with 85 additions and 45 deletions
Download Patch File Download Diff File Expand all files Collapse all files
test/test-algorithm.cpp
+18 -13
View File
@@ -3,21 +3,26 @@
TEST_CASE("Adding Graph") {
Graph testGraph = ReadInGraph("test/input/graphPosLittle");
REQUIRE( testGraph.nodeCount > 0 );
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 );
//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" ) {
REQUIRE( testGraph.vertices.at(1).edges.at(1).destination->nodeNumber == 7 );
REQUIRE( testGraph.vertices.at(1).edges.at(2).destination->nodeNumber == 2 );
//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 );
}
}