From b3f2bf5daae9bb8edde7f98d91c1d4aae0828caa Mon Sep 17 00:00:00 2001
From: MitaliJM <91389144+MitaliJM@users.noreply.github.com>
Date: Sat, 28 Oct 2023 02:29:10 +0530
Subject: [PATCH] Create Kruskal's_Algorithm.java

---
 Algoritms/Kruskal's_Algorithm.java | 114 +++++++++++++++++++++++++++++
 1 file changed, 114 insertions(+)
 create mode 100644 Algoritms/Kruskal's_Algorithm.java

diff --git a/Algoritms/Kruskal's_Algorithm.java b/Algoritms/Kruskal's_Algorithm.java
new file mode 100644
index 00000000..1f01a108
--- /dev/null
+++ b/Algoritms/Kruskal's_Algorithm.java
@@ -0,0 +1,114 @@
+import java.util.ArrayList; 
+import java.util.Comparator; 
+import java.util.List; 
+  
+public class KruskalsMST { 
+  
+    // Defines edge structure 
+    static class Edge { 
+        int src, dest, weight; 
+  
+        public Edge(int src, int dest, int weight) 
+        { 
+            this.src = src; 
+            this.dest = dest; 
+            this.weight = weight; 
+        } 
+    } 
+  
+    // Defines subset element structure 
+    static class Subset { 
+        int parent, rank; 
+  
+        public Subset(int parent, int rank) 
+        { 
+            this.parent = parent; 
+            this.rank = rank; 
+        } 
+    } 
+  
+    // Starting point of program execution 
+    public static void main(String[] args) 
+    { 
+        int V = 4; 
+        List<Edge> graphEdges = new ArrayList<Edge>( 
+            List.of(new Edge(0, 1, 10), new Edge(0, 2, 6), 
+                    new Edge(0, 3, 5), new Edge(1, 3, 15), 
+                    new Edge(2, 3, 4))); 
+
+        graphEdges.sort(new Comparator<Edge>() { 
+            @Override public int compare(Edge o1, Edge o2) 
+            { 
+                return o1.weight - o2.weight; 
+            } 
+        }); 
+  
+        kruskals(V, graphEdges); 
+    } 
+  
+    // Function to find the MST 
+    private static void kruskals(int V, List<Edge> edges) 
+    { 
+        int j = 0; 
+        int noOfEdges = 0; 
+
+        Subset subsets[] = new Subset[V]; 
+
+        Edge results[] = new Edge[V]; 
+
+        for (int i = 0; i < V; i++) { 
+            subsets[i] = new Subset(i, 0); 
+        } 
+        while (noOfEdges < V - 1) { 
+            Edge nextEdge = edges.get(j); 
+            int x = findRoot(subsets, nextEdge.src); 
+            int y = findRoot(subsets, nextEdge.dest); 
+
+            if (x != y) { 
+                results[noOfEdges] = nextEdge; 
+                union(subsets, x, y); 
+                noOfEdges++; 
+            } 
+  
+            j++; 
+        } 
+        System.out.println( 
+            "Following are the edges of the constructed MST:"); 
+        int minCost = 0; 
+        for (int i = 0; i < noOfEdges; i++) { 
+            System.out.println(results[i].src + " -- "
+                               + results[i].dest + " == "
+                               + results[i].weight); 
+            minCost += results[i].weight; 
+        } 
+        System.out.println("Total cost of MST: " + minCost); 
+    } 
+ 
+    private static void union(Subset[] subsets, int x, 
+                              int y) 
+    { 
+        int rootX = findRoot(subsets, x); 
+        int rootY = findRoot(subsets, y); 
+  
+        if (subsets[rootY].rank < subsets[rootX].rank) { 
+            subsets[rootY].parent = rootX; 
+        } 
+        else if (subsets[rootX].rank 
+                 < subsets[rootY].rank) { 
+            subsets[rootX].parent = rootY; 
+        } 
+        else { 
+            subsets[rootY].parent = rootX; 
+            subsets[rootX].rank++; 
+        } 
+    } 
+    private static int findRoot(Subset[] subsets, int i) 
+    { 
+        if (subsets[i].parent == i) 
+            return subsets[i].parent; 
+  
+        subsets[i].parent 
+            = findRoot(subsets, subsets[i].parent); 
+        return subsets[i].parent; 
+    } 
+}