**%=======生成最小树**
clc;clear;
a=zeros(7); a(1,2)=50; a(1,3)=60; a(2,4)=65; a(2,5)=40;
a(3,4)=52;a(3,7)=45; a(4,5)=50; a(4,6)=30;a(4,7)=42;
a(5,6)=70; a=a+a';
a(find(a==0))=inf;
result=[];p=1;
tb=2:length(a);
while length(result)~=length(a)-1
temp=a(p,tb);temp=temp(:);
d=min(temp);
[jb,kb]=find(a(p,tb)==d);
j=p(jb(1));k=tb(kb(1));
result=[result,[j;k;d]];
p=[p,k];tb(find(tb==k))=[];
end
result
%画树形图
ChannelName={"asd"}
tree = b(1:2,:)';
cm = zeros(181);
for i = 1:180
cm(tree(i,1),tree(i,2)) = 1;
end
bg1 = biograph(cm,ChannelName);
view(bg1);
**%==========邻接表转化为邻接矩阵**
B=zeros(181);
for i=1:180
p=b(1,i);q=b(2,i);
B(p,q)=b(3,i);
end
B=B+B';
B(find(B==0))=inf;