denes
/
graph
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Removing unnecessary tests

Browse Source
master
dmatetelki 10 years ago
parent 7a8ad562de
commit b8ae660a76
1 changed files with 2 additions and 20 deletions
Show Stats Download Patch File Download Diff File

22
test/graph/test_graph.hpp
Unescape View File

@ -11,8 +11,6 @@ TEST_CASE( "Graph creation", "[graph][data_structure]" ) {
REQUIRE( empty(g) == true ); REQUIRE( empty(g) == true );
REQUIRE( numberOfVertices(g) == 0 ); REQUIRE( numberOfVertices(g) == 0 );
REQUIRE( numberOfEdges(g) == 0 ); REQUIRE( numberOfEdges(g) == 0 );
REQUIRE( g.edges().size() == 0 );
REQUIRE( g.vertices().size() == 0 );
} }
SECTION("Initializer list of vertices") { SECTION("Initializer list of vertices") {
@ -20,8 +18,6 @@ TEST_CASE( "Graph creation", "[graph][data_structure]" ) {
REQUIRE( empty(g) == false ); REQUIRE( empty(g) == false );
REQUIRE( numberOfVertices(g) == 3 ); REQUIRE( numberOfVertices(g) == 3 );
REQUIRE( numberOfEdges(g) == 0 ); REQUIRE( numberOfEdges(g) == 0 );
REQUIRE( g.edges().size() == 0 );
REQUIRE( g.vertices().size() == 3 );
REQUIRE( contains(g, 1) == true ); REQUIRE( contains(g, 1) == true );
REQUIRE( contains(g, 2) == true ); REQUIRE( contains(g, 2) == true );
@ -33,8 +29,6 @@ TEST_CASE( "Graph creation", "[graph][data_structure]" ) {
REQUIRE( empty(g) == false ); REQUIRE( empty(g) == false );
REQUIRE( numberOfVertices(g) == 4 ); REQUIRE( numberOfVertices(g) == 4 );
REQUIRE( numberOfEdges(g) == 3*2 ); REQUIRE( numberOfEdges(g) == 3*2 );
REQUIRE( g.edges().size() == 3*2 );
REQUIRE( g.vertices().size() == 4 );
REQUIRE( contains(g, 1) == true ); REQUIRE( contains(g, 1) == true );
REQUIRE( contains(g, 2) == true ); REQUIRE( contains(g, 2) == true );
@ -48,8 +42,6 @@ TEST_CASE( "Graph creation", "[graph][data_structure]" ) {
REQUIRE( empty(g2) == false ); REQUIRE( empty(g2) == false );
REQUIRE( numberOfVertices(g2) == 4 ); REQUIRE( numberOfVertices(g2) == 4 );
REQUIRE( numberOfEdges(g2) == 3*2 ); REQUIRE( numberOfEdges(g2) == 3*2 );
REQUIRE( g2.edges().size() == 3*2 );
REQUIRE( g2.vertices().size() == 4 );
REQUIRE( contains(g2, 1) == true ); REQUIRE( contains(g2, 1) == true );
REQUIRE( contains(g2, 2) == true ); REQUIRE( contains(g2, 2) == true );
@ -65,8 +57,6 @@ TEST_CASE( "Graph creation", "[graph][data_structure]" ) {
REQUIRE( empty(g2) == false ); REQUIRE( empty(g2) == false );
REQUIRE( numberOfVertices(g2) == 4 ); REQUIRE( numberOfVertices(g2) == 4 );
REQUIRE( numberOfEdges(g2) == 3*2 ); REQUIRE( numberOfEdges(g2) == 3*2 );
REQUIRE( g2.edges().size() == 3*2 );
REQUIRE( g2.vertices().size() == 4 );
REQUIRE( contains(g2, 1) == true ); REQUIRE( contains(g2, 1) == true );
REQUIRE( contains(g2, 2) == true ); REQUIRE( contains(g2, 2) == true );
@ -83,8 +73,6 @@ TEST_CASE( "Graph adding vertices", "[graph][data_structure]" ) {
REQUIRE( empty(g) == false ); REQUIRE( empty(g) == false );
REQUIRE( numberOfVertices(g) == 1 ); REQUIRE( numberOfVertices(g) == 1 );
REQUIRE( numberOfEdges(g) == 0 ); REQUIRE( numberOfEdges(g) == 0 );
REQUIRE( g.edges().size() == 0 );
REQUIRE( g.vertices().size() == 1 );
} }
SECTION("Removing the only element") { SECTION("Removing the only element") {
@ -94,8 +82,6 @@ TEST_CASE( "Graph adding vertices", "[graph][data_structure]" ) {
REQUIRE( empty(g) == true ); REQUIRE( empty(g) == true );
REQUIRE( numberOfVertices(g) == 0 ); REQUIRE( numberOfVertices(g) == 0 );
REQUIRE( numberOfEdges(g) == 0 ); REQUIRE( numberOfEdges(g) == 0 );
REQUIRE( g.edges().size() == 0 );
REQUIRE( g.vertices().size() == 0 );
} }
SECTION("Adding some vertices, removing one by one") { SECTION("Adding some vertices, removing one by one") {
@ -206,8 +192,6 @@ TEST_CASE( "Graph adding edges", "[graph][data_structure]" ) {
REQUIRE( empty(g) == false ); REQUIRE( empty(g) == false );
REQUIRE( numberOfVertices(g) == 2 ); REQUIRE( numberOfVertices(g) == 2 );
REQUIRE( numberOfEdges(g) == 1*2 ); REQUIRE( numberOfEdges(g) == 1*2 );
REQUIRE( g.edges().size() == 1*2 );
REQUIRE( g.vertices().size() == 2 );
} }
SECTION("Removing the only edge") { SECTION("Removing the only edge") {
@ -217,8 +201,6 @@ TEST_CASE( "Graph adding edges", "[graph][data_structure]" ) {
REQUIRE( empty(g) == false ); REQUIRE( empty(g) == false );
REQUIRE( numberOfVertices(g) == 2 ); REQUIRE( numberOfVertices(g) == 2 );
REQUIRE( numberOfEdges(g) == 0 ); REQUIRE( numberOfEdges(g) == 0 );
REQUIRE( g.edges().size() == 0 );
REQUIRE( g.vertices().size() == 2 );
} }
SECTION("Adding some edges, removing one by one") { SECTION("Adding some edges, removing one by one") {
@ -295,8 +277,8 @@ TEST_CASE( "Graph adding edges", "[graph][data_structure]" ) {
SECTION("get array of edges") { SECTION("get array of edges") {
Graph<int> g = { {1, 2}, {1, 3}, {3, 4} }; Graph<int> g = { {1, 2}, {1, 3}, {3, 4} };
auto edges = g.edges(); auto e = edges(g);
REQUIRE( edges.size() == 3*2 ); REQUIRE( e.size() == 3*2 );
} }
} }

Write Preview
Loading…
Cancel
Save