fix-test: 0017 max bipt. match, init test

Author: Debashis08

SourceCodes/0003_Graph/0017_MaximumBipartiteMatching.cc

@@ -83,12 +83,16 @@ namespace MaximumBipartiteMatching
 
 					for (int nodeV = 0; nodeV < this->_noOfVertices; nodeV++)
 					{
-						if (this->_adjMatrix[nodeU][nodeV] != 0 && this->_color[nodeV] == WHITE)
+						if (nodeU == nodeV)
+						{
+							continue;
+						}
+						else if (this->_residualGraph[nodeU][nodeV] != 0 && this->_color[nodeV] == WHITE)
 						{
 							this->_color[nodeV] = 1 - this->_color[nodeU];
 							nodeQueue.push(nodeV);
 						}
-						else if (this->_color[nodeV] == this->_color[nodeU])
+						else if (this->_residualGraph[nodeU][nodeV] != 0 && this->_color[nodeV] == this->_color[nodeU])
 						{
 							this->_isBipartite = false;
 							return;
@@ -208,11 +212,13 @@ namespace MaximumBipartiteMatching
 
 	vector<vector<int>> Graph::GetMatchings()
 	{
-		for (int nodeU = 0; nodeU < this->_noOfVertices; nodeU++)
+		for (int nodeU = 0; nodeU < this->_adjMatrix.size(); nodeU++)
 		{
-			for (int nodeV = 0; nodeV < this->_noOfVertices; nodeV++)
+			for (int nodeV = 0; nodeV < this->_adjMatrix.size(); nodeV++)
 			{
-				if (this->_residualGraph[nodeV][nodeU] == 1)
+				if ((nodeU != this->_source || nodeU != this->_sink || nodeV != this->_source || nodeV != this->_sink) 
+					&& 
+					(this->_adjMatrix[nodeU][nodeV] - this->_residualGraph[nodeU][nodeV]) == 1)
 				{
 					this->_matchings.push_back({ nodeU, nodeV });
 				}

Tests/0003_Graph/0017_MaximumBipartiteMatchingTest.cc

@@ -0,0 +1,35 @@
+#include<gtest/gtest.h>
+#include "../Headers/0003_Graph/0017_MaximumBipartiteMatching.h"
+#include "../0000_CommonUtilities/UnitTestHelper.h"
+
+namespace MaximumBipartiteMatching
+{
+	TEST(MaximumBipartiteMatching, SimpleGraph)
+	{
+		// Arrange
+		Graph graph;
+		UnitTestHelper unitTestHelper;
+		int noOfVertices = 9;
+		int expectedMaximumMatching = 3;
+		string expectedMatchings = "[0 1][2 6][3 5]";
+
+		// Act
+		graph.CreateGraph(noOfVertices);
+
+		graph.PushDirectedEdge(0, 1);
+		graph.PushDirectedEdge(2, 1);
+		graph.PushDirectedEdge(2, 6);
+		graph.PushDirectedEdge(3, 5);
+		graph.PushDirectedEdge(3, 6);
+		graph.PushDirectedEdge(3, 7);
+		graph.PushDirectedEdge(4, 6);
+		graph.PushDirectedEdge(8, 6);
+
+		int actualMaximumMatching = graph.FindMaximumBipartiteMatching();
+		vector<vector<int>> actualMatchings = graph.GetMatchings();
+
+		// Assert
+		ASSERT_EQ(expectedMaximumMatching, actualMaximumMatching);
+		ASSERT_EQ(expectedMatchings, unitTestHelper.SerializeVectorToString(actualMatchings));
+	}
+}