From 357a4441592669f47e74b5c385302ce0823446e8 Mon Sep 17 00:00:00 2001
From: papyrus <1+papyrus@noreply.localhost>
Date: Mon, 18 May 2026 14:36:08 +0000
Subject: [PATCH] Delete kruskalMST.java

---
 kruskalMST.java | 81 -------------------------------------------------
 1 file changed, 81 deletions(-)
 delete mode 100644 kruskalMST.java

diff --git a/kruskalMST.java b/kruskalMST.java
deleted file mode 100644
index d76e54f..0000000
--- a/kruskalMST.java
+++ /dev/null
@@ -1,81 +0,0 @@
-import java.util.*;
-public class kruskalMST{
-    static class Edge implements Comparable<Edge>{
-        int u,v,weight;
-        Edge(int u, int v, int weight){
-            this.u=u;
-            this.v = v;
-            this.weight = weight;
-
-        }
-        public int compareTo(Edge other){
-            return this.weight-other.weight;
-        }
-    }
-    static int[] parent;
-
-    static int find(int x){
-        if(parent[x]!=x)
-            parent[x] = find(parent[x]);
-        return parent[x];
-    }
-
-    static void union(int x, int y){
-       int  rootX = find(x);
-        int rootY = find(y);
-
-        parent[rootY]= rootX;
-    }
-    public static void main(String[] args){
-        Scanner sc = new Scanner(System.in);
-        System.out.print("ENter number of vertices: ");
-        int N  = sc.nextInt();
-
-        int[][] graph = new int[N][N];
-
-        System.out.println("\nEnter adjacency matrix(0 if no edge): ");
-        for(int i =0;i<N;i++){
-            for(int j =0;j<N;j++){
-                graph[i][j] = sc.nextInt();
-            }
-        }
-        List<Edge> edges = new ArrayList<>();
-        for(int i =0;i<N;i++){
-            for(int j =i+1;j<N;j++){
-                if(graph[i][j]!=0)
-                    edges.add(new Edge(i,j,graph[i][j]));
-            }
-        }
-        Collections.sort(edges);
-
-        parent = new int[N];
-        for(int i = 0;i<N;i++){
-            parent[i]= i;
-
-        }
-        int totalCost = 0;
-        int edgeCount = 0;
-
-        System.out.println("\nEdges in MST:");
-        for(Edge e : edges){
-            int rootU = find(e.u);
-            int rootV = find(e.v);
-            if(rootU!=rootV){
-                System.out.println(e.u+" - "+e.v+" : "+e.weight);
-                totalCost+=e.weight;
-                union(rootU,rootV);
-                edgeCount++;
-
-                if(edgeCount == N-1)
-                    break;
-
-            }
-        }
-        System.out.print("\ntotal minimum cost: "+totalCost);
-        sc.close();
-        
-
-
-
-    }
-}