breadth first search tests added

Author: Debashis08

Headers/0003_Graph/0001_BreadthFirstSearch.h

@@ -1,9 +1,11 @@
 #pragma once
 
-#include<map>
 #include<list>
+#include<map>
+#include<string>
 using namespace std;
 enum color { WHITE, GRAY, BLACK };
+
 class Node
 {
 public:
@@ -24,4 +26,5 @@ class BFSGraph
 public:
     void PushUndirectedEdge(char valueU, char valueV);
     void BFS(char value);
+    string ShowBFSResult();
 };

SourceCodes/0003_Graph/0001_BreadthFirstSearch.cc

@@ -1,5 +1,7 @@
 #include "../Headers/0003_Graph/0001_BreadthFirstSearch.h"
+#include<iostream>
 #include<queue>
+#include<string>
 using namespace std;
 
 Node::Node(char value)                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                                              
@@ -65,4 +67,14 @@ void BFSGraph::PushUndirectedEdge(char valueU, char valueV)
 void BFSGraph::BFS(char value)
 {
 	this->BreadthFirstSearch(this->_nodeMap[value]);
+}
+
+string BFSGraph::ShowBFSResult()
+{
+	string result = "";
+	for (auto value : this->_nodeMap)
+	{
+		result = result + " " + value.first + "(" + to_string(value.second->distance) + ")";
+	}
+	return result;
 }

Tests/0003_Graph/0001_BreadthFirstSearchTest.cc

@@ -0,0 +1,28 @@
+#include <gtest/gtest.h>
+#include<string>
+#include "../Headers/0003_Graph/0001_BreadthFirstSearch.h"
+
+// Demonstrate some basic assertions.
+namespace BreadthFirstSearchTest
+{
+	TEST(BFSTesting, ShowBFSResultTest) {
+		BFSGraph graph;
+
+        graph.PushUndirectedEdge('s', 'r');
+        graph.PushUndirectedEdge('s', 'w');
+        graph.PushUndirectedEdge('r', 'v');
+        graph.PushUndirectedEdge('w', 't');
+        graph.PushUndirectedEdge('w', 'x');
+        graph.PushUndirectedEdge('t', 'x');
+        graph.PushUndirectedEdge('t', 'u');
+        graph.PushUndirectedEdge('x', 'u');
+        graph.PushUndirectedEdge('x', 'y');
+        graph.PushUndirectedEdge('u', 'y');
+
+        graph.BFS('s');
+        
+        string actualResult = graph.ShowBFSResult();
+        string expectedResult = " r(1) s(0) t(2) u(3) v(2) w(1) x(2) y(3)";
+        EXPECT_EQ(actualResult, expectedResult);
+	}
+}