本文主要是介绍POJ 1287 Networking，希望对大家解决编程问题提供一定的参考价值，需要的开发者们随着小编来一起学习吧！
Kruskal建图更加方便，不管三七二十一全部扔进去排序，然后并查集会自动帮助我们去重的。建图之后裸最小生成树
/************************************************ Author: fisty* Created Time: 2015/2/28 13:03:03* File Name : B.cpp*********************************************** */
#include <iostream>
#include <cstring>
#include <deque>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <vector>
#include <cstdio>
#include <bitset>
#include <algorithm>
using namespace std;
#define Debug(x) cout << #x << " " << x <<endl
#define Memset(x, a) memset(x, a, sizeof(x))
const int INF = 0x3f3f3f3f;
typedef long long LL;
typedef pair<int, int> P;
#define FOR(i, a, b) for(int i = a;i < b; i++)
#define MAX_N 50000
int n;
int cnt;
struct edge{int u;int v;int cost;
}G[MAX_N];void addedge(int u, int v, int cost){G[cnt].u = u;G[cnt].v = v;G[cnt].cost = cost;cnt++;
}
bool cmp(edge e1, edge e2){return e1.cost < e2.cost;
}
int par[MAX_N];
void init(){for(int i = 0;i <= n; i++){par[i] = i;}
}
int find(int x){if(x == par[x]) return x;return par[x] = find(par[x]);
}
void unio(int x, int y){x = find(x);y = find(y);if(x != y){par[x] = y;}
}
int kurskal(){sort(G, G + cnt, cmp);int ans = 0;init();for(int i = 0;i < cnt; i++){edge e = G[i];if(find(e.u) != find(e.v)){unio(e.u, e.v);ans += e.cost;}}return ans;
}int main() {//freopen("in.cpp", "r", stdin);cin.tie(0);ios::sync_with_stdio(false);while(cin >> n){if(!n) break;int m; cin >> m;Memset(G, 0);FOR(i, 0, m){int u, v, cost;cin >> u >> v >> cost;addedge(u, v, cost);}int ans = kurskal();cout << ans << endl;}return 0;
}
这篇关于POJ 1287 Networking的文章就介绍到这儿，希望我们推荐的文章对编程师们有所帮助！
