krus.java

#include<iostream>
using namespace std;

class kruskal{
    int **edge,*parent,n,e;
    int cost;
    public:
    kruskal(){
        cout<<"ver no. , edge"<<endl;
        cin>>n>>e;
        *edge=new int*[e];
        for(int i=0;i<e;i++){
            edge[i]=new int[e];
            cout<<"u v val"<<endl;
            cin>>edge[i][0]>>edge[i][1]>>edge[i][2];


        }
        parent=new int[n];
        for(int j=0;j<n;j++){
            parent[i]=i;
        }

    }
    ~kruskal(){
        for(int i=0;i<e;i++){
            delete[] edge[i];
        }
        delete[] edge;
        delete[] parent;
    }
    int find(int x) {
        while(parent[x] != x) x=parent[x];
    
        return x;
    }
    void unionset(int x,int y){
        parent[find(x)]=find(y);
    }
    void sortt(){
        for(int i=0;i<e;i++){
            for(int j=0;j<e-i;j++){
                if(edge[j][2]>edge[j+1][2]){
                    for(int k=0;k<3;k++){
                        int temp=edge[j+1][k];
                        edge[j+1][k]=edge[j][k];
                        edge[j][k]=temp;
                    }
                }
                
            
            }
        }
    }
    void findmst(){
        sortt();
        int count;
        for(int i=0;i<e;i++){
            if(find(edge[i][0]) != find(edge[i][1])){
                cout<<edge[i][0]<<"  " <<  edge[i][1]<<endl;
                cost+=edge[i][2];
                unionset(edge[i][0],edge[i][1]);
                count++;
            }
            if(count==n-1){
                break;
            }
            
            
        }
        cout<<"min cost  "<<cost<<endl;
    }

};

int main(){
    kruskal ob;
    ob.findmst();
    return 0;
}