BFS广度优先搜索

广度优先搜索，利用队列实现，结束标志是队列为空的时候

承接DFS的算法实现的讲例，对于迷宫问题我们也可以采取广度优先搜索实现

#include"iostream"
#include"cstdio"
#include"cstdlib"
using namespace std;


int map[55][55];
int book[55][55];
int startx,starty;
int endx,endy;
int n,m;


struct node
{
int x;
int y;
int step;
};


typedef struct node q;


q queue[100];
int head;
int tail;
int next[4][2]={{1,0},{0,1},{-1,0},{0,-1}};


int main()
{
int k;
cin>>n>>m;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>map[i][j];
}
}
cin>>startx>>starty>>endx>>endy;
queue[1].x=startx;
queue[1].y=starty;
queue[1].step=0;
head=1;
tail=2;
book[startx][starty]=1;
while(head<tail)
{
int dx,dy;
for(int i=0;i<=3;i++)
{
dx=queue[head].x+next[i][0];
dy=queue[head].y+next[i][1];
if(dx==endx&&dy==endy)
{
                k=queue[head].step+1; 
break;
}
if(dx<1||dx>n||dy<1||dy>m||map[dx][dy]==1)
{
continue;
}
else
{
if(book[dx][dy]==0&&map[dx][dy]==0)
{
book[dx][dy]=1;
queue[tail].x=dx;
queue[tail].y=dy;
queue[tail].step=queue[head].step+1;
tail++;
}
}
}
head++;
}
cout<<k<<endl;
return 0;
}