全文转自:http://blog.csdn.net/that163/article/details/8069780 http://blog.csdn.net/that163/article/details/8069764
给定一个迷宫,入口为左上角,出口为右下角,问是否有路径从入口到出口,若有则输出一条这样的路径。注意移动可以从上、下、左、右、上左、上右、下左、下右八个方向进行。迷宫输入0表示可走,输入1表示墙。易得可以用1将迷宫围起来避免边界问题。
本题采用DFS算法给出解。
- /*
- 迷宫问题(八方向)
- input:
- 1
- 6 8
- 0 1 1 1 0 1 1 1
- 1 0 1 0 1 0 1 0
- 0 1 0 0 1 1 1 1
- 0 1 1 1 0 0 1 1
- 1 0 0 1 1 0 0 0
- 0 1 1 0 0 1 1 0
- output:
- YES
- (1,1) (2,2) (3,1) (4,1) (5,2) (5,3) (6,4) (6,5) (5,6) (4,5) (4,6) (5,7) (5,8) (6,8) (递归)
- (1,1) (2,2) (3,3) (3,4) (4,5) (5,6) (5,7) (6,8) (栈)
- */
- #include<iostream>
- #include<stack>
- using namespace std;
- struct point{
- int x;
- int y;
- };
- int **Maze;
- stack<point> sp;
- point move[8]={{-1,-1},{-1,0},{-1,1},{0,-1},{0,1},{1,-1},{1,0},{1,1}};
- void Create(int row,int column){
- //创建迷宫,注意到用0表示可走,1表示墙,将整个输入的迷宫再用墙围着,处理的时候就不用特别注意边界问题
- int i,j;
- for(i=0; i<row+2; i++)
- 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++){
- cin>>Maze[i][j];
- }
- }
- }
- /*
- bool MazePath(int row,int column,int x,int y){
- //判断是否有路径从入口到出口,保存该路径(递归)
- Maze[x][y] = -1;
- point temp;
- temp.x = x;
- temp.y = y;
- sp.push(temp);
- for(int i=0; i<8; i++){
- if(x + move[i].x == row && y + move[i].y == column)return true;
- if(Maze[x + move[i].x][y + move[i].y] == 0){
- if(MazePath(row,column,x + move[i].x,y + move[i].y))return true;
- }
- }
- sp.pop();
- return false;
- }
- */
- bool MazePath(int row,int column,int x,int y){
- //判断是否有路径从入口到出口,保存该路径(栈)
- stack<point> save;
- bool flag;
- point now;
- now.x = x;
- now.y = y;
- save.push(now);
- while(!save.empty()){
- now = save.top();
- if(Maze[now.x][now.y] == 0){
- sp.push(now);
- Maze[now.x][now.y] = -1;
- }
- flag = true;
- for(int i=0; i<8; i++){
- if(now.x + move[i].x == row && now.y + move[i].y == column)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;
- save.push(temp);
- flag = false;
- }
- }
- if(flag){
- save.pop();
- sp.pop();
- }
- }
- }
- void PrintPath(int row,int column){
- //输出从入口到出口的路径
- point temp;
- temp.x = row;
- temp.y =column;
- stack<point> pp;
- pp.push(temp);
- while(!sp.empty()){
- temp = sp.top();
- sp.pop();
- pp.push(temp);
- }
- while(!pp.empty()){
- temp = pp.top();
- cout<<'('<<temp.x<<','<<temp.y<<')'<<' ';
- pp.pop();
- }
- cout<<endl;
- }
- int main(){
- int t,row,column;
- cin>>t;
- while(t--){
- cin>>row>>column;
- Maze = new int*[row + 2];
- for(int i=0; i<row+2; i++)Maze[i] = new int[column + 2];
- Create(row,column);
- if(MazePath(row,column,1,1)){
- cout<<"YES"<<endl;
- PrintPath(row,column);
- }
- else cout<<"NO"<<endl;
- }
- return 0;
- }
#include <iostream>
#include <string>
#include <vector>
#include <stack>
using namespace std;
struct point
{
int row;
int col;
};
int **maze; //迷宫矩阵
stack<point> path;
int direction[8][2] = {{-1, 0}, {1, 0}, {0, -1}, {0, 1}, {-1, -1}, {-1, 1}, {1, -1}, {1, 1}};
void CreateMaze(int row, int col)
{
for (int i = 0; i < row + 2; ++i)
maze[i][0] = maze[i][col + 1] = 1;
for (int i = 0; i < col + 2; ++i)
maze[0][i] = maze[row + 1][i] = 1;
for (int i = 1; i < row + 1; ++i)
{
for (int j = 1; j < col + 1; ++j)
{
cin >> maze[i][j];
}
}
}
//没有用到递归,而是用栈实现了DFS
bool FindMazePath(int row, int col, int n, int m)
{
if (n == row && m == col)
return true;
stack<point> cur; //保存当前深度的所有满足的点
point now;
bool flag; //当前栈的顶点是否需要删除
now.row = n, now.col = m;
cur.push(now);
while (! cur.empty())
{
now = cur.top();
if (maze[now.row][now.col] == 0)
{
path.push(now);
maze[now.row][now.col] = -1;
}
flag = true;
for (int i = 0; i < 8; ++i)
{
int n_n = now.row + direction[i][0];
int n_m = now.col + direction[i][1];
if (n_n == row && n_m == col)
return true;
if (maze[n_n][n_m] == 0)
{
point tmp;
tmp.row = n_n, tmp.col = n_m;
cur.push(tmp); //cur包含每一层的所有满足条件的点;DFS,故path里面只保存了一条路径
flag = false;
}
}
if (flag)
{
cur.pop();
path.pop();
}
}
}
void PrintPath(int row,int column)
{
//输出从入口到出口的路径
point temp;
temp.row = row;
temp.col =column;
stack<point> pp;
pp.push(temp);
while(!path.empty())
{
temp = path.top();
path.pop();
pp.push(temp);
}
while(!pp.empty())
{
temp = pp.top();
cout<<'('<<temp.row<<','<<temp.col<<')'<<' ';
pp.pop();
}
cout<<endl;
}
int main()
{
int row, col;
cin >> row >> col;
maze = new int*[row + 2];
for (int i = 0; i < row + 2; ++i)
maze[i] = new int[col + 2];
CreateMaze(row, col);
if (FindMazePath(row, col, 1, 1))
{
cout << "Yes" << endl;
PrintPath(row,col);
}
else cout<<"No"<<endl;
//system("pause");
return 0;
}
采用BFS算法给出解。注意,利用BFS算法给出的路径必然是一条最短路径。
- /*
- 迷宫问题(八方向)
- input:
- 1
- 6 8
- 0 1 1 1 0 1 1 1
- 1 0 1 0 1 0 1 0
- 0 1 0 0 1 1 1 1
- 0 1 1 1 0 0 1 1
- 1 0 0 1 1 0 0 0
- 0 1 1 0 0 1 1 0
- output:
- YES
- (1,1) (2,2) (3,3) (3,4) (4,5) (4,6) (5,7) (6,8)
- */
- #include<iostream>
- #include<queue>
- #include<stack>
- 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}}; //移动方向,横竖斜都可以,八个方向
- void Create(int row,int column){
- //创建迷宫,注意到用0表示可走,1表示墙,将整个输入的迷宫再用墙围着,处理的时候就不用特别注意边界问题
- int i,j;
- for(i=0; i<row+2; i++)
- 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++){
- cin>>Maze[i][j];
- }
- }
- }
- 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];
- }
- cout<<"(1,1)";
- while(!s.empty()){
- temp = s.top();
- cout<<' '<<'('<<temp.x<<','<<temp.y<<')';
- s.pop();
- }
- cout<<endl;
- }
- int main(){
- int t; //用例数量
- int row; //迷宫行数
- int column; //迷宫列数
- cin>>t;
- while(t--){
- cin>>row>>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];
- }
- Create(row,column);
- if(MazePath(row,column,1,1)){
- cout<<"YES"<<endl;
- PrintPath(row,column);
- }
- else cout<<"NO"<<endl;
- }
- return 0;
- }
我的理解:DFS和BFS
DFS是深度优先,每一层找到一个满足的节点就往下一层找,该层其他满足的节点(未找)稍后再找其下一层,也就是子层优先同层,不满足就删掉该节点,从最深处往上,找上一层满足的节点,栈就可以满足这样一个特性。实际上是 先进后出 的特性。
BFS是广度优先,每一层找到所有满足的节点,对每个节点,再下一层,找到所有满足的节点,它是按照层遍历的,因此,需要把同层的其他满足的节点存储起来(或者说子层找到的满足条件的节点要等到上一层所有满足的节点做完同样的事情),因此,队列可以满足这样一个特性。实际上是 先进先出 的特性。
或者一个更加形象的例子,DFS就像要先满足儿子,后满足父亲的同辈(叔叔阿姨),这叫爱幼,后进先出的特性。BFS就像按辈分来,要等所有的叔叔阿姨吃饱了才轮到你吃,这叫尊老,是先进先出的特性。
还有为什么BFS找到的路径是最短路径?BFS是按照层来的,每层所有节点判断完全再往下一层,所以最先满足最终条件的节点,其深度最小,也就是路径最短。