POJ 1258 Agri-Net 【最小生成树入门题目】

理解最小生成树：POJ 1258 Agri-Net

最新推荐文章于 2022-01-02 21:31:05 发布

原创

最新推荐文章于 2022-01-02 21:31:05 发布 · 5.4k 阅读

3 ·

CC 4.0 BY-SA版权

这篇博客介绍了如何解决POJ 1258问题，即寻找连接N个村庄的最短路径，也就是最小生成树问题。作者通过Prime算法解释了最小生成树的概念，并提供了算法的思路和步骤，包括从一个点出发逐步添加最近的节点到树中，直到所有节点都被连接。此外，博客还提到了2013年暑假的Prime算法复习和Kruskal的实现作为补充。

原题链接：http://poj.org/problem?id=1258

周四上了节数据结构终于知道何为最小生成树，晚上回寝，遂得此题！

Agri-Net

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 29613		Accepted: 11750

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, the

最低0.47元/天解锁文章