我们通过一个例子来看一下最小生成树的求法. 分别用普里姆算法(从A结点开始)和克鲁斯卡尔算法计算下图的最小生成树. ok,首先运用Prim算法进行计算: U V-U B C D E F TE {A} {B,C,D,E,F} AB 11 AC 13 ~ ∞ AE 16 ~ ∞ AB 11 {A,B} {C,D,E,F} BC 7 BD 3 AE 16 BF 5 BD 3 {A,B,D} {C,E,F} BC 7 AE 16 BF 5 BF 5 {A,B,D,F} {C,E} BC
http://acm.hdu.edu.cn/showproblem.php?pid=4289 Problem Description You, the head of Department of Security, recently received a top-secret information that a group of terrorists is planning to transport some WMD 1 from one city (the source) to anothe