資源簡介
本程序實現了對一顆樹的廣度優先搜索,通過本程序還可以判斷圖的連通性
代碼片段和文件信息
%%輸入數據
%?zhilu=[
%?????1?2???;
%?????1?6???;
%?????1?7???;
%?????2?3???;
%?????2?8???;
%?????3?4???;
%?????3?9???;
%?????4?5???;
%?????4?10??;
%?????5?6???;
%?????5?11??;
%?????6?12??;
%?????7?8???;
%?????7?12??;
%?????8?9???;
%?????9?10??;
%?????10?11?;
%?????11?12?;?
%????];
zhilu1=[?
????0?3?;
????1?2?;
????2?3?;
????2?4?;
????3?5?;
????5?7?;
????5?9?;
????7?6?;
????9?8?
????];
%%將輸入支路矩陣轉化為鄰接矩陣
[m1n1]=size(zhilu1);
zhilu=zhilu1+ones(m1n1);
n=max(max(zhilu(:1:2)));?????????????????%獲取支路節點數
G=zeros(n);???????
for?i=1:m1
??m2=zhilu(i1);
??n2=zhilu(i2);
??G(m2n2)=1;
??G(n2m2)=1;
end
%%尋找與第一個頂點相關聯的頂點
W=zeros(1n);????????????????????????????%儲存標號后的節點,節點順序從小到大排列
l=0;
v=1;
a1=find(G(v:)==1);??????????????????????%尋找與第
評論
共有 條評論