贪心算法——普林姆算法(Greedy Algorithm-Prim's Algorithm)

最新推荐文章于 2025-03-10 13:36:24 发布

UoM_XiaoShuaiShuai

最新推荐文章于 2025-03-10 13:36:24 发布

阅读量2.8k

点赞数

分类专栏：算法文章标签：算法贪心算法普林姆算法最小生成树

本文链接：https://blog.csdn.net/UoM_XiaoShuaiShuai/article/details/72821897

版权

本文介绍了贪心算法中的普林姆算法，用于寻找加权图的最小生成树。通过每次选择与当前子树连接的边中成本最小的节点，逐步构建最小成本的树。算法的时间复杂度为O(|E|log|V|)，适用于解决实际问题。

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

贪心算法——普林姆算法(Greedy Algorithm-Prim’s Algorithm)

贪心算法简介(Introduction of Greedy Algorithm)
这里写图片描述
(pic: https://www.sicas.cn/Students/Info/Content_110622143056742.shtml)

There is a common situation in which a cashier changes money for customers. Suppose the cashier has paper money denominations 100, 50, 20, 10, 5, 1, 0.5, 0.1 yuan, and we need to change 250 yuan for customers using the smallest number of paper money. How does the cashier make change?

Generally, we want to use as many 100 paper money as we can, then we consider smaller denomination which as 50, 20, 10 and so on until get 250. The priority denomination sequence is 100, 50, 20, 10, 5, 0.5, 0.1. For this scenario, 250= 2*100+50.

The strategy used by the cashier to change is to make decision based on what is the locally best choice.

We h