Add Tests for the Dynamic Graph Datastructure (#34)

* Add tests for the dynamic graph data structure
franziska-wegner · Dec 24, 2023 · 42be5a8 · 42be5a8
1 parent a8b4b9c
commit 42be5a8
Show file tree

Hide file tree

Showing 2 changed files with 231 additions and 0 deletions.
diff --git a/tests/DataStructures/Graphs/TestDynamicGraph.cpp b/tests/DataStructures/Graphs/TestDynamicGraph.cpp
@@ -0,0 +1,184 @@
+/*
+ * TestDynamicGraph.cpp
+ *
+  *  Created on: Mar 7, 2019
+ *      Author: Franziska Wegner, Matthias Wolf
+ */
+
+#include "TestDynamicGraph.hpp"
+
+namespace egoa::test {
+
+#pragma mark DeleteVertex
+
+TEST_F(TestDynamicGraphEmptyDeathTest, DeleteVertex) {
+    auto assertionMessage =
+        this->assertionString("RemoveVertexAt", "VertexExists\\(id\\)");
+    Types::vertexId id = 0;
+    EXPECT_DEATH( { this->graph_.RemoveVertexAt(id); }, assertionMessage);
+}
+
+TEST_F(TestDynamicGraphSingleVertex, DeleteVertex) {
+    this->graph_.RemoveVertexAt(this->id_);
+
+    EXPECT_FALSE(this->graphConst_.VertexExists(this->id_));
+    EXPECT_EQ(0, this->graphConst_.NumberOfVertices());
+}
+
+TEST_F(TestDynamicGraphFourVertices, DeleteVertex) {
+    Types::vertexId vertexToRemove = this->vertexIds_[2];
+
+    this->graph_.RemoveVertexAt(vertexToRemove);
+
+    EXPECT_EQ(3, this->graphConst_.NumberOfVertices());
+    EXPECT_EQ(0, this->graphConst_.NumberOfEdges());
+
+    for (Types::vertexId id : this->vertexIds_) {
+        if (id == vertexToRemove) {
+            EXPECT_FALSE(this->graphConst_.VertexExists(id));
+        } else {
+            EXPECT_TRUE(this->graphConst_.VertexExists(id));
+            EXPECT_EQ(id, this->graphConst_.VertexAt(id).Properties().PrivateId());
+        }
+    }
+}
+
+TEST_F(TestDynamicGraphBidirectedPath, DeleteVertexMiddle) {
+    Types::vertexId middleVertex = this->vertexIds_[1];
+
+    this->graph_.RemoveVertexAt(middleVertex);
+
+    EXPECT_EQ(2, this->graphConst_.NumberOfVertices());
+    EXPECT_EQ(0, this->graphConst_.NumberOfEdges());
+
+    for (Types::vertexId id : this->vertexIds_) {
+        if (id == middleVertex) {
+            EXPECT_FALSE(this->graphConst_.VertexExists(id));
+        } else {
+            EXPECT_TRUE(this->graphConst_.VertexExists(id));
+            EXPECT_EQ(id, this->graphConst_.VertexAt(id).Properties().PrivateId());
+            EXPECT_EQ(0, this->graphConst_.DegreeAt(id));
+            EXPECT_EQ(0, this->graphConst_.InEdgeIdsAt(id).size());
+            EXPECT_EQ(0, this->graphConst_.OutEdgeIdsAt(id).size());
+        }
+    }
+}
+
+TEST_F(TestDynamicGraphBidirectedPath, DeleteVertexFirst) {
+    Types::vertexId firstVertex = this->vertexIds_[0];
+
+    this->graph_.RemoveVertexAt(firstVertex);
+
+    EXPECT_EQ(2, this->graphConst_.NumberOfVertices());
+    EXPECT_EQ(2, this->graphConst_.NumberOfEdges());
+
+    for (Types::vertexId id : this->vertexIds_) {
+        if (id == firstVertex) {
+            EXPECT_FALSE(this->graphConst_.VertexExists(id));
+        } else {
+            EXPECT_TRUE(this->graphConst_.VertexExists(id));
+            EXPECT_EQ(id, this->graphConst_.VertexAt(id).Properties().PrivateId());
+            EXPECT_EQ(2, this->graphConst_.DegreeAt(id));
+            EXPECT_EQ(1, this->graphConst_.InEdgeIdsAt(id).size());
+            EXPECT_EQ(1, this->graphConst_.OutEdgeIdsAt(id).size());
+        }
+    }
+}
+
+#pragma mark UpdateVertices
+
+TEST_F(TestDynamicGraphFourVertices, UpdateVertices) 
+{
+    Types::vertexId vertexToRemove = this->vertexIds_[2];
+    ASSERT_EQ(2, this->graphConst_.VertexAt(vertexToRemove).Properties().PrivateId());
+
+    this->graph_.RemoveVertexAt(vertexToRemove);
+    this->graph_.UpdateVertices();
+
+    EXPECT_EQ(3, this->graphConst_.NumberOfVertices());
+    EXPECT_EQ(0, this->graphConst_.NumberOfEdges());
+
+    std::vector<Types::vertexId> ids;
+    std::vector<Types::vertexId> privateIds;
+
+    this->graphConst_.template for_all_vertex_tuples<egoa::ExecutionPolicy::sequential>(
+        [&ids, &privateIds, this](Types::vertexId id, TVertex const & vertex) 
+        {
+            ids.push_back(id);
+            privateIds.push_back(vertex.Properties().PrivateId());
+
+            ASSERT_TRUE(this->graphConst_.VertexExists(id));
+            EXPECT_EQ(id, vertex.Identifier());
+            EXPECT_EQ(vertex, this->graphConst_.VertexAt(id));
+        });
+    ExpectSameContent({0, 1, 2}, ids);
+    ExpectSameContent({0, 1, 3}, privateIds);
+}
+
+TEST_F(TestDynamicGraphBidirectedPath, UpdateVerticesMiddle) 
+{
+    Types::vertexId middleVertex = this->vertexIds_[1];
+
+    this->graph_.RemoveVertexAt(middleVertex);
+    this->graph_.UpdateVertices();
+
+    EXPECT_EQ(2, this->graphConst_.NumberOfVertices());
+    EXPECT_EQ(0, this->graphConst_.NumberOfEdges());
+
+    std::vector<Types::vertexId> ids;
+    std::vector<Types::vertexId> privateIds;
+
+    this->graphConst_.template for_all_vertex_tuples<egoa::ExecutionPolicy::sequential>(
+        [&ids, &privateIds, this](Types::vertexId id, TVertex const & vertex) 
+        {
+            ids.push_back(id);
+            privateIds.push_back(vertex.Properties().PrivateId());
+
+            ASSERT_TRUE(this->graphConst_.VertexExists(id));
+            EXPECT_EQ(id, vertex.Identifier());
+            EXPECT_EQ(vertex, this->graphConst_.VertexAt(id));
+            EXPECT_EQ(0, this->graphConst_.DegreeAt(id));
+            EXPECT_EQ(0, this->graphConst_.InEdgeIdsAt(id).size());
+            EXPECT_EQ(0, this->graphConst_.OutEdgeIdsAt(id).size());
+        });
+    ExpectSameContent({0, 1}, ids);
+    ExpectSameContent({0, 2}, privateIds);
+}
+
+TEST_F(TestDynamicGraphBidirectedPath, UpdateVerticesFirst) 
+{
+    Types::vertexId firstVertex = this->vertexIds_[0];
+
+    this->graph_.RemoveVertexAt(firstVertex);
+    this->graph_.UpdateVertices();
+
+    EXPECT_EQ(2, this->graphConst_.NumberOfVertices());
+    EXPECT_EQ(2, this->graphConst_.NumberOfEdges());
+
+    std::vector<Types::vertexId> ids;
+    std::vector<Types::vertexId> privateIds;
+
+    this->graphConst_.template for_all_vertex_tuples<egoa::ExecutionPolicy::sequential>(
+        [&ids, &privateIds, this](Types::vertexId id, TVertex const & vertex) 
+        {
+            ids.push_back(id);
+            privateIds.push_back(vertex.Properties().PrivateId());
+
+            ASSERT_TRUE(this->graphConst_.VertexExists(id));
+            EXPECT_EQ(id, vertex.Identifier());
+            EXPECT_EQ(vertex, this->graphConst_.VertexAt(id));
+            EXPECT_EQ(2, this->graphConst_.DegreeAt(id));
+            EXPECT_EQ(1, this->graphConst_.InEdgeIdsAt(id).size());
+            EXPECT_EQ(1, this->graphConst_.OutEdgeIdsAt(id).size());
+        });
+    ExpectSameContent({0, 1}, ids);
+    ExpectSameContent({1, 2}, privateIds);
+
+    auto privateEdgeIds = this->graphConst_.MapEdges(
+        [](Types::edgeId, TEdge const & edge) {
+            return edge.Properties().PrivateId();
+        });
+    ExpectSameContent({2, 3}, privateEdgeIds);
+}
+
+} // namespace egoa::test
diff --git a/tests/DataStructures/Graphs/TestDynamicGraph.hpp b/tests/DataStructures/Graphs/TestDynamicGraph.hpp
@@ -0,0 +1,47 @@
+/*
+ * TestDynamicGraph.hpp
+ *
+ *  Created on: Mar 7, 2019
+ *      Author: Franziska Wegner, Matthias Wolf
+ */
+
+#ifndef EGOA___TESTS___DATA_STRUCTURES___GRAPHS__TEST_DYNAMIC_GRAPH_HPP
+#define EGOA___TESTS___DATA_STRUCTURES___GRAPHS__TEST_DYNAMIC_GRAPH_HPP
+
+#include <unordered_map>
+
+#include "gtest/gtest.h"
+#include "gmock/gmock.h"
+
+#include "Helper/TestHelper.hpp"
+#include "DataStructures/Graphs/TestGraph.hpp"
+
+#include "DataStructures/Graphs/DynamicGraph.hpp"
+
+namespace egoa::test {
+
+class TestDynamicGraphEmpty
+    : public TestGraphEmpty<egoa::DynamicGraph<MinimalProperties, MinimalProperties>> {
+};
+
+using TestDynamicGraphEmptyDeathTest = TestDynamicGraphEmpty;
+
+class TestDynamicGraphSingleVertex
+    : public TestGraphSingleVertex<egoa::DynamicGraph<MinimalProperties, MinimalProperties>> {
+};
+
+class TestDynamicGraphFourVertices
+    : public TestGraphFourVertices<egoa::DynamicGraph<MinimalProperties, MinimalProperties>> {
+};
+
+class TestDynamicGraphBidirectedPath
+    : public TestGraphBidirectedPath<egoa::DynamicGraph<MinimalProperties, MinimalProperties>> {
+};
+
+class TestDynamicGraphStar
+    : public TestGraphStar<egoa::DynamicGraph<MinimalProperties, MinimalProperties>> {
+};
+
+} // namespace egoa::test
+
+#endif // EGOA___TESTS___DATA_STRUCTURES___GRAPHS__TEST_DYNAMIC_GRAPH_HPP