step2.m

来自「在模式识别应用中」· M 代码 · 共 24 行

function step2()
global D d i B l Jtemp r q Q Xleft;
[ Jup , JIX ] = sort ( Jtemp ( i + 1 , 1 : r ( i + 1 ) ) );

if ( q ( i + 1 ) == 0 )   %若已经到达叶结点，则进行向上一级结点回溯，转向步骤4
    step4();
else
    if ( Jtemp ( i + 1 , JIX ( q ( i + 1 ) ) ) < B )
        l = q ( i + 1 );
        step3();
    else
        Xleft ( i + 2 , : ) = Xleft ( i + 1 , : );
        Xqiindex = find ( Xleft ( i + 2 , : ) == Q ( i + 1 , q ( i + 1 ) ) );
        Xleft ( i + 2 , Xqiindex : D - 1 ) = Xleft ( i + 2 , Xqiindex + 1 : D );
        Xleft ( i + 2 , D ) = 0;
        if ( i + 1 == D - d )
            step5();
        else
            i = i + 1;
            step1();
        end
    end
end
return;