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"

>>阅读原文<<