Kruskal算法求最小生成树

1. 代码 #include<stdio.h> #include<stdlib.h> #define MAX_VEX 100 typedef struct { int bv, ev, w; }EDGE; EDGE edgeset[MAX_VEX];//边集数组；edgnum<=MAX_VEX-1 int creat() { int edgnum, i; printf("输入边数：\n"

>>阅读原文<<