matlab 城市间最短路径

clear all;clc;close all;
%最短路径代码，输入：起点+空格+终点（大写字母，如:A F）
% 输出最短路径值d    最短路径路线
% W为一个对称矩阵，如果不能直接到达距离为inf
% 本例中A到B距离为12;  A到F距离为0; B到C距离为10;
%  C到D距离为3;  C到E距离为5; C到F距离为6; D到E距离为4;  E到F距离为2;
W=[ 0     12     inf     inf      inf     16
    12     0     10      inf      inf     inf
    inf    10     0       3        5       6
    inf   inf     3       0        4      Inf
    inf   inf     5       4        0      2
    16    Inf     6      Inf       2      0   ];

n=length(W);
D=W;
m=1;
while m<=n
    for i=1:n
        for j=1:n
            if D(i,j)>D(i,m)+D(m,j)
                D(i,j)=D(i,m)+D(m,j);
            end
        end
    end
    m=m+1;
end
str = input('','s');
qidian = uint8(str(1))-64;
zhongdian = uint8(str(3))-64;
flag_flip = 0;
if qidian>zhongdian
    t = qidian;
    qidian = zhongdian;
    zhongdian = t;
    flag_flip = 1;
end

d=D(qidian,zhongdian);
P1=zeros(1,n);
k=1;
P1(k)=zhongdian;
V=ones(1,n)*inf;
kk=zhongdian;
while kk~=qidian
    for i=1:n
        V(1,i)=D(qidian,kk)-W(i,kk);
        if V(1,i)==D(qidian,i)
            P1(k+1)=i;
            kk=i;
            k=k+1;
        end
    end
end
k=1;
wrow=find(P1~=0);
for j=length(wrow):(-1):1
    P(k)=P1(wrow(j));
    k=k+1;
end
fprintf('%d\n',d)
len_P = length(P);
if flag_flip == 1
    for i = len_P:(-1):1
        temp = char(P(i)+64);
        fprintf('%c ',temp);
    end
elseif flag_flip == 0
    for i = 1:len_P
        temp = char(P(i)+64);
        fprintf('%c ',temp);
    end
end