在这个平台上重新复习一遍BFS代码#include
struct node{
int x;
int y;
int f;
int s;
};
int main(){
int a[100][100],book[100][100];
struct node que[100];
int head,tail;
int startx,starty,endx,endy;
int m,n,flag,i,j;
int tx,ty;
int next[4][2]={0,1,1,0,0,-1,-1,0};
head=tail=1;
scanf("%d %d",&m,&n);
for(i=1;i<=m;i++){
for(j=1;j<=n;j++){
scanf("%d",&a[i][j]);
}
}
scanf("%d %d %d %d",&startx,&starty,&endx,&endy);
book[startx][starty]=1;
que[tail].x=startx;
que[tail].y=starty;
que[tail].f=0;
que[tail].s=0;
tail++;
flag=0;
while(head
for(i=0;i<4;i++){
tx=que[head].x+next[i][0];
ty=que[head].y+next[i][1];
if(tx<1||ty<1||tx>m||ty>n){
continue;
}
if(a[tx][ty]==0&&book[tx][ty]==0){
book[tx][ty]==1;
que[tail].x=tx;
que[tail].y=ty;
que[tail].f=head;
que[tail].s=que[head].s+1;
tail++;
}
if(tx==endx&&ty==endy){
flag=1;
break;
}
}
if(flag==1){
break;
}
head++;
}
if(flag==1){
printf("%d",que[tail-1].s);//tail定义
}
else{
printf("此迷宫无路径到达终点!");
}
return 0;
}