forked from shivaylamba/Hacktoberfest
-
Notifications
You must be signed in to change notification settings - Fork 0
/
kruskal.cpp
63 lines (52 loc) · 1.12 KB
/
kruskal.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
#include<bits/stdc++.h>
using namespace std;
class item{
public:
int p1, p2, wt;
};
bool compare( item a, item b )
{
return ( a.wt<b.wt );
}
int findparent( int *parent, int a )
{
if(parent[a]==a)
return a;
return findparent(parent, parent[a]);
}
int main()
{
int e, v;
cin>>v>>e;
item *input = new item[e];
item *output = new item[v-1];
for( int i=0; i<e; i++ )
{
cin>>input[i].p1>>input[i].p2>>input[i].wt;
}
sort( input, input+e, compare );
int *parent = new int[v];
for( int i=0; i<v; i++ )
{
parent[i] = i;
}
int count = 0;
while( count<v-1 )
{
for( int i=0; i<e; i++ )
{
int x = findparent(parent, input[i].p1);
int y = findparent(parent, input[i].p2);
if( x!=y )
{
output[count++] = input[i];
parent[x] = y;
}
}
}
for( int i=0; i<v-1; i++ )
{
cout<<min( output[i].p1, output[i].p2 )<<" "<<max( output[i].p1, output[i].p2)<<" "<<output[i].wt<<endl;
}
return 0;
}