递归回溯模型(伪代码).

q6MV{@8^.L/HTB0个人总结.

模型1:遍历解空间;51Testing软件测试网EkC#v L2M

[0y!P4P2d+XN"Y c0public void vistAll(Object obj){
j:t7j1h&y4_/j T!r0     Array[] = obj.children();51Testing软件测试网M7sV E+q
     for(int i=0;i<Array.length;i++) {51Testing软件测试网YD T9l0u e2k N
        vistAll(Array[i]);51Testing软件测试网 @U'@K*[c)h
     }
Cl1z(~ L.hB*b&Gl"Z0}51Testing软件测试网L/c|/B8t5b$_N;q/bl

模型2:遍历解空间,遇到正解马上返回;51Testing软件测试网.l1SB"m-Q ? w9`

1H+a~C5cx6`!z7s(y!d0public boolean vistAll(Object obj){

(k z J [C9nx0     if(obj.isResult){51Testing软件测试网&ti9K#TWco+L
        return true;51Testing软件测试网s2Dy.m^4t$t
     }51Testing软件测试网C5i/Omp#PLR

:_z$u#H a6MCw9k0     Array[] = obj.children();51Testing软件测试网*B"YbZF
     for(int i=0;i<Array.length;i++) {
@Y$e.EHtzC_0        if(vistAll(Array[i]))
J2O!z0Lu5|:t&l0        {51Testing软件测试网}[lpc5oH
          return true;
*G(xk} x0E0        }
u3Xu `4w|0     }

P
uid R0     return false;51Testing软件测试网3S7m/C&E ag
}

模型3:遍历解空间,取所有正解(需要回溯,恢复场景);51Testing软件测试网
I/Z;X.JNi$v

;X U,|r3h Vr}?0public void vistAll(Object obj){51Testing软件测试网\ pJ5[;]6c^

     if(obj.isResult){51Testing软件测试网,j/Z;h-qR3zXR0^S
         save obj to List;
,J/h0z T,X#C9}0     }51Testing软件测试网jZ4nzh

$W5uyr5V$E0     if(obj.isTheEnd){
8KJ.h1[%a0         output all in List;
HI1s p0R0     }else{
aU?o`n%ot0        Array[] = obj.children();
N0lh
n`N~{,W0        if(Array.length>0){
_X@7g*v%ddn0           for(int i=0;i<Array.length;i++) {51Testing软件测试网.S;})_n.\ M9v(C$@4G]
              vistAll(Array[i]);51Testing软件测试网eu*{bo&S
              list.remove(Array[i]);
vK_i'sE:Np2f0           } 51Testing软件测试网!A7j0GF1F!i[+?
        }
1qqC4wfJ0v0     }
@#e5U6_!CWi0}51Testing软件测试网'?a(cb&Sep B-u2yK:s

&yT7`T2N+i8d!i0继续衍生~~~51Testing软件测试网 M(N#ssn;ut`n