中国邮递员问题matlab(共6页).doc

精选优质文档-倾情为你奉上%中国邮递员问题：%step1；%求出奇点之间的距离；%求各个点之间的最短距离；%floyd算法；clear all;clc;A=zeros(9);A(1,2)=3; A(1,4)=1; A(2,4)=7; A(2,5)=4;A(2,6)=9;A(2,3)=2; A(3,6)=2A(4,7)=2; A(4,8)=3;A(4,5)=5;A(5,6)=8; A(6,9)=1;A(6,8)=6;A(7,8)=2;A(8,9)=2;c=A+A;c(find(c=0)=inf;m=length(c);Path=zeros(m);for k=1:m for i=1:m for j=1:m if c(i,j)c(i,k)+c(k,j) c(i,j)=c(i,k)+c(k,j); Path(i,j)=k; end end endendc,