BFS迷宫搜索路径

#include<graphics.h>
#include<stdlib.h>
#include<conio.h>
#include<time.h>
#include<vector>
#include<queue> 
#include<stack> 
#include<iostream>
#include <algorithm>

using namespace std;

struct point{ 
    //横坐标纵坐标 
    int x; 
    int y; 
}; 
int **Maze;     //初始化迷宫 
point **Pre;    //保存任意点在路径中的前一步 
point move[8]={{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}}; //移动方向，横竖斜都可以，八个方向 
char s1[]="YES";
char s2[]="NO";

void create_line(int row ,int  column)//划线
{
  int x, y;  // 画格子
   for (x=0; x<=10*(row+2); x+=10)
        for (y=0; y<=10*(column+2); y+=10)
        {
            line(x, 0, x, 10*(column+2));
            line(0, y,10*(row+2), y);
        }
}


void CreateTable(int row,int column)//初始化创建迷宫障碍区
{
    int i,j;
    srand((unsigned int)time(NULL));
    for(i=0; i<row+2; i++)//创建迷宫，注意到用0表示可走，1表示墙，将整个输入的迷宫再用墙围着，处理的时候就不用特别注意边界问题 
    {
        Maze[i][0] = Maze[i][column+1] = 1; 
    }
    for(j=0; j<column+2; j++) 
    {
        Maze[0][j] = Maze[row+1][j] = 1;       
    }

    for(i=1;i<=row;i++)
     for(j=1;j<=column;j++)
        {
             Maze[i][j]=rand()%2;
        }

   for(i=1;i<=row;i++)
     for(j=1;j<=column;j++)
        {
             if(Maze[i][j]==1)
            Maze[i][j]=rand()%2;
        }

    for(i=0;i<=row+1;i++)
     for(j=0;j<=column+1;j++)
     {
         if(Maze[i][j]==1)
        {
         setfillcolor(WHITE);
         fillrectangle(10*j,(10+10*i),(10+10*j),10*i);
        }
     }
}

bool MazePath(int row,int column,int x,int y){ 
    //判断是否有路径从入口到出口，保存该路径（队列） 
    if(x == row && y == column)return true; 
    queue<point> q;     //用于广度优先搜索 
    point now;          //当前位置 
    now.x = x; 
    now.y = y; 
    q.push(now); 
    Maze[now.x][now.y] = -1; 
    while(!q.empty()){ 
        now = q.front(); 
        q.pop(); 
        for(int i=0; i<8; i++){ 
            if(now.x + move[i].x == row && now.y + move[i].y == column){ 
                Maze[now.x + move[i].x][now.y + move[i].y] = -1; 
                Pre[row][column] = now; 
                return true; 
            } 
            if(Maze[now.x + move[i].x][now.y + move[i].y] == 0){ 
                point temp;     //下个位置 
                temp.x = now.x + move[i].x; 
                temp.y = now.y + move[i].y; 
                q.push(temp); 
                Maze[temp.x][temp.y] = -1; 
                Pre[temp.x][temp.y] = now; 

            } 
        } 
    } 
    return false; 
} 


void PrintPath(int row,int column){ 
    //输出最短路径 
    point temp;         //保存位置 
    stack<point> s;     //保存路径序列 
    temp.x = row; 
    temp.y = column; 
    while(temp.x != 1 || temp.y != 1){ 
        s.push(temp); 
        temp = Pre[temp.x][temp.y]; 
    } 
       setfillcolor(YELLOW);
       fillrectangle(10*1,(10+10*1),(10+10*1),10*1);
    while(!s.empty()){ 
        temp = s.top(); 
        setfillcolor(YELLOW);
        fillrectangle(10*temp.y,(10+10*temp.x),(10+10*temp.y),10*temp.x);
        s.pop(); 
    } 
    cout<<endl; 
}

void result(int row,int column)
{
  if(MazePath(row,column,1,1))
  { 
            //outtextxy(320,320,s1);
            PrintPath(row,column); 
  } 
        else outtextxy(320,320,s2);
}

void Init(int row,int column)
{
 Maze = new int*[row + 2]; 
 Pre = new point*[row + 2]; 
 for(int i=0; i<row+2; i++)
 { 
 Maze[i] = new int[column + 2]; 
 Pre[i] = new point[column + 2]; 
 }
}

void main()
{
int row,column;
cin>>row>>column;
Init(row,column);
initgraph(640,640);
BeginBatchDraw();
setlinecolor(GREEN);//设置字体颜色
create_line(column,row);
CreateTable(row,column);
result(row,column);
FlushBatchDraw();
EndBatchDraw();
getch();
closegraph();
}