用堆棧解決迷宮

經(jīng)典word整理文檔，僅參考，雙擊此處可刪除頁眉頁腳。本資料屬于網(wǎng)絡(luò)整理，如有侵權(quán)，請聯(lián)系刪除，謝謝！年7月日#defineSTACK_INIT_SIZE10//存儲空間初始分配量#defineSTACKINCREMENT2//存儲空間分配增量structPosType//迷宮坐標(biāo)位置類型{intx;//行值int//列值};structSElemtypestructSqStack{SElemtype*base;SElemtype*top;intstacksize;};statusInitStack(SqStack&S){S.base=(SElemtype*)malloc(STACK_INIT_SIZE*sizeof(SElemtype));if(!S.base)exit(OVERFLOW);S.top=.base;}statusDestroyStack(SqStack&S){free(S.base);S.base=NULL;}statusClearStack(SqStack&S)}statusStackEmpty(SqStack&S){if(S.top==S.base)returnTRUE;elsereturnFALSE;}intStackLength(SqStackS){return(S.top-S.base);}statusGetTop(SqStackS,SElemtype&e){//若棧不空，用e返回S的棧頂元素，并返回OK否則返回FALSEreturnOK;}statusPush(SqStack&S,SElemtypee){if(S.top-S.base>=S.stacksize){S.base=(SElemtype*)realloc(S.base,(S.stacksize+STACKINCREMENT)*sizeof(SElemtype));exit(OVERFLOW);S.top=S.base+S.stacksize;S.stacksize+=STACKINCREMENT;}}statusPop(SqStack&S,SElemtype&e){if(S.top==.base)}statusStackTraverse(SqStackS,void(*visit)(SElemtype)){//從棧底到棧頂輸出元素SElemtype*p=S.base;for(p=S.base;p<.top;p++)visit(*p);printf("\n");returnOK;}}#include"head.h"#defineMAXLENGTH25MazeTypem;//迷宮數(shù)組intcurstep=1;//當(dāng)前足跡，初值為1statusPass(PosTypeb){}}PosTypeNextPos(PosTypec,intdi){//根據(jù)當(dāng)前位置及移動方向，返回下一位置}voidMarkPrint(PosTypeb)}statusMazePath(PosTypestart,PosTypeend)//課本上算法3.3{SqStackS;PosTypecurpos;SElemtypee;InitStack(S);curpos=start;do{if(Pass(curpos))//通過{FootPrint(curpos);e.ord=curstep;e.seat.x=curpos.x;e.seat.y=curpos.y;e.di=0;//方向Push(S,e);curstep++;if(curpos.x==end.x&&curpos.y==end.y)//到達終點returnTRUE;curpos=NextPos(curpos,e.di);}Pop(S,e);curstep--;{}Push(S,e);curstep++;}while(!StackEmpty(S));returnFALSE;}}voidmain()printf("請輸入迷宮的行數(shù)，列數(shù)（包括外墻）：");scanf("%d,%d",&x,&y);for(i=0;i<x;i++){m[0][i]=0;//行周邊m[x-1][i]=0;}for(j=1;j<y-1;j++)m[