fix: Eulerian path code fixed

Debashis08 · Debashis08 · commit 1002eb5f34bb · 2024-12-11T01:31:47.000+05:30
diff --git a/SourceCodes/0003_Graph/0006_EulerianPathAndCircuit.cc b/SourceCodes/0003_Graph/0006_EulerianPathAndCircuit.cc
@@ -33,7 +33,6 @@ namespace EulerianPathAndCircuit
 	void Graph::DepthFirstSearch(Node* nodeU)
 	{
 		nodeU->visited = true;
-		this->_eulerianPath.push_back(nodeU->data);
 		for (auto& nodeV : this->_adjlist[nodeU])
 		{
 			if (nodeV->visited == false)
diff --git a/Tests/0003_Graph/0006_EulerianPathAndCircuitTest.cc b/Tests/0003_Graph/0006_EulerianPathAndCircuitTest.cc
@@ -22,9 +22,11 @@ namespace EulerianPathAndCircuit
 		bool isEulerianPathPresent = graph.IsEulerianPathPresent();
 		bool isEulerianCircuitPresent = graph.IsEulerianCircuitPresent();
 
-		vector<int> eulerianPath = graph.GetEulerianPath();
+		vector<int> actualEulerianPath = graph.UndirectedGraphGetEulerianPath();
+		vector<int> expectedEulerianPath = { 0, 1, 2, 0, 3, 4, 0};
 
 		ASSERT_TRUE(isEulerianPathPresent);
 		ASSERT_TRUE(isEulerianCircuitPresent);
+		EXPECT_EQ(expectedEulerianPath, actualEulerianPath);
 	}
 }

Original file line number	Diff line number	Diff line change
`@@ -33,7 +33,6 @@ namespace EulerianPathAndCircuit`
`33`	`33`	`void Graph::DepthFirstSearch(Node* nodeU)`
`34`	`34`	`{`
`35`	`35`	`nodeU->visited = true;`
`36`		`- this->_eulerianPath.push_back(nodeU->data);`
`37`	`36`	`for (auto& nodeV : this->_adjlist[nodeU])`
`38`	`37`	`{`
`39`	`38`	`if (nodeV->visited == false)`
Original file line number	Diff line number	Diff line change
`@@ -22,9 +22,11 @@ namespace EulerianPathAndCircuit`
`22`	`22`	`bool isEulerianPathPresent = graph.IsEulerianPathPresent();`
`23`	`23`	`bool isEulerianCircuitPresent = graph.IsEulerianCircuitPresent();`
`24`	`24`
`25`		`- vector<int> eulerianPath = graph.GetEulerianPath();`
	`25`	`+ vector<int> actualEulerianPath = graph.UndirectedGraphGetEulerianPath();`
	`26`	`+ vector<int> expectedEulerianPath = { 0, 1, 2, 0, 3, 4, 0};`
`26`	`27`
`27`	`28`	`ASSERT_TRUE(isEulerianPathPresent);`
`28`	`29`	`ASSERT_TRUE(isEulerianCircuitPresent);`
	`30`	`+ EXPECT_EQ(expectedEulerianPath, actualEulerianPath);`
`29`	`31`	`}`
`30`	`32`	`}`