POJ1287
You are assigned to design network connections between certain points in a wide area. You are given a set of points in the area, and a set of possible routes for the cables that may connect pairs of points. For each possible route between two points, you are given the length of the cable that is needed to connect the points over that route. Note that there may exist many possible routes between two given points. It is assumed that the given possible routes connect (directly or indirectly) each two points in the area.
Your task is to design the network for the area, so that there is a connection (direct or indirect) between every two points (i.e., all the points are interconnected, but not necessarily by a direct cable), and that the total length of the used cable is minimal.
Input
The input file consists of a number of data sets. Each data set defines one required network. The first line of the set contains two integers: the first defines the number P of the given points, and the second the number R of given routes between the points. The following R lines define the given routes between the points, each giving three integer numbers: the first two numbers identify the points, and the third gives the length of the route. The numbers are separated with white spaces. A data set giving only one number P=0 denotes the end of the input. The data sets are separated with an empty line.
The maximal number of points is 50. The maximal length of a given route is 100. The number of possible routes is unlimited. The nodes are identified with integers between 1 and P (inclusive). The routes between two points i and j may be given as i j or as j i.
Output
For each data set, print one number on a separate line that gives the total length of the cable used for the entire designed network.
Sample Input
1 0
2 3
1 2 37
2 1 17
1 2 68
3 7
1 2 19
2 3 11
3 1 7
1 3 5
2 3 89
3 1 91
1 2 32
5 7
1 2 5
2 3 7
2 4 8
4 5 11
3 5 10
1 5 6
4 2 12
0
Sample Output
0
17
16
26
问题简介:输入两点之间可选架设的网线长度,输出可以将所有节点连接起来的最短的网线长度。
问题分析:可以用最小生成树的算法解决,先按照网线长度从小到大排序,然后按网线长度的顺序用类似并查集的方法判断该网线连接的集群是否是一个,不是则连上,直到所有点都在一个集合为止(即n个点连接了n-1根线)。
#include <iostream>
#include<algorithm>
using namespace std;
int pre[100000];
struct s
{
int a, b, c;
}w[100000];
bool cmp(struct s a, struct s b)
{
return a.c < b.c;
}
int find(int x)//查找
{
if (x != pre[x])pre[x] = find(pre[x]);
return pre[x];
}
int hebing(int x, int y)//判断是否是一个集群,不是则连接
{
int a = find(x); int b = find(y);
if (a != b) { pre[a] = b; return 1; }
else return 0;
}
int main()
{
int n, m;
while (cin >> n)
{
if (n == 0)break; cin >> m;
for (int i = 0; i <= n; i++)pre[i] = i;//初始化
for (int i = 0; i < m; i++)
{
cin >> w[i].a >> w[i].b >> w[i].c;
}
sort(w , w + m ,cmp);//从小到大排序
int ans=0, sum=0;
for (int i = 0; i <m; i++)
{
if (hebing(w[i].a, w[i].b)) { sum++; ans += w[i].c; }
if (sum == n - 1)break;//连接结束则退出
}
cout << ans << endl;
}
}