深度搜索迷宫.cpp

这里面是很多经典算法的源代码

#include<stdio.h>
int maze[8][8]={
					{0,0},
					{0,1,1,1,1,0,1,0},
					{0,0,0,0,1,0,1,0},
					{0,1,0,0,0,1,1,0},
					{0,1,0,1,1,0,1,0},
					{0,1,0,0,0,0,1,1},
					{0,1,0,0,1,0,0,0},
					{0,1,1,1,1,1,1,0}
				};
int fx[]={0,0,1,-1};
int fy[]={1,-1,0,0};
void out()
{
	int i,j;
	printf("\n\n");
	for(i=0;i<8;i++)
		for(j=0;j<8;j++)
		{
			
			if(maze[i][j]==2)
			{
				printf("*");
			}
			else
			{
				printf("%d",maze[i][j]);
			}
			if(j==7)
			{
				printf("\n");
			}
		}
}
int check(int i,int j)
{
	
	if(i>7||i<0||j>7||j<0)
	{
		return 0;
	}
	else if(maze[i][j]!=0)
	{
		return 0;
	}
	else 
	{
		return 1;
	}
}
main()
{
	void search(int,int);
	search(0,0);

}
void search(int i,int j)
{
	int k;
	maze[i][j]=2;
	if(i==7&&j==7)
	{
		printf("\n\n");
		out();
		maze[i][j]=0;
	}
	else 
	{	for(k=0;k<4;k++)
		{
		
			if(check(i+fx[k],j+fy[k]))
			{
				search(i+fx[k],j+fy[k]);
			}
		}
		
	}
	maze[i][j]=0;
	
}