最小生成树
zyq_20030305
der
展开
-
最小生成树(Prim与Kruskal)
Prim:Prim实际上与最短路的Dij,Bellman-ford类似,都是运用蓝白点的思维.开一个bool数组白点(0)表示未进入最小生成树的点.蓝点(1)表示已进入最小生成树的点.Prim算法与Dij一样,不能够处理负边权的情况(思维与贪心类似).先初始化 :min[i]=无穷大,表示以1为起点的最小生成树蓝点(i)与白点连接的最小边权.min[1]=0,表示以1为起点,边权为0,之后...原创 2017-08-12 23:12:58 · 569 阅读 · 1 评论 -
poj2395 Kruskal题解(Prim好像过不了)
#include<stdio.h>#include<math.h>#include<algorithm>using namespace std;struct Way{ int a,b,val;};Way w[100001];int f[2001],s[2001],home[2001];int idx;int n,m,t,how,a,b,c;bool com(const Way &a,const Way &b){ return a.val<b.val;}int find(int原创 2017-08-15 14:42:19 · 233 阅读 · 0 评论 -
poj2349 Kruskal题解
Kruscal:Arctic Network题目大概意思就是给你n个点的坐标,有几个点不用花钱,求最小生成树(不用花钱的)费用.#include#include#include#includeusing namespace std;int x[1001],y[1001],dep;struct Dis{ int val,from,to;};Dis dis[200000原创 2017-08-13 10:47:07 · 323 阅读 · 1 评论 -
USACO 2008 Nov Gold 2.Cheering up the Cows最小生成树 题解
DescriptionFarmer John has grown so lazy that he no longer wants to continuemaintaining the cow paths that currently provide a way to visiteach of his N (5 1..N). Each and every pasture is h原创 2018-01-03 19:53:23 · 238 阅读 · 0 评论