%
%------------------------connected.m------------------------
%?Find?if?a?undirected?graph?with?adjacency?matrix?X?is?connected
%
%?input:?X?=?Adjacency?matrix
%?returns?0?if?graph?is?connected
%
%?N.Cheilakos2006
%?---------------------------------------------------------
function?c?=?connected（X）
c?=?0;
i?=?1;
j?=?2;
a?=?size（X）;
while（j?>?i）
????if?X（ij）?==?0
????????j?=?j?+?1;
????else
????????X（i:）?=?X（i:）?|?X（j:）;
????????X（:i）?=?X（:i）?|?X（:j）;
????????X（j:）?=?[];
????????X（:j）?=?[];
????????a（1）?=?a（1）?-?1;
????end
????if?（j?>?a（1））?&?（i?????????j?=?i?+?2;
????????i?=?i?+?1;
????????c?=?1;
????????break
????else
????????if?i?>=?a（1）
????????????i?=?j;
????????end
????end
end

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----
?????文件?????????743??2006-12-20?17:56??MST_Kruskal\connected.m
?????文件?????????925??2006-12-20?17:57??MST_Kruskal\fysalida.m
?????文件?????????819??2006-12-20?17:57??MST_Kruskal\iscycle.m
?????文件????????1282??2006-12-20?17:56??MST_Kruskal\kruskal.m
?????目錄???????????0??2011-07-20?19:10??MST_Kruskal\