treematrix.m

来自「这是关于图论的源代码和ppt的讲解」· M 代码 · 共 24 行

clear;
n=30;
x=rand(n,2);
clf;
for i=1:n
    for j=1:n
        w(i,j)=(x(i,1)-x(j,1))^2+(x(i,2)-x(j,2))^2;
    end
    w(i,i)=100;
end

hold on;axis([0,1,0,1]);
for i=1:n
    plot(x(i,1),x(i,2),'o');
end


path=mintree(w);
for i=1:2:2*n-3
    y(1,:)=x(path(i),:);
    y(2,:)=x(path(i+1),:);
    plot(y(:,1),y(:,2),'ro:')
end