poj: 1258 Agri-Net（Prim算法基础）

最新推荐文章于 2021-07-28 09:52:27 发布

请多指教^_^

最新推荐文章于 2021-07-28 09:52:27 发布

阅读量160

点赞数 1

本文链接：https://blog.csdn.net/m0_46070659/article/details/110181438

版权

这是一篇关于如何应用Prim算法解决农民约翰连接农场互联网问题的博客。题目要求通过最小化光纤铺设成本来连接所有农场。输入包含多个案例，每个案例表示农场之间的距离矩阵，输出是最小总距离。博客提供了Prim算法的思路和C++、Java代码示例。

摘要由CSDN通过智能技术生成

Agri-Net

Description

Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.
Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
The distance between any two farms will not exceed 100,000.

Input

The input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivity matrix, where each element shows the distance from on farm to another. Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others. Of course, the diagonal will be 0, since the distance from farm i to itself is not interesting for this problem.

Output

For each case, output a single integer length that is the sum of the minimum length of fiber required to connect the entire set of farms.

Sample Input

Sample Output

思路：

一道Prim算法初学者的练习题，思路就是Prim算法的思想。即借助一个数组找出距离最小生成树最近的那个点，之后加上这条边的权值。并用这个点不断更新这个数组，直至将所有的顶点都加入到这个最小生成树的数组中，最后输出权值和即可。时间复杂度为O（n³）

C++代码：

#include<iostream>
#include<cstdio>
#include<cstring>

using namespace std;
#define INF 0X3f3f3f
const int MAXN = 105;
int dis[MAXN], mp[MAXN][MAXN];
bool use[MAXN];

int main()
{
   
	ios::sync_with_stdio(