算法思想
无非就是把边按照从大到小的顺序存起来,然后假设删除这条边 判断 连通性,如果改变了连通性那么就不能删除当前边,反之,则删除。
在这里我用了并查集来判断连通性,然后用了vector来存储和删除边。
如果不用 vector 删除也可以给边的结构体增加一个标记变量。
实现代码
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
const int maxn = 1e3;
const int maxm = 1e6;
int n, m;
int parent[maxn];
struct Edge {
int from, to, value;
Edge() {}
Edge(int f, int t, int v) :from(f), to(t), value(v) {}
bool operator < (const Edge& other) const{
return this->value > other.value;
}
};
vector<Edge> edge;
int findparent(int index) {
if (index == parent[index]) return index;
return parent[index] = findparent(parent[index]);
}
void Connect(int a, int b) {
a = findparent(a);
b = findparent(b);
if(a != b)parent[a] = b;
}
bool notLink(int delNum) {
int bigparent = 1;
for (int i = 1; i < n; i++) parent[i] = i;
for (int i = 0; i < edge.size(); i++) {
if (i == delNum) continue;
int from = edge[i].from, to = edge[i].to;
Connect(from, to);
}
bigparent = findparent(1);
for (int i = 1; i < n; i++)
if (findparent(i) != bigparent) return true;
return false;
}
void Kruskal() {
cout << "构建最小生成树中!!!" << endl;
int ans = 0, step = 0;
sort(edge.begin(), edge.end());
for (int i = 0; i < edge.size(); i++) {
ans += edge[i].value;
if (notLink(i)) continue; //通过查并集来发判断连通性
cout << "第" << ++step << "步: 删去连接 " << edge[i].from << "和" << edge[i].to << "权值为 " << edge[i].value << " 的那条边" << endl;
ans -= edge[i].value;
edge.erase(edge.begin() + i--);
}
cout << "最小生成树构建完毕!!!" << endl;
cout << "打印最小生成树中!!!" << endl;
for (int i = 0; i < edge.size(); i++)
cout << edge[i].from << "->" << edge[i].to << ":" << edge[i].value << endl;
cout << "最小生成树的总权值是: " << ans << endl;
}
int main(){
int f, t, v;
cout << "输入要输入的图所包含的点的个数和边的个数:";
cin >> n >> m;
for (int i = 0; i < m; i++) {
printf("输入第%d条边(顶点,终点,权值):", i + 1);
cin >> f >> t >> v;
edge.push_back(Edge(f, t, v));
}
cout << endl;
Kruskal();
return 0;
}