POJ 1287 Networking（prime算法）

最新推荐文章于 2021-07-28 18:29:42 发布

原创

最新推荐文章于 2021-07-28 18:29:42 发布 · 551 阅读

1 ·

CC 4.0 BY-SA版权

文章标签：

#networking #算法 #numbers #each #network #integer

这篇博客介绍了如何使用Prim算法解决POJ 1287 Networking问题。文章通过C++代码展示了Prim算法的实现过程，该算法用于寻找最小生成树，确保在网络中连接每个节点的最低成本路径。

Networking

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 3788		Accepted: 2043

Description

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.