kruskal算法的问题
#include <iostream>using namespace std;const int SIZE = 102;struct Node{ int start; int over; int len;};int father[SIZE];int Cmp(const void *a, const void *b){ return (*(Node *)a).len > (*(Node *)b).len ? 1 : -1; }int Find(int n){ while(n != father[n]) n = father[n]; return n;}int main(){ Node arr[5000]; int n, edge, i, sum, num, fa, fb; cout << "请输入节点的数目："; cin >> n; for(i=1;i<=n;i++) father[i] = i; edge = n * (n-1) / 2; cout << "请输入" << edge << "条路的起点，终点，距离：（假设每两个结点之间都直接连通）\n"; for(i=0;i<edge;i++) cin >> arr[i].start >> arr[i].over >> arr[i].len; qsort(arr, edge, sizeof(arr[0]), Cmp); sum = 0; num = 1; for(i=0;i<edge;i++) { if(num >= n) break; fa = arr[i].start; fb = arr[i].over; fa = Find(fa); fb = Find(fb); if(fa != fb) { sum += arr[i].len; num++; if(fa < fb) //这里 father[fb] = fa; else father[fa] = fb; } } cout << "最小生成树的总长度是: " << sum << endl; return 0;}/*输入：41 2 11 3 41 4 12 3 32 4 23 4 5输出：5*/