广度优先遍历最优树

matlab实现层序遍历最优树

stack = zeros(12,180);
allnum = zeros(1,12);
    index = 1;
for h = 1:12
   stack(h,1) = h;
   head = 1;
    back = 1;
	sum11 = 0;
    up =1;
    down =0;
    mid = 2;
    while 1
        disp('kk');
        p = up;
        for i = head:head+p-1

        disp(['up=',num2str(up),'down=',num2str(down),'head=',num2str(head),'back=',num2str(back)]);
            temp = stack(h,i);
            disp(['对',num2str(temp),'操作']);
            for j = 1:180
                if stack(h,i)>0
                    if x2(stack(h,i),j)==1
                        back = back+1;
                        stack(h,back) = j;
                        disp([num2str(j),'进入']);
                        down = down+1;
                    end
                end
            end
            for i = mid:back
                sum11 = sum11+dis2(stack(h,head),stack(h,i));
            end
            mid = back+1;
            disp([num2str(stack(h,head)),'出']);
    %         stack(head) = 0;

            head = head+1;
            up = up-1;

        end
                if up == 0
                    up = down;
                    down = 0;
                end 
                  if up ==0&&down ==0
                      break;
                  end

    end 
    allnum(index) = sum11;
    index = index+1;
end