华电北风吹
天津大学认知计算与应用重点实验室
2016-06-24
题目链接:
http://hihocoder.com/problemset/problem/1098
题目分析:
Kruscal算法。
// problem1098.cpp : 定义控制台应用程序的入口点。
// 最小生成树二·Kruscal算法
// http://hihocoder.com/problemset/problem/1098
// 张正义 2016-04-12
#include "stdafx.h"
#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;
int n, m;
int f[100001];
void Make_Set()
{
for (int i = 1; i < n; i++)
f[i] = i;
}
int getFather(int a)
{
while (a != f[a])
a = f[a];
return a;
}
void Union(int a, int b)
{
int root1 = getFather(a);
int root2 = getFather(b);
if (root1 != root2)
{
if (root1<root2)
f[root2] = root1;
else
f[root1] = root2;
}
}
struct Edge
{
int n1, n2, val;
Edge(int n1_, int n2_, int val_) :n1(n1_), n2(n2_), val(val_)
{
}
};
bool Compare(Edge e1, Edge e2)
{
return e1.val < e2.val;
}
int main()
{
cin >> n >> m;
int result = 0;
vector<Edge> v;
for (int i = 0; i < m; i++)
{
int n1, n2, val;
cin >> n1 >> n2 >> val;
Edge ed(n1, n2, val);
v.push_back(ed);
}
sort(v.begin(), v.end(), Compare);
Make_Set();
int k = 0;
for (int i = 0; i < m; i++)
{
if (getFather(v[i].n1) != getFather(v[i].n2))
{
result += v[i].val;
Union(v[i].n1, v[i].n2);
k++;
if (k == n - 1)
break;
}
}
cout << result << endl;
return 0;
}
解题报告: