Created
April 27, 2022 16:15
-
-
Save neer2808/0cf73f829561be44ecbdbe41c48f21c1 to your computer and use it in GitHub Desktop.
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| package kruskals; | |
| import java.util.Arrays; | |
| import java.util.Scanner; | |
| class Edge implements Comparable<Edge> | |
| { | |
| int v1; | |
| int v2; | |
| int weight; | |
| public Edge(int v1, int v2, int weight) { | |
| this.v1 = v1; | |
| this.v2 = v2; | |
| this.weight = weight; | |
| } | |
| @Override | |
| public int compareTo(Edge o) { | |
| return this.weight-o.weight; | |
| } | |
| } | |
| public class kruskal_demo { | |
| public static Edge[] kruskal(Edge edges[], int v) | |
| { | |
| Arrays.sort(edges); | |
| Edge mst[] = new Edge[v-1]; | |
| int count=0; | |
| int i=0; | |
| int parent[] = new int[v]; | |
| for (int j = 0; j <v ; j++) { | |
| parent[j] = j; | |
| } | |
| while(count != v-1) | |
| { | |
| Edge currentedge = edges[i++]; | |
| int v1parent = findparent(currentedge.v1,parent); | |
| int v2parent = findparent(currentedge.v2, parent); | |
| if(v1parent != v2parent) | |
| { | |
| // including current edge | |
| mst[count]= currentedge; | |
| count++; | |
| parent[v1parent]= v2parent; | |
| } | |
| } | |
| return mst; | |
| } | |
| private static int findparent(int v1, int[] parent) { | |
| if(v1 == parent[v1]) | |
| { | |
| return v1; | |
| } | |
| return findparent(parent[v1],parent); | |
| } | |
| public static void main(String[] args) { | |
| Scanner sc = new Scanner(System.in); | |
| // how many vertex | |
| int v = sc.nextInt(); | |
| // how many edges | |
| int e = sc.nextInt(); | |
| Edge edgearray[] = new Edge[e]; | |
| for (int i = 0; i <e ; i++) { | |
| int v1 = sc.nextInt(); | |
| int v2 = sc.nextInt(); | |
| int weight = sc.nextInt(); | |
| Edge obj = new Edge(v1,v2,weight); | |
| edgearray[i]= obj; | |
| } | |
| Edge[] mst = kruskal(edgearray,v); | |
| for (int i = 0; i <mst.length ; i++) { | |
| if(mst[i].v1<mst[i].v2) | |
| { | |
| System.out.println(mst[i].v1+" " +mst[i].v2+" "+mst[i].weight); | |
| } | |
| else | |
| { | |
| System.out.println(mst[i].v2+" "+mst[i].v1+" "+mst[i].weight); | |
| } | |
| } | |
| } | |
| } |
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment