文档介绍：动态规划求最短旅行路线
摘要：在我们日常生活和旅行中经常遇到求最短路径的问题，将动态规划思想 运用到求解旅行问题最短路径中，将过程划分为几个阶段，在每阶段中选取最优 策略，最后将找到整个过程的总体优化目标即最短路径。给出了动态规划方法的 nf inf inf
inf inf inf inf
inf inf inf inf inf inf inf inf inf inf inf
inf inf 2 1 inf inf
inf inf inf inf inf inf inf inf inf inf
inf inf inf 1 2 inf inf
inf inf inf inf inf inf inf inf inf
inf inf inf inf 7 4 inf inf
inf inf inf inf inf inf inf inf
inf inf inf inf inf inf inf inf
inf inf inf inf inf inf inf
inf
inf inf infinf
inf inf inf inf inf
inf inf inf inf inf
inf inf inf inf inf
inf;.. inf;.. inf;.. inf;.. inf;..
3 inf inf inf inf inf;3 4 inf inf
inf inf inf
inf infinf
inf 2 5 inf inf
inf inf inf inf inf
inf inf inf;..
inf inf inf;..
2 inf inf inf;
inf 5 inf inf;inf 2 8 inf;..
inf
inf
infinf
0 inf 4 inf. inf 0 inf 2;.. inf inf 0 1;.. inf inf inf 0]
sll=a(ll, 14)+a(14, 16);
sl2=min(a(12, 14)+a(14, 16),a(12, 15)+a(15, 16));
sl3=a(13, 15)+a(15, 16);
s7=a(7, ll)+sll;
s8=min(a(8, 11)+s 11, a (8, 12)+sl2);
s9=min(a(9, 12)+sl2, a(9, 13)+sl3);
sl0=a(10, 13)+sl3;
s4=min (a (4, 7) +s7, a (4, 8) +s8);
s5=min (a (5, 8) +s8, a (5, 9) +s9);
s6=min(a(6, 9) +s9, a(6, 10)+sl0);
s2=min (a (2, 4) +s4, a (2, 5) +s5);
s3=min (a (3, 5) +s5, a (3, 6) +s6);
sl=min(a(1, 2) +s2, a(1, 3) +s3) 程序运行结果：
a -
0
4
3
Inf
Inf
Inf
Inf
Inf
Inf
Inf
Inf
Inf
Inf
Inf
Inf
Inf
Inf
0
Inf
5
4
Inf
Inf
Inf
Inf
Inf
Inf
Inf
Inf