迷宫问题-BFS

01010101001011001001010110010110100100001000101010 00001000100000101010010000100000001001100110100101 01111011010010001000001101001011100011000000010000 01000000001010100011010000101000001010101011001011 00011111000000101000010010100010100000101100000000 11001000110101000010101100011010011010101011110111 00011011010101001001001010000001000101001110000000 10100000101000100110101010111110011000010000111010 00111000001010100001100010000001000101001100001001 11000110100001110010001001010101010101010001101000 00010000100100000101001010101110100010101010000101 11100100101001001000010000010101010100100100010100 00000010000000101011001111010001100000101010100011 10101010011100001000011000010110011110110100001000 10101010100001101010100101000010100000111011101001 10000000101100010000101100101101001011100000000100 10101001000000010100100001000100000100011110101001 00101001010101101001010100011010101101110000110101 11001010000100001100000010100101000001000111000010 00001000110000110101101000000100101001001000011101 10100101000101000000001110110010110101101010100001 00101000010000110101010000100010001001000100010101 10100001000110010001000010101001010101011111010010 00000100101000000110010100101001000001000000000010 11010000001001110111001001000011101001011011101000 00000110100010001000100000001000011101000000110011 10101000101000100010001111100010101001010000001000 10000010100101001010110000000100101010001011101000 00111100001000010000000110111000000001000000001011 10000001100111010111010001000110111010101101111000

#include<bits/stdc++.h>
using namespace std;
#define maxn 50
const int row = 30;
const int col = 50;
int step = 0;
string maze[row]=
{
"01010101001011001001010110010110100100001000101010",
"00001000100000101010010000100000001001100110100101",
"01111011010010001000001101001011100011000000010000",
"01000000001010100011010000101000001010101011001011",
"00011111000000101000010010100010100000101100000000",
"11001000110101000010101100011010011010101011110111",
"00011011010101001001001010000001000101001110000000",
"10100000101000100110101010111110011000010000111010",
"00111000001010100001100010000001000101001100001001",
"11000110100001110010001001010101010101010001101000",
"00010000100100000101001010101110100010101010000101",
"11100100101001001000010000010101010100100100010100",
"00000010000000101011001111010001100000101010100011",
"10101010011100001000011000010110011110110100001000",
"10101010100001101010100101000010100000111011101001",
"10000000101100010000101100101101001011100000000100",
"10101001000000010100100001000100000100011110101001",
"00101001010101101001010100011010101101110000110101",
"11001010000100001100000010100101000001000111000010",
"00001000110000110101101000000100101001001000011101",
"10100101000101000000001110110010110101101010100001",
"00101000010000110101010000100010001001000100010101",
"10100001000110010001000010101001010101011111010010",
"00000100101000000110010100101001000001000000000010",
"11010000001001110111001001000011101001011011101000",
"00000110100010001000100000001000011101000000110011",
"10101000101000100010001111100010101001010000001000",
"10000010100101001010110000000100101010001011101000",
"00111100001000010000000110111000000001000000001011",
"10000001100111010111010001000110111010101101111000"	
}; 
bool vis[maxn][maxn];//标记是否走过
//这里方向按字典序排序 
const int dirx[] = {1,0,0,-1};
const int diry[] = {0,-1,1,0};
const char dir[5] = {'D','L','R','U'};

bool check(int x, int y){
	return x>=0&&x<row&&y>=0&&y<col&&maze[x][y]=='0';
} 

struct node
{
	int x,y,step;//位置xy和走到这里所需步数step 
	char direction;//存储方位 
}; 

node father[maxn][maxn];
node now,nextpos;//指向当前或下一个位置

void dfs(int x, int y){
	//递归打印
	if(x==0&&y==0) return;//搜到初始点停止,并且正向打印路径
	else dfs(father[x][y].x,father[x][y].y);
	//father存储了上一个位置
	cout<<father[x][y].direction;//打印方位 
} 

void bfs(int x, int y){
	queue<node> q;
	now.x = x;
	now.y = y;
	now.step = 0;
	q.push(now);
	father[x][y].x=10000;
	father[x][y].y=10000;
	father[x][y].direction=0;
	
	vis[x][y] = true;//表示xy位置已经走过 
	
	while(!q.empty()){
		//队列为空就退出，全部位置达到宽搜
		now = q.front();//拿到队首元素
		q.pop();
		for(int i = 0; i < 4; i++){
			int tox = now.x + dirx[i];
			int toy = now.y + diry[i];
			if(check(tox,toy)&&!vis[tox][toy]){
				vis[tox][toy] = true;
				nextpos.x = tox;
				nextpos.y = toy;
				nextpos.step = now.step + 1;
				q.push(nextpos);
				father[tox][toy].x = now.x;
				father[tox][toy].y = now.y;
				father[tox][toy].direction = dir[i];
			} 
		} 
	}
}

int main(){
	bfs(0,0);
	dfs(29,49);
	return 0;
}