最小生成树
Bread Sir
记录算法之路
展开
-
最小生成树问题——Kruskal算法
怎样构造最小生成树在大二上学期的离散数学中就已经学过了,我们当时就是使用的算法就是Kruskal算法。Kruskal算法:Kruskal算法按照边的权值的顺序从小到大查看一遍,如果不产生圈,就把当前这条边加入到生成树中。其实就是贪心的一种思想。这里我们就需要解决一个问题,怎样判断是否产生圈,那么就需要并查集的方法了。假设现在要把连接顶点u和顶点v的边e加入到生成树中。如果加入之前u和v不在一个集合中原创 2017-04-15 11:53:15 · 1160 阅读 · 0 评论 -
POJ - 2395 Out of Hay (图论/最小生成树)
问题描述 The cows have run out of hay, a horrible event that must be remedied immediately. Bessie intends to visit the other farms to survey their hay situation. There are N (2 <= N <= 2,000) farms (numbe原创 2017-04-24 20:25:20 · 364 阅读 · 0 评论 -
POJ - 2377 Bad Cowtractors(图论/最大生成树)
问题描述Bessie has been hired to build a cheap internet network among Farmer John’s N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already done some surveying, and found M (1 <= M <=原创 2017-04-24 20:17:32 · 292 阅读 · 0 评论