最小生成树算法
prim
时间复杂度: O(Elog2V)
适用范围: 稠密图
基本思路: 将任一点作为起点,将其所连接的最近的点加入,再从两点所连的点中找到最近的一个加入,依次类推。
模板:
#include <iostream>
#include <vector>
#include <queue>
using namespace std;
#define inf 0x3f3f3f3f
#define maxn 110
struct edge {
int to;
int dis;
edge(int to, int dis) : to(to), dis(dis) {}
bool operator < (const edge& b)const {
return dis > b.dis;
}
};
vector<edge> G[maxn];
bool vis[maxn];
void prim(int n) {
int sum = 0;
priority_queue<edge> pq;
pq.push(edge(1, 0));
while (!pq.empty()) {
edge e = pq.top();
pq.pop();
if (vis[e.to]) {
continue;
}
vis[e.to] = true;
for (int i = 0; i < G[e.to].size(); ++i) {
if(!vis[G[e.to][i].to]){
pq.push(G[e.to][i]);
}
}
sum += e.dis;
}
printf("%d\n", sum);
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
int u, v, w;
for (int i = 1; i <= m; ++i) {
scanf("%d%d%d", &u, &v, &w);
G[u].push_back(edge(v, w));
G[v].push_back(edge(u, w));
}
prim(n);
return 0;
}
kruskal
时间复杂度: O(Elog2E + E)
适用范围: 稀疏图
基本思路: 将边从小到大排好序,若边的两端点不再同一集中(连接不成圈),则将该边加入生成树中。
模板:
#include <iostream>
#include <algorithm>
#include <cstdio>
using namespace std;
#define inf 0x3f3f3f3f
#define maxm 10010
#define maxn 2010
struct node {
int from, to;
int dis;
node() {}
node(int from, int to, int dis) : from(from), to(to), dis(dis) {}
bool operator < (const node& b)const {
return dis < b.dis;
}
}edge[maxm];
int s[maxn];
int find(int u) {
return s[u] == u ? u : find(s[u]);
}
void kruskal(int n, int m) {
for (int i = 1; i <= n; ++i) {
s[i] = i;
}
sort(edge, edge + m);
int sum = 0;
for (int i = 0; i < m; ++i) {
int a = find(edge[i].from);
int b = find(edge[i].to);
if (a == b) {
continue;
}
s[a] = b;
sum += edge[i].dis;
}
printf("%d\n", sum);
}
int main() {
int n, m;
scanf("%d%d", &n, &m);
int u, v, w;
for (int i = 0; i < m; ++i) {
scanf("%d%d%d", &u, &v, &w);
edge[i] = node(u, v, w);
}
kruskal(n, m);
return 0;
}