（kruskal）Jungle Roads

最新推荐文章于 2022-05-05 22:52:48 发布

每天学点

最新推荐文章于 2022-05-05 22:52:48 发布

阅读量181

点赞数

分类专栏： C/C++/Python/Java/Matlab

请勿用于任何商业用途；转载的话请加上我的地址；

本文链接：https://blog.csdn.net/qq_40828914/article/details/81674191

版权

C/C++/Python/Java/Matlab 同时被 2 个专栏收录

291 篇文章 56 订阅 ¥39.90 ¥99.00

订阅专栏

C/C++

217 篇文章 13 订阅

订阅专栏

这篇博客介绍了热带岛屿Lagrishan的长老们面临的问题，即如何选择维护哪些道路以最低成本连接所有村庄。作者提供了一种使用Kruskal算法来解决这个问题的方法，并给出了输入输出示例。博客中提到，输入包含多个数据集，每个数据集描述了村庄之间的道路和维护成本，而输出则是每组数据的最低维护成本。

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

题目

The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money was spent on extra roads between villages some years ago. But the jungle overtakes roads relentlessly, so the large road network is too expensive to maintain. The Council of Elders must choose to stop maintaining some roads. The map above on the left shows all the roads in use now and the cost in aacms per month to maintain them. Of course there needs to be some way to get between all the villages on maintained roads, even if the route is not as short as before. The Chief Elder would like to tell the Council of Elders what would be the smallest amount they could spend in aacms per month to maintain roads that would connect all the villages. The villages are labeled A throu

了解本专栏