当k=1时: 从城市V1出发,经过1个城镇到达V的最短距离为: f1(2,{3》)=fo(3,空)+da2=7+8=15 f1(2,4】)=fo(4,空)+d42=9+8=14 f(3,{2》=f(2,空)+d3=6+9=15 f(3,4}=f(4,空)+d43=9+5=14 f(42=f(2,空)+d4=6+7=13 f1(4,{3】=fo(3,空)+d34=7+8=15当k=1时: 从城市V1出发,经过1个城镇到达Vi的最短距离为: f1(2,{ 3 }) = f0 (3, 空)+d 32 =7+8=15 f1(2,{ 4 }) = f0 (4, 空)+d 42 =9+8=14 f1(3,{ 2 }) = f0 (2, 空)+d 23 =6+9=15 f1(3,{ 4 }) = f0 (4, 空)+d 43 =9+5=14 f1(4,{ 2 }) = f0 (2, 空)+d 24 =6+7=13 f1(4,{ 3 }) = f0 (3, 空)+d 34 =7+8=15