BFS 最短路径

---

#include <bits/stdc++.h>//最短路径 
using namespace std;
int a[100][100], v[100][100] = {0};
struct point{
	int x;
	int y;
	int step;
};
queue<point> r;
int dx[4] = {0, 1, 0, -1};
int dy[4] = {1, 0, -1, 0};
int main(){
	int h, w, startx, starty, p, q;
	cin >> h >> w;
	startx = starty = 1;//
	p = h;
	q = w;
	for(int i = 1; i <= h; i ++){
		for(int j = 1; j <= w; j ++){
			cin >> a[i][j];
		}
	}
	
	//BFS
	point start;
	start.x = startx;//起点 
	start.y = starty;
	start.step = 0;
	r.push(start);//将起点入队
	v[startx][starty] = 1;
	
	while(!r.empty()){
		int x = r.front().x, y = r.front().y;//取出队首坐标 
		if(x == p && y == q){//判断是否到达终点 
			cout << r.front().step;
			break;
		}
		for(int i = 0; i < 4; i ++){//若没到终点，则前进到下一格 
			int tx, ty;
			tx = x + dx[i];
			ty = y + dy[i];
			if(a[tx][ty] == 0/*可走的符号*/ && v[tx][ty] == 0/*没有被标记*/){
				//如果没有走过就将其新坐标和 step + 1 入队
				point temp;
				temp.x = tx;
				temp.y = ty;
				temp.step = r.front().step + 1;
				r.push(temp);
				v[tx][ty] = 1;//标记已被走过 
			}
		}
		r.pop();
	}
	return 0;
}