数据结构第三版李春葆第8章 图.ppt
0 1 2 3 4 6 5 19 5 14 18 27 16 8 21 3 12 7 0 4 3 2 1 6 5 14 8 5 3 16 21 lowcost closest 6 5 4 3 2 1 0 19 18 14 0 0 0 0 0 0 0 0 0 16 4 8 4 12 4 8 3 3 3 7 21 3 3 2 5 5 0 0 U V-U (i, closest[i]) iUcloses
0 1 2 3 4 6 5 19 5 14 18 27 16 8 21 3 12 7 0 4 3 2 1 6 5 14 8 5 3 16 21 lowcost closest 6 5 4 3 2 1 0 19 18 14 0 0 0 0 0 0 0 0 0 16 4 8 4 12 4 8 3 3 3 7 21 3 3 2 5 5 0 0 U V-U (i, closest[i]) iUcloses