用处
稠密图一般用朴素版Prim,稀疏图一般用Kruskal算法。其实还有堆优化版的Prim算法。堆优化版Prim也是用于稀疏图当中,但它没有Krusjal代码简洁易懂,且代码长,所以一般还是用Kruskal算法。
普利姆算法(Prim)
朴素版Prim(O(n^2))
步骤:
1.初始化所有距离成正无穷:dist[i] = 无穷
2.n次迭代,找到集合外距离最近的点并赋值给t,然后再用t来更新其他点到集合的距离
代码:
#include <iostream>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 510, INF = 0x3f3f3f3f;
int n, m;
int g[N][N];
int dist[N];
bool st[N];
int prim()
{
memset(dist, 0x3f, sizeof dist);
int res = 0;
for (int i = 0; i < n; i++) {
int t = -1;
for (int j = 1; j <= n; j++) {
if (!st[j] && (t == -1 || dist[t] > dist[j]))
t = j;
}
if (i && dist[t] == INF) return INF;//图不是连通的
if (i) res += dist[t];//先加再更新,防止自环更新自己
for (int j = 1; j <= n; j++) dist[j] = min(dist[j], g[t][j]);
st[t] = true;
}
return res;
}
int main()
{
cin >> n >> m;
memset(g, 0x3f, sizeof g);
while (m--) {
int a, b, c;
cin >> a >> b >> c;
g[a][b] = g[b][a] = min(g[a][b], c);
}
int t = prim();
if (t == INF) cout << "No" << endl;
else cout << t << endl;
return 0;
}
克鲁斯卡尔算法(Kruskal)(O(mlogm))
步骤:
1.将所有边按权重从小到大排序 (O(mlogm))
2.枚举每条边a,b,权重c。如果a,b不连通,就将这条边加入到集合中。(O(m))
代码 :
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 200010;
int n, m;
int p[N];
struct Edge
{
int a, b, w;
bool operator< (const Edge& W)const
{
return w < W.w;
}
}edges[N];
int find(int x)
{
if (p[x] != x) p[x] = find(p[x]);
return p[x];
}
int main()
{
cin >> n >> m;
for(int i = 0; i < m; i++)
{
int a, b, w;
cin >> a >> b >> w;
edges[i] = { a, b, w };
}
sort(edges, edges + m);
for (int i = 1; i <= n; i++) p[i] = i;//初始化并查集
int res = 0, cnt = 0;
for (int i = 0; i < m; i++) {
int a = edges[i].a, b = edges[i].b, w = edges[i].w;
a = find(a), b = find(b);
if (a != b) {
p[a] = b;
res += w;
cnt++;
}
}
if (cnt < n - 1) cout << "No" << endl;
else cout << res << endl;
return 0;
}