答案:For i:=1 to vtxnum do
for j:=1 to vtxnum do
begin length[i,j]:=cost[i,j];
if length[i,j]<max then path[i,j]:=[i]+[j];
end;
For k:=1 to vtxnum do
for i:=1 to vtxnum do
for j:=1 to vtxnum do
if length[i,k]+length[k,j]<length[i,j] then
begin length[i,j]:=length[i,k]+length[k,j];
path[i,j]:=path[i,k]+path[k,j];
end;