POJ3026 Borg Maze【BFS+最小生成树】

胡小涛

于 2020-06-25 16:17:55 发布

阅读量372

点赞数

CC 4.0 BY-SA版权

分类专栏：搜索专题图算法 ACM练习之POJ 文章标签： BFS 最小生成树

本文链接：https://blog.youkuaiyun.com/lovecyr/article/details/106959070

本文介绍了如何帮助Borg种族在迷宫中寻找并吸收外星人的最小成本策略。通过BFS算法计算各字母点间的距离，并应用Prim算法构建最小生成树，以求得总距离。示例输入和输出展示了具体操作过程。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Description

The Borg is an immensely powerful race of enhanced humanoids from the delta quadrant of the galaxy. The Borg collective is the term used to describe the group consciousness of the Borg civilization. Each Borg individual is linked to the collective by a sophisticated subspace network that insures each member is given constant supervision and guidance.

Your task is to help the Borg (yes, really) by developing a program which helps the Borg to estimate the minimal cost of scanning a maze for the assimilation of aliens hiding in the maze, by moving in north, west, east, and south steps. The tricky thing is that the beginning of the search is conducted by a large group of over 100 individuals. Whenever an alien is assimilated, or at the beginning of the search, the group may split in two or more groups (but their consciousness is still collective.). The cost of searching a maze is definied as the total distance covered by all the groups involved in the searc