雙向廣度優(yōu)先搜索算法

雙向廣度優(yōu)先搜索算廣度雙向搜索的概廣度雙向搜索c:array[0..1,1..maxn]ofnode，head:array[0..1]ofintegertail:array[0..1]ofinteger分別表示正向和逆向的尾指針。if(tail[0]<=tail[1])andnot((head[0]>tail[0])or(tail[0]>=maxn))thenexpand(0);if(tail[1]<=tail[0])andnot((head[1]>tail[1])or(tail[1]>=maxn))thenifnot((head[0]>tail[0])or(tail[0]>=maxn))thenexpand(0);ifnot((head[1]>tail[1])or(tail[1]>=maxn))thenUntil while(i<=maxk)and(tail[st]<maxn)do i:=1;flag:=true;whileflagand(I<tail[st])doifc[st,tail[st]].*=c[st,i].*thenbegin flag:=false;dec(tail[st]);exitend;ifflagthenencounter(st);{判斷是否相遇fori:=1totail[1-st]ifc[st,tail[st]].*=c[1-st,i].* ifst=0thenbeginprint0(tail); print1(k);end;elsebegin print1(tail); ifm<>0thenbeginprint0(c[0,m].f);輸出c[0,m].*;wrin;end;7.print1(m)程序代碼;{輸出反方向上產(chǎn)生的結(jié)點(diǎn)}while 輸出c[1,n].*;wri 例題與33180找到一種移動(dòng)步數(shù)最少的方法，實(shí)現(xiàn)從初始布局到目標(biāo)布局的轉(zhuǎn)變，。yd:array[1..4]ofshortint=(-1,1,-c:array[0..1,1..maxn]ofnode;head,tail:array[fx]ofinteger;procedurefileini;procedureini;fori:=1to6dobeginifi<=3thenstart:=start+tempelsegoal:=goal+temp;fori:=0to1dowithc[i,head[i]]dobeginifi=0thenzt:=startelseifi=0thenkong:=pos('0',start)elseprocedureszsc(s:ztstr);fori:=1to9dobeginifimod3=0thenwrin;procedureprint0(m:integer);ifm<>0thenbeginprocedureprint1(m:integer);whilen<>0dobeginprocedureprint(st,tail,k:integer);ifst=0thenbeginelsebegin{wrin(step);}procedureencounter(st:fx);fori:=1totail[1-st]ifc[st,tail[st]].zt=c[1-st,i].ztthenprint(st,tail[st],i);procedurecheck(st:fx);i:=1;whileflagand(i<=tail[st]-1)doifc[st,tail[st]].zt=c[st,i].ztthenbeginifflagthenencounter(st);procedureexpand(st:fx);while(i<=maxk)and(tail[st]<maxn)doif(temp+yd[i]in[1..9])andnot((i=1)and(tempmod3=1))andnot((i=2)and(tempmod3=0))andnot((i=3)and(temp<=3))andnot((i=4)and(temp>6))thenbeginwithc[st,tail[st]]dobeginif(tail[0]<tail[1])andnot((head[0]>tail[0])or(tail[0]>=maxn))thenexpand(0);if(tail[1]<tail[0])andnot((head[1]>tail[1])or(tail[1]>=maxn))thenexpand(1);ifnot((head[0]>tail[0])or(tail[0]>=maxn))thenexpand(0);ifnot((head[1]>tail[1])or(tail[1]>=maxn))thenuntil((head[0]>tail[0])or(tail[0]>=maxn))and((head[1]>tail[1])or(tail[1]>=maxn));A$,B$（6）:A1$->B1$A2$->A$A1$B1$、A2$B2$例如：A$＝'abcd'B$＝'xyz'‘a(chǎn)bc’->‘xu’‘ud’->‘y’‘y’-則此時(shí)，A$B$，其變換的過(guò)程為：A$B$。A$A1$B1$A2$ | 20。10（10A$B$"NOANSWER!"abcdxyzabc