【代码超详解】HDU 1233 还是畅通工程（Kruskal 求最小生成树 · 模板）

一、题目描述

二、算法分析说明与代码编写指导

三、AC 代码

#include<cstdio>
#include<algorithm>
#pragma warning(disable:4996)
using namespace std;
template<size_t n> class union_find {
private:
	unsigned root[n]; int rank[n];
public:
	union_find<n>() { init(); }
	union_find<n>(const bool& WannaInit) { if (WannaInit == true)init(); }
	void init() {
		fill(rank, rank + n, 1); for (unsigned i = 0; i < n; ++i)root[i] = i;
	}
	void init(const size_t& _n) {
		fill(rank, rank + _n, 1); for (unsigned i = 0; i < _n; ++i)root[i] = i;
	}
	unsigned find_root(const unsigned& v) {
		unsigned r = v, t = v, u;
		if (t == root[v])return v;
		while (r != root[r]) { r = root[r]; }
		while (t != r) { u = root[t]; root[t] = r; t = u; }
		return r;
	}
	void path_compress() const { for (unsigned i = 0; i < n; ++i)find_root(i); }
	void merge(unsigned u, unsigned v) {
		unsigned fu = find_root(u), fv = find_root(v); int d = rank[fu] - rank[fv];
		if (d < 0) { swap(fu, fv); swap(u, v); }
		else if (d == 0)++rank[fu];
		root[fv] = fu;
	}
	void merge_no_path_compression(const unsigned& u, const unsigned& v) {
		root[v] = u; if (rank[u] == rank[v])++rank[u];
	}
	void merge_directly(const unsigned& u, const unsigned& v) { root[v] = u; }
	unsigned _rank(const unsigned& v) const { return rank[find_root(v)]; }
	size_t size() const { return n; }
};
struct edge { unsigned u, v, w; };
inline bool cmp(const edge& e, const edge& f) { return e.w < f.w; }
unsigned N, n, m, a; union_find<101> u(false); edge e[4950], * E;
int main() {
	for (;;) {
		scanf("%u", &n); if (n == 0)return 0;
		u.init(n + 1); m = n * (n - 1) / 2; E = e; a = 0; N = 0;
		for (unsigned i = 0; i < m; ++i) { scanf("%u%u%u", &E->u, &E->v, &E->w); ++E; }
		sort(e, E, cmp); --n;
		for (E = e; N < n; ++E) {
			if (u.find_root(E->u) != u.find_root(E->v)) { u.merge(E->u, E->v); ++N; a += E->w; }
		}
		printf("%u\n", a);
	}
}