基于深度优先搜索算法图论代码.zip

function flag = wj_wfs_con(D) %输入邻接矩阵，如果联通返回1，否则返回零。 L = size(D,1); visited = [1]; while(length(visited) < L) D(visited, visited) = 0; pos = D(visited,:); if sum(sum(pos)) == 0 flag = 0; return; else for i = 1:size(pos,1) b = find(pos(i,:)); visited = union(visited, b) D(visited, visited) = 0; end end end flag = 1;