[Central South University of forestry science and technology] [Chen] week 7 innovation maze

C2    The innovation is entitled ： Maze game .  Yes 6*6 Of the lattice , Among them is 8 There's a barrier , You need to get from （1,1） To （6,6）, pass with flying colors , Find the minimum number of steps .
010000
000100
001001
100010
011000
000100
 

// Ouyang Lianzheng // Teacher, I'm watching videos , May be similar to your classmates , But I understand the concept , The video is the breadth maze .
#include<iostream>
#include<queue>
using namespace std;
int a[7][7], v[7][7];// Access array v
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()
{
          cout<<" Please enter several rows and columns ";
	int n, m,startx,starty,p,q;
	cin >> n >> m;
          cout<<"  Please enter the style of the maze ";
	for (int i = 1; i <= n; i++)
	{
		for (int j = 1; j <= m; j++)
		{
			cin >> a[i][j];

		}
	}
          cout<<" Please enter the starting and ending positions ";
	cin >> startx >> starty >> p >> q;

	point start;
	start.x = startx;
	start.y = starty;
	start.step = 0;
	r.push(start);// Join the team from the starting point 
	v[startx][starty] = 1;
	int flag = 0;
	while (!r.empty())
	{
		int x = r.front().x, y = r.front().y;
		if (x == p && y == q)
		{
			cout << r.front().step;
			break;
		}
		for (int k = 0; k <= 3; k++)
		{
			int tx, ty;
			tx = x + dx[k];
			ty = y + dy[k];
			if (a[tx][ty] == 1 && v[tx][ty] == 0)
			{
				// The team 
				point temp;
				temp.x = tx;
				temp.y = ty;
				temp.step = r.front().step + 1;
				r.push(temp);
				v[tx][ty] = 1;

			}
		}
		r.pop();
	}
	if (flag == 0)
	{
		cout << " The maze has no exit ";
	}
}