feature: mst kruskal initial code

Author: Debashis08

Headers/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.h

@@ -0,0 +1,43 @@
+#pragma once
+
+#include<map>
+#include<vector>
+using namespace std;
+
+namespace MinimumSpanningTreeKruskalAlgorithm
+{
+	class Node
+	{
+	public:
+		int data;
+		Node* parent;
+		int rank;
+		Node(int data);
+	};
+
+	class Edge
+	{
+	public:
+		Node* nodeU;
+		Node* nodeV;
+		int weight;
+		Edge(Node* nodeU, Node* nodeV, int weight);
+		bool CompareEdges(Edge* edgeX, Edge* edgeY);
+	};
+
+	class Graph
+	{
+	private:
+		map<Node*, vector<Node*>> _adjlist;
+		map<int, Node*> _nodeMap;
+		Node* MakeOrFindNode(int data);
+		void MakeSet(Node* node);
+		void Union(Node* nodeU, Node* nodeV);
+		void Link(Node* nodeU, Node* nodeV);
+		Node* FindSet(Node* node);
+
+	public:
+		void PushUndirectedEdge(int valueU, int valueV);
+		void FindMinimumSpanningTreeKruskalAlgorithm();
+	};
+}

SourceCodes/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.cc

@@ -0,0 +1,87 @@
+#include "../Headers/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithm.h"
+#include<climits>
+using namespace std;
+
+namespace MinimumSpanningTreeKruskalAlgorithm
+{
+	Node::Node(int data)
+	{
+		this->data = data;
+		this->parent = nullptr;
+		this->rank = INT_MAX;
+	}
+
+	Edge::Edge(Node* nodeU, Node* nodeV, int weight)
+	{
+		this->nodeU = nodeU;
+		this->nodeV = nodeV;
+		this->weight = weight;
+	}
+	
+	bool Edge::CompareEdges(Edge* edgeX, Edge* edgeY)
+	{
+		return (edgeX->weight < edgeY->weight);
+	}
+
+	// Graph Private Member Methods
+	Node* Graph::MakeOrFindNode(int data)
+	{
+		Node* node = nullptr;
+		if (this->_nodeMap.find(data) == this->_nodeMap.end())
+		{
+			node = new Node(data);
+			this->_nodeMap[data] = node;
+		}
+		else
+		{
+			node = this->_nodeMap[data];
+		}
+		return node;
+	}
+
+	void Graph::MakeSet(Node* node)
+	{
+		node->parent = node;
+		node->rank = 0;
+	}
+
+	void Graph::Union(Node* nodeU, Node* nodeV)
+	{
+		this->Link(this->FindSet(nodeU), this->FindSet(nodeV));
+	}
+
+	void Graph::Link(Node* nodeU, Node* nodeV)
+	{
+		if (nodeV->rank > nodeU->rank)
+		{
+			nodeU->parent = nodeV;
+		}
+		else
+		{
+			nodeV->parent = nodeU;
+			if (nodeU->rank == nodeV->rank)
+			{
+				nodeU->rank += 1;
+			}
+		}
+	}
+
+	Node* Graph::FindSet(Node* node)
+	{
+		if (node != node->parent)
+		{
+			node->parent = this->FindSet(node->parent);
+		}
+		return node->parent;
+	}
+
+	// Graph Public Member Methods
+	void Graph::PushUndirectedEdge(int dataU, int dataV)
+	{
+		Node* nodeU = this->MakeOrFindNode(dataU);
+		Node* nodeV = this->MakeOrFindNode(dataV);
+
+		this->_adjlist[nodeU].push_back(nodeV);
+		this->_adjlist[nodeV].push_back(nodeU);
+	}
+}

SourceCodes/0003_Graph/CMakeLists.txt

@@ -6,6 +6,8 @@ set(0003GRAPH_SOURCES
     0004_StronglyConnectedComponents.cc
     0005_HamiltonianPathAndCycle.cc
     0006_EulerianPathAndCircuit.cc
+    0007_MinimumSpanningTreeKruskalAlgorithm.cc
+
 )
 
 # Create a library target

Tests/0003_Graph/0007_MinimumSpanningTreeKruskalAlgorithmTest.cc

@@ -18,6 +18,7 @@ add_executable(
   0004_StronglyConnectedComponentsTest.cc
   0005_HamiltonianPathAndCycleTest.cc
   0006_EulerianPathAndCircuitTest.cc
+  0007_MinimumSpanningTreeKruskalAlgorithmTest.cc
 )
 
 target_link_libraries(