目录
1.题目示例
对于如下图所示的连通网,使用Prim算法求其最小生成树,并求出最小代价。
2.规范步骤
求解过程如下表所示:
U | V-U | U到各顶点的代价 | 最小代价边 | |||||
B | C | D | E | F | G | |||
A | B,C,D,E,F,G | ∞ | AC/7 | ∞ | ∞ | ∞ | AG/12 | AC |
AC | B,D,E,F,G | ∞ | AC/7 | CD/15 | CE/14 | CF/1 | AG/12 | CF |
ACF | B,D,E,G | ∞ | AC/7 | CD/15 | FE/8 | CF/1 | AG/12 | FE |
ACFE | B,D,G | EB/5 | AC/7 | CD/15 | FE/8 | CF/1 | AG/12 | EB |
ACFEB | D,G | EB/5 | AC/7 | CD/15 | FE/8 | CF/1 | BG/11 | BG |
ACFEBG | D | EB/5 | AC/7 | GD/10 | FE/8 | CF/1 | BG/11 | GD |
ACFEBGD | EB/5 | AC/7 | GD/10 | FE/8 | CF/1 | BG/11 |
最终结果为:
故其最小代价为: