%cluster.m最短距離聚類法
function result=cluster(vector);
[a,b]=size(vector);
for k=1:(a-1)
    [c,d]=size(vector);
    fprintf('第%g次聚類:\n',k);
    [e,f,g]=min1(vector)
    fprintf('最小值=%g將第%g區(qū)和第%g區(qū)并為一類，記著G%g\n\n',g,e,f,c+1);
    for l=1:c
        if l<=min2(e,f)
         vector(l,c+1)=min2(vector(l,e),vector(l,f));
        elseif l<max(e,f)
             vector(l,c+1)=min2(min2(vector(e,l),vector(l,f)),min2(vector(l,e),vector(f,l)));
        else
         vector(c+1,l)=min2(vector(e,l),vector(f,l));   
        end
        vector(c+1,l)=inf;
    end
    vector(1:c+1,f)=inf;
    vector(1:c+1,e)=inf;
    vector(e,1:c+1)=inf;
    vector(f,1:c+1)=inf;
    vector(c+1,c+1)=inf;
end