#include <iostream>
#include <algorithm>
#include <cstdlib>using namespace std;#define VERSIZE  9 //顶点数
#define MAXSIZE 15//边数typedef struct node EDGE;
typedef int Vertex;
typedef int Position;struct node
{Vertex start;//边起始顶点Vertex end;//边结束顶点int weigth;//权重
}Edge[MAXSIZE];int VerSet[VERSIZE];//存储顶点的集合//初始化集合
void InitSet(int VerSet[],int n)
{int i = 0;for (i = 1; i <= n; i++)VerSet[i] = -1;
}//读图并初始化
void ReadGraph(EDGE Edge[], int m)//边数m
{int i = 0;for (i = 0; i < m; i++){cout << "请输入第" << i+1 << "条边:";cin >> Edge[i].start;cin >> Edge[i].end;cout << "请输入边" << "(" << Edge[i].start << "," << Edge[i].end << ")" << "的权重:";cin >> Edge[i].weigth;}
}//找出顶点在哪颗树
Position Find(int VerSet[], Vertex x)
{if (VerSet[x] < 0)return x;elsereturn VerSet[x] = Find(VerSet, VerSet[x]);
}//合并两个顶点与一棵树
void Union(int VerSet[], Vertex x, Vertex y)
{Vertex root1 = Find(VerSet,x);Vertex root2 = Find(VerSet,y);if (VerSet[root1] > VerSet[root2])VerSet[root1] = root2;else{if (VerSet[root1] == VerSet[root2])VerSet[root1]--;VerSet[root2] = root1;}
}int kruskal(EDGE Edge[],int VerSet[],int m)
{int sum = 0;int i = 0;for (i = 0; i < m; i++){if (Find(VerSet, Edge[i].start) != Find(VerSet, Edge[i].end))//判断两个端点是否在同一棵树中
        {Union(VerSet, Edge[i].start, Edge[i].end);//合并两个顶点sum += Edge[i].weigth;cout << "边" << Edge[i].start << "," << Edge[i].end << endl;//输出选择的边
        }}return sum;
}bool compare(EDGE a,EDGE b)
{return a.weigth < b.weigth;
}int main()
{int n = 7;int m = 12;InitSet(VerSet, n);ReadGraph(Edge, m);sort(Edge, Edge + n , compare);for (int i = 0; i < m; i++){cout << Edge[i].weigth << " ";}cout << endl;cout << "最小生成树为:" << kruskal(Edge, VerSet, m) << endl;system("pause");return 0;
}