poj1258 - Agri-Net (经典邻接矩阵求最小生成树) （Prim & Kruskal）

最新推荐文章于 2019-08-03 17:09:44 发布

ITCTO-疯男

最新推荐文章于 2019-08-03 17:09:44 发布

阅读量757

点赞数

分类专栏：最小生成树并查集

本文链接：https://blog.csdn.net/itctofn/article/details/38509935

版权

该博客详细介绍了如何利用Prim和Kruskal算法解决POJ1258 Agri-Net问题。通过实例分析了经典邻接矩阵在最小生成树计算中的应用。

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

Agri-Net

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 40028		Accepted: 16291

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