x=[0 5 16 20 33 23 35 25 10]; y=[15 20 24 20 25 11 7 0 3]; for i=1:9 for j=1:9 D(i,j)=abs(x(i)-x(j))x,y是九个点的坐标,求最短距离,并画出最短距离的连线方式编写Prim算法的Matlab文件Prim.m%Prim's algorithm% input a n % a是
来源:学生作业帮助网 编辑:作业帮 时间:2024/07/04 21:06:26
![x=[0 5 16 20 33 23 35 25 10]; y=[15 20 24 20 25 11 7 0 3]; for i=1:9 for j=1:9 D(i,j)=abs(x(i)-x(j))x,y是九个点的坐标,求最短距离,并画出最短距离的连线方式编写Prim算法的Matlab文件Prim.m%Prim's algorithm% input a n % a是](/uploads/image/z/61761-57-1.jpg?t=x%3D%5B0+5+16+20+33+23+35+25+10%5D%3B+y%3D%5B15+20+24+20+25+11+7+0+3%5D%3B+for+i%3D1%3A9+for+j%3D1%3A9+D%28i%2Cj%29%3Dabs%28x%28i%29-x%28j%29%29x%2Cy%E6%98%AF%E4%B9%9D%E4%B8%AA%E7%82%B9%E7%9A%84%E5%9D%90%E6%A0%87%2C%E6%B1%82%E6%9C%80%E7%9F%AD%E8%B7%9D%E7%A6%BB%2C%E5%B9%B6%E7%94%BB%E5%87%BA%E6%9C%80%E7%9F%AD%E8%B7%9D%E7%A6%BB%E7%9A%84%E8%BF%9E%E7%BA%BF%E6%96%B9%E5%BC%8F%E7%BC%96%E5%86%99Prim%E7%AE%97%E6%B3%95%E7%9A%84Matlab%E6%96%87%E4%BB%B6Prim.m%25Prim%27s+algorithm%25+input+a+n+%25+a%E6%98%AF)
x=[0 5 16 20 33 23 35 25 10]; y=[15 20 24 20 25 11 7 0 3]; for i=1:9 for j=1:9 D(i,j)=abs(x(i)-x(j))x,y是九个点的坐标,求最短距离,并画出最短距离的连线方式编写Prim算法的Matlab文件Prim.m%Prim's algorithm% input a n % a是
x=[0 5 16 20 33 23 35 25 10]; y=[15 20 24 20 25 11 7 0 3]; for i=1:9 for j=1:9 D(i,j)=abs(x(i)-x(j))
x,y是九个点的坐标,求最短距离,并画出最短距离的连线方式
编写Prim算法的Matlab文件Prim.m
%Prim's algorithm
% input a n % a是带权的邻接矩阵
T=[];c=0;v=1;sb=2:n;
for j=2:n
b(1,j-1)=1;
b(2,j-1)=j;
b(3,j-1)=a(1,j);
end
while size(T,2) a=D;n=9;
>> Prim
主要想让你看看这个编的对不对,还有怎么画出最优解的连线方式
x=[0 5 16 20 33 23 35 25 10]; y=[15 20 24 20 25 11 7 0 3]; for i=1:9 for j=1:9 D(i,j)=abs(x(i)-x(j))x,y是九个点的坐标,求最短距离,并画出最短距离的连线方式编写Prim算法的Matlab文件Prim.m%Prim's algorithm% input a n % a是
adsffdasafdsdfas
额