用kruskal算法实现最小生成树写出选边的过程并编程实现,要写程序

#include
#include
#define N 10010
#define M 10010
typedef struct edge
{
int a,b,c;
}edge;
edge e[M];
int n,m;//n个结点,m条边
int p[N];
void make_set()
{
for(int i=1;ic)-(((edge*)b)->c);
}
int main()
{
//此处为文件读写操作
// freopen("in。txt","r",stdin);
// freopen("out。txt","w",stdout);
int i,min;
while(~scanf("%d%d",&n,&m))
{
for(i=0;i