aa.cpp

这是一个迷宫的程序

#include<stdio.h>
#define MAX_ROW 6
#define MAX_COL 6
typedf struct
{
	int vert;
	int horiz;
}offsets;
offsets move[4]={{1,0},{-1,0},{0,-1},{0,1}};
int maze[MAX_ROW+2][MAX_COL+2]={
	{1,1,1,1,1,1,1,1}
	{1,0,0,0,1,0,0,1}
	{1,1,1,0,1,1,0,1}
	{1,0,1,0,1,0,0,1}
	{1,0,1,0,1,0,1,1}
	{1,0,0,0,0,0,1,1}
	{1,0,1,0,1,0,0,1}
	{1,1,1,1,1,1,1,1}
}
void outputRoad();
void FindPath(int row,int col);
int main()
{
	FindPath(1,1);
	printf("\n");
	return 1;
}
void OutputRoad()
{
	int i,j;
	for(i=0;i<MAX_COL+2;i++)
	{
		printf("\n");
        for(j=0;j<MAX_COL+2;j++)
		{
			printf("%d",)
		}
}