迷宫的最短路径(bfs方法)

题目来源：《挑战程序设计竞赛》

#include<iostream>
#include<queue>
using namespace std;
const int INF = 1000000;
typedef pair<int, int> P; //定义坐标
int len, wid;
int bfs(int startx, int starty, int endx, int endy, int dis[100][100], char maze[100][100])
{
	queue<P> que;
	que.push(P(startx, starty));
	int dx[10] = { -1, 0, 1, 0 }, dy[10] = { 0, 1, 0, -1 };
	int x = startx, y = starty;
	while (que.size())
	{
		P head = que.front();
		que.pop();
		if (head.first == endx && head.second == endy) break;
		for (int i = 0; i < 4; i++)
		{
			x = head.first + dx[i]; y = head.second + dy[i];
			if (maze[x][y] != '#' && dis[x][y] == INF && x >= 0 && x < len && y >= 0 && y < wid)
			{
				que.push(P(x, y));
				dis[x][y] = dis[head.first][head.second] + 1;
				cout << "dis[" <<x << "][" <<y << "] = " << dis[x][y] << endl;
			}
		}
	}
	return dis[endx][endy];
}

int main()
{

	int startx, starty, endx, endy;
	char maze[100][100];
	int dis[100][100];
	cout << "请输入长和宽：" << endl;
	cin >> len >> wid;
	cout << "请输入迷宫" << endl;
	for (int i = 0; i < len; i++)
	{
		for (int j = 0; j < wid; j++)
		{
			cin >> maze[i][j];
			dis[i][j] = INF;
			if (maze[i][j] == 'S') { startx = i; starty = j; dis[i][j] = 0; }
			if (maze[i][j] == 'G') { endx = i; endy = j; }
		}
	}
	//cout << startx << starty << endx << endy << endl;
	cout << "最短长度为：" << endl;
	int roadlen = bfs(startx, starty, endx, endy, dis, maze);
	cout << roadlen << endl;
	


	return 0;
}