知识前置查并集:https://blog.csdn.net/FUN6367/article/details/105706115
克鲁斯卡尔算法步骤:
(1)将图G的所有边按权值大小排序存储(或采用堆结构存储)
(2)从小到大取边集合中的边并入到最小生成树中,并判断是否构成回路(用到查并集),构成回路则撤回
(3)重复(2)直到所有顶点全部包含(或遍历完整个边集合)
算法过程模拟:
原图:
过程:
代码:
#include <iostream>
#include <vector>
#include <algorithm>
#include<limits>
using namespace std;
typedef struct Graph{
int vexnum, edgnum;
int matrix[100][100];
Graph(int v, int e):vexnum(v), edgnum(e){
for(int i = 0; i < vexnum; i ++){
for(int j = 0; j < vexnum; j ++){
matrix[i][j] = INT_MAX;
}
}
}
}Graph;
typedef struct Edg{
int a, b; //边的两个端点
int info; //边的权值
Edg(int a1, int b1, int info1):a(a1), b(b1), info(info1){};
}Edg;
//初始化图
void initGraph(Graph &G, vector<Edg> &Edgs){
cout << "分别输入G的每条边的两个端点和权值(用空格隔开):" << endl;
int i, j, info;
for(int k = 0; k < G.edgnum; k ++){
cin >> i >> j >> info;
if(i >= G.vexnum || i < 0 || j >= G.vexnum || j < 0){
cout << "输入的顶点越界!" << endl;
continue;
}
G.matrix[i][j] = info;
G.matrix[j][i] = info;
Edg e(i, j, info);
Edgs.push_back(e);
}
}
bool compare(Edg e1, Edg e2){
return e1.info < e2.info;
}
int Find(int parent[], int x){ //查并集的查找操作
while(parent[x] >= 0){
x = parent[x];
}
return x;
}
int main()
{
int vn, en;
cout << "顶点数和边数(用空格分开):";
cin >> vn >> en;
vector<Edg> Edgs; //用来存储图G的边
vector<Edg> tree; //用来存储最小生成树的边
int parent[vn]; //建立查并集
Graph G(vn, en);
initGraph(G, Edgs);
sort(Edgs.begin(), Edgs.end(), compare); //边集合排序
int n, m;
fill(parent, parent + vn, -1); //初始化查并集
for(int i = 0; i < G.edgnum; i ++){
n = Find(parent, Edgs[i].a);
m = Find(parent, Edgs[i].b);
if(n != m){
parent[n] = m; //n和m无差别,谁先谁后都一样
tree.push_back(Edgs[i]);
}
}
cout << "最小生成树:" << endl;
for(int i = 0; i < tree.size(); i ++){
cout << tree[i].a << "--" << tree[i].b << ":" << tree[i].info << endl;
}
return 0;
}
运行: