Merge pull request #32 from Debashis08/feature-graph-implementation

Debashis08 · web-flow · commit 764ee1809fa4 · 2024-12-18T00:28:35.000+05:30
fix: used references instead copy of obj
diff --git a/SourceCodes/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.cc b/SourceCodes/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.cc
@@ -81,16 +81,17 @@ namespace MinimumSpanningTreeKruskalAlgorithm
 		this->_adjlist[nodeV].push_back(nodeU);
 		this->_edgeList.push_back(new Edge(nodeU, nodeV, weight));
 	}
+
 	void Graph::FindMinimumSpanningTreeKruskalAlgorithm()
 	{
-		for (auto iterator : this->_nodeMap)
+		for (auto& iterator : this->_nodeMap)
 		{
 			this->MakeSet(iterator.second);
 		}
 		
 		sort(this->_edgeList.begin(), this->_edgeList.end(), [](Edge* edgeX, Edge* edgeY) { return edgeX->weight < edgeY->weight; });
 
-		for (auto edge : this->_edgeList)
+		for (auto& edge : this->_edgeList)
 		{
 			if (this->FindSet(edge->nodeU) != this->FindSet(edge->nodeV))
 			{

Original file line number	Diff line number	Diff line change
`@@ -81,16 +81,17 @@ namespace MinimumSpanningTreeKruskalAlgorithm`
`81`	`81`	`this->_adjlist[nodeV].push_back(nodeU);`
`82`	`82`	`this->_edgeList.push_back(new Edge(nodeU, nodeV, weight));`
`83`	`83`	`}`
	`84`	`+`
`84`	`85`	`void Graph::FindMinimumSpanningTreeKruskalAlgorithm()`
`85`	`86`	`{`
`86`		`- for (auto iterator : this->_nodeMap)`
	`87`	`+ for (auto& iterator : this->_nodeMap)`
`87`	`88`	`{`
`88`	`89`	`this->MakeSet(iterator.second);`
`89`	`90`	`}`
`90`	`91`
`91`	`92`	`sort(this->_edgeList.begin(), this->_edgeList.end(), [](Edge* edgeX, Edge* edgeY) { return edgeX->weight < edgeY->weight; });`
`92`	`93`
`93`		`- for (auto edge : this->_edgeList)`
	`94`	`+ for (auto& edge : this->_edgeList)`
`94`	`95`	`{`
`95`	`96`	`if (this->FindSet(edge->nodeU) != this->FindSet(edge->nodeV))`
`96`	`97`	`{`