#include?
#include?
#include?“stack.h“
#define?MAXNUM?8


//找到開始位置
PositionType?findBegin（PositionType?pos[MAXNUM][MAXNUM]）{
	int?ij;
	for（i=0;i		for（j=0;j			if（pos[i][j].sign==‘2‘）{
				break;
			}
		}
		if（pos[i][j].sign==‘2‘）?break;
	}
	//printf（“開始節點是第%d行，%d列%c“ijpos[i][j].sign）;
	if（i		return?pos[i][j];
	}
	return?pos[0][0];
};

//找到結尾
PositionType?findEnd（PositionType?pos[MAXNUM][MAXNUM]）{
	int?ij;
	for（i=0;i		for（j=0;j			if（pos[i][j].sign==‘3‘）{
				break;
			}
		}
		if（pos[i][j].sign==‘3‘）?break;
	}
	if（i		return?pos[i][j];
	}
	return?pos[MAXNUM-1][MAXNUM-1];
};


void?printSign（PositionType?pos[MAXNUM][MAXNUM]PositionType?*?currentchar?a）{
	pos[current->row][current->col].sign=a;
}

//找到下一個位置
PositionType?*?findNextPosition（PositionType?*?currentPositionType?pos[MAXNUM][MAXNUM]linkStack?&S）{
	PositionType?pt;
	while（1）{
		if（current->nextDirection==5）{
			//if（stackEmpty（S）==0）{
				printSign（poscurrent‘@‘）;
				pop（Spt）;
				//pop（Spt）;
				//pop（Spt）;
				current=&pos[pt.row][pt.col];
				//printf（“%d%d\n“current->rowcurrent->col）;
				//current=findNextPosition（currentposS）;
				return?current;
			//}?else{
			//	return?&pos[MAXNUM-1][MAXNUM-1];
			//}
		}

		if（current->nextDirection==1）{
			pos[current->row][current->col].nextDirection++;
			if（pos[current->row][current->col+1].sign==‘0‘||pos[current->row][current->col+1].sign==‘1‘||pos[current->row][current->col+1].sign==‘3‘）{				
				current=&pos[current->row][current->col+1];
				return?current;				
			}
			//break;
		}
		if（current->nextDirection==2）{
			pos[current->row][current->col].nextDirection++;
			if（pos[current->row-1][current->col].sign==‘0‘||pos[current->row-1][current->col].sign==‘1‘||pos[current->row-1][current->col].sign==‘3‘）{				
				current=&pos[current->row-1][current->col];
				return?current;
			}
			//break;
		}
		if（current->nextDirection==3）{
			pos[current->row][current->col].nextDirection++;
			if（pos[current->row][current->col-1].sign==‘0‘||pos[current->row][current->col-1].sign==‘1‘||pos[current->row-1][current->col].sign==‘3‘）{				
				current=&pos[current->row][current->col-1];
				return?current;
			}			
			//break;
		}
		if（current->nextDirection==4）{
			pos[current->row][current->col].nextDirection++;
			if（pos[current->row+1][current->col].sign==‘0‘||pos[current->row+1][current->col].sign==‘1‘||pos[current->row+1][current->col].sign==‘3‘）{				
				current=&pos[current->row+1][current->col];
				return?current;
			}
			if（pos[current->row+1][current->col].sign==‘@‘||pos[current->row+1][current->col].sign==‘#‘）{
				pop（Spt）;
			}
			//break;
		}		
	}
}


//將迷宮打印出來
void?print（PositionType?pos[MAXNUM][MAXNUM]linkStack?&S）{
	int?ij;
	for（i=0;i		for（j=0;j			if（pos[i][j].sign==‘*‘）{

?屬性????????????大小?????日期????時間???名稱
-----------?---------??----------?-----??----

?????文件?????????68??2008-11-09?01:20??maze\1.txt

?????文件?????180294??2009-06-09?11:42??maze\Debug\Maze.exe

?????文件?????191872??2009-06-09?11:42??maze\Debug\Maze.ilk

?????文件??????32211??2009-06-09?11:42??maze\Debug\Maze.obj

?????文件?????222516??2009-06-09?11:42??maze\Debug\Maze.pch

?????文件?????377856??2009-06-09?11:42??maze\Debug\Maze.pdb

?????文件??????33792??2009-06-09?11:42??maze\Debug\vc60.idb

?????文件??????53248??2009-06-09?11:42??maze\Debug\vc60.pdb

?????文件??????12957??2008-11-09?02:06??maze\Maze.cpp

?????文件??????41472??2008-11-07?20:54??maze\maze.doc

?????文件???????3377??2008-11-09?01:37??maze\Maze.dsp

?????文件????????516??2008-11-09?01:37??maze\Maze.dsw

?????文件??????58368??2009-06-09?11:46??maze\Maze.ncb

?????文件??????48640??2009-06-09?11:46??maze\Maze.opt

?????文件????????734??2009-06-09?11:42??maze\Maze.plg

?????文件??????50688??2008-11-04?21:54??maze\moni.doc

?????文件?????????60??2007-05-19?08:52??maze\Public.h

?????文件???????1390??2008-11-08?21:56??maze\Stack.h

?????文件??????12213??2008-11-08?18:41??maze\復件?Maze.cpp

?????文件?????196096??2009-06-09?13:27??maze\數據結構課程設計報告.doc

?????文件??????33352??2008-11-09?00:46??maze\調用圖.jpg

?????文件??????44984??2008-11-09?00:46??maze\調用圖.png

?????目錄??????????0??2009-06-09?11:42??maze\Debug

?????目錄??????????0??2009-06-09?13:30??maze

-----------?---------??----------?-----??----

??????????????1596704????????????????????24