#include <iostream>

#include <string>
#include <vector>
#include <algorithm>
#include <list>
#include<stdio.h>
#include<conio.h>
#define DEBUG
#define REP(i,a) for(i=0;i<a;i++)
#define FOR(i,a,b) for(i=a;i<b;i++)
#define ii pair<int,int>

using namespace std;

vector<int> pset;
vector<pair<int,ii> >grafo;

void initSet(int size)

{
int i;
pset.resize(size);
REP(i,size+1)
pset[i]=i;
}

int findSet(int i)
{
return (pset[i]==i)? i:(pset[i]=findSet(pset[i]));
}

void unionSet(int i,int j)

{
pset[findSet(i)]=findSet(j);
}

bool isSameSet(int i,int j)

{
if(findSet(i) == findSet(j))
return true;
return false;
}

void kruskal(int N)
{int sum=0,i;
initSet(N);
sort(grafo.begin(),grafo.end());

for(i=0;i<grafo.size();i++)
{ pair<int,ii>aux=grafo[i];
if(!isSameSet(aux.second.first,aux.second.second))
{ cout<<"pasa en: "<<aux.second.first<<","<<aux.second.second<<endl;
sum=aux.first+sum;
unionSet(aux.second.first,aux.second.second);
}
}
cout<<"el peso"<<sum;
}
int main(){
int V,A,i,a,b,w;
cout<<"\t\tAlgoritmo de kruskal"<<endl;
cout<<"ingrese numero de aristas"<<endl;
cin>>A;
cout<<"ingrese numero de vertices"<<endl;
cin>>V;
cout<<"ingrese desde que vertice a que vertice: "<<endl;
for(i=0;i<A;i++){

cout<<"Del vertice: "; cin>>a; cout<<"al vertice: ";cin>>b;

cout<<"su peso: "; cin>>w;
grafo.push_back(pair<int,ii>(w,ii(a,b)));

kruskal(V);
getch();
return 0;
}

////////////////////////////////////////////////////////////////////////////////
import java.io.*;

class Kruskal
{
public static BufferedReader br =new BufferedReader(new
InputStreamReader(System.in));

public int [][] G;

public int [][] t;
public boolean [][] in;
public boolean [][] temp;

static int n;
static int mincost = 0;
public int k, l, num_ed=0;

public Kruskal(int n) throws IOException

{
this.G = new int[n+1][n+1];
this.in = new boolean[n+1][n+1];
this.t = new int[n+1][3];

System.out.print("\nDame los costos de las aristas:\n");

for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
in[i][j] = in[j][i] = false;
if((i!=j)&&(i<j))
{
System.out.print(i+" al "+j+": ");
G[j][i] = G[i][j] = Integer.parseInt(br.readLine());
if(G[i][j] == 0 )
G[j][i] = G[i][j] = 7001;
}
if(i==j)
G[i][j]=7001;
}
}
public void Kruskals()
{
for (int i = 1; i<=n; i++)
{
getMinKL();
if(k==l)
break;
System.out.print(l + "-" +k);
if(formscycle(i-1))
{
System.out.println(" --> Ya estan en el mismo conjunto");
i--;
continue;
}
else
System.out.println();

mincost = mincost + G[k][l];

num_ed = (isPresent(i, k))?num_ed:num_ed+1;
num_ed = (isPresent(i, l))?num_ed:num_ed+1;

t[i][1] = l;
t[i][2] = k;
if(num_ed >= n)
{
if(allconnect(i))
return;
}

}
System.out.println("\nNo hay solucion");
}

public boolean allconnect(int i)

{
for(int c=2;c<=n;c++)
{
temp = new boolean[n+1][n+1];
for(int a=1;a<=n;a++)
for(int b=1;b<=n;b++)
temp[a][b] = temp[b][a] = false;

if(can_reach(1, c, i) == false)
return false;
}
return true;
}

public boolean formscycle(int i)

{
if(isPresent(i, k) && isPresent(i, l))
{
temp = new boolean[n+1][n+1];
for(int a=1;a<=n;a++)
for(int b=1;b<=n;b++)
temp[a][b] = temp[b][a] = false;

if(can_reach(k, l, i) )
return true;
 }
return false;
}

public boolean can_reach(int k, int l, int i)

{
temp[k][l] = temp[l][k] = true;
for(int o=1; o<=i; o++)
{
if(((k == t[o][1]) && (l == t[o][2])) || ((l == t[o][1]) && (k ==
t[o][2])))
return true;
if((k == t[o][1]) && !(temp[t[o][2]][l]) )
{
if(can_reach(t[o][2], l, i) == true)
return true;
}
else if((k == t[o][2]) && !(temp[t[o][1]][l]))
{
if(can_reach(t[o][1], l, i) == true)
return true;
}
}
return false;
}

public boolean isPresent(int i, int val)

{
for(int o=1; o<=i; o++)
if((val == t[o][1]) || ((val == t[o][2]) ))
return true;
return false;
}

public void getMinKL()

{
int k1 = 1, l1 = 1;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++)
{
if((i!=j)&&(i<j))
{
if((G[i][j] < G[k1][l1]) && G[i][j] !=0 && in[j]
[i]==false)
{
k1 = i;
l1 = j;
}
}
}
if(G[k1][l1] !=0 )
{
k =k1; l=l1;
in[k][l] = in[l][k] = true;
}
}

public static void main (String[] args) throws IOException

{
 System.out.println("\t\t\t\t Algoritmo de Kruskal");
System.out.print("\nDe el numero de vertices: ");
n = Integer.parseInt(br.readLine());

Kruskal kr=new Kruskal(n);

System.out.println("\n\nSolucion : \n");
kr.Kruskals();
System.out.println("\n\n\nEl costo es de: "+ mincost);
}