pushqueue.m

来自「哈密顿马步图回路问题」· M 代码 · 共 10 行

for i=2:size(tmpNode,2)-1
  for j=i+1:size(tmpNode,2)
    if i~=2 | j~=3
    queueStructure{currentQueuePos}.tmpNode=[tmpNode(1,1) tmpNode(1,i) tmpNode(1,j)];
    queueStructure{currentQueuePos}.chain=chain;
    queueStructure{currentQueuePos}.mask=mask;
    currentQueuePos=currentQueuePos+1;
    end
   end
end