test: kruskal test added, test util updated

Author: Debashis08

Headers/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.h

@@ -42,6 +42,5 @@ namespace MinimumSpanningTreeKruskalAlgorithm
 		void PushUndirectedEdge(int valueU, int valueV, int weight);
 		void FindMinimumSpanningTreeKruskalAlgorithm();
 		vector<pair<pair<int, int>, int>> GetMinimumSpanningTree();
-		vector<Edge*> GetSortedEdgeList();
 	};
 }

SourceCodes/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.cc

@@ -88,7 +88,7 @@ namespace MinimumSpanningTreeKruskalAlgorithm
 			this->MakeSet(iterator.second);
 		}
 
-		sort(this->_edgeList.begin(), this->_edgeList.end(), [](Edge* edgeX, Edge* edgeY) {return edgeX->weight < edgeY->weight; });
+		sort(this->_edgeList.begin(), this->_edgeList.end(), [](Edge* edgeX, Edge* edgeY) { return edgeX->weight < edgeY->weight; });
 
 		for (auto edge : this->_edgeList)
 		{
@@ -104,9 +104,4 @@ namespace MinimumSpanningTreeKruskalAlgorithm
 	{
 		return this->_minimumSpanningTree;
 	}
-
-	vector<Edge*> Graph::GetSortedEdgeList()
-	{
-		return this->_edgeList;
-	}
 }

Tests/0000_CommonUtilities/UnitTestHelper.h

@@ -136,4 +136,22 @@ class UnitTestHelper
 		reverse(normalizedCycle2.begin() + 1, normalizedCycle2.end());
 		return (normalizedCycle1 == normalizedCycle2);
 	}
+
+	template<typename T>
+	vector<pair<pair<T, T>, T>> SortVectorOfPair(vector<pair<pair<T, T>, T>> data)
+	{
+		for (auto& iterator : data)
+		{
+			if (iterator.first.first > iterator.first.second)
+			{
+				swap(iterator.first.first, iterator.first.second);
+			}
+		}
+
+		sort(data.begin(), data.end(), [](const pair<pair<T, T>, T>& pairA, const pair<pair<T, T>, T>& pairB)
+			{
+				return pairA.second < pairB.second;
+			});
+		return data;
+	}
 };

Tests/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithmTest.cc

@@ -1,8 +1,11 @@
 #include<gtest/gtest.h>
-#include<0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.h>
+#include "../Headers/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.h"
+#include "../0000_CommonUtilities/UnitTestHelper.h"
 
 namespace MinimumSpanningTreeKruskalAlgorithm
 {
+	UnitTestHelper unitTestHelper;
+
 	TEST(MST, Kruskal)
 	{
 		Graph graph;
@@ -24,7 +27,19 @@ namespace MinimumSpanningTreeKruskalAlgorithm
 
 		graph.FindMinimumSpanningTreeKruskalAlgorithm();
 
-		auto res1 = graph.GetSortedEdgeList();
-		auto res2 = graph.GetMinimumSpanningTree();
+		vector<pair<pair<int,int>, int>> actualMST = graph.GetMinimumSpanningTree();
+		vector<pair<pair<int, int>, int>> expectedMST =
+		{
+			{{7, 8}, 1},
+			{{3, 9}, 2},
+			{{6, 7}, 2},
+			{{2, 1}, 4},
+			{{3, 6}, 4},
+			{{3, 4}, 7},
+			{{8, 1}, 8},
+			{{4, 5}, 9}
+		};
+
+		ASSERT_EQ(unitTestHelper.SortVectorOfPair(actualMST), unitTestHelper.SortVectorOfPair(expectedMST));
 	}
 }