POJ_3752,BFS特点:二维数组存迷宫结构和结果矩阵,用queue队列,队列内放结构体,bfs函数无返回值只执行一次,找到符合的放入队列,处理后移除队列修改visit 。
#include <iostream>
#include <queue>
using namespace std;
bool canwalk[40][40];
int dis[40][40];
int X[4]={0,1,0,-1};
int Y[4]={1,0,-1,0};
int r,c;
struct point{
int x,y;
};
void bfs(int sx,int sy){
point start;
start.x=sx,start.y=sy;
queue<point> road;
road.push(start);
dis[sx][sy]=1;
canwalk[sx][sy]=0;
while(!road.empty()){
point curr=road.front();
road.pop();
for(int i=0;i<4;i++){
int nx=curr.x+X[i];
int ny=curr.y+Y[i];
if(nx>=0&&ny>=0&&nx<r&&ny<c&&canwalk[nx][ny]){
dis[nx][ny]=dis[curr.x][curr.y]+1;
canwalk[nx][ny]=0;
point next;
next.x=nx,next.y=ny;
road.push(next);
}
}
}
}
int main(){
cin>>r>>c;
for(int i=0;i<r;i++)
for(int j=0;j<c;j++){
char temp; cin>>temp;
if(temp=='.') canwalk[i][j]=1;
else canwalk[i][j]=0;
}
bfs(0,0);
cout<<dis[r-1][c-1];
return 0;
}