图的广度优先搜索

#include
#include
int count;
char room[20][20];
int reached[20][20];
int m,n;
void move(int x,int y){
    //printf("x%d,y%d,room[%d][%d]%c\n",x,y,x,y,room[x][y]);
    if(x>=0&&x=0&&y

https://www.nowcoder.com/practice/5017fd2fc5c84f78bbaed4777996213a?tpId=3&&tqId=10879&rp=1&ru=/activity/oj&qru=/ta/hackathon/question-ranking

你可能感兴趣的:(图的广度优先搜索)