算法BFS
宽度优先搜索算法(又称广度优先搜索)是最简便的图的搜索算法之一,这一算法也是很多重要的图的算法的原型。Dijkstra单源最短路径算法和Prim最小生成树算法都采用了和宽度优先搜索类似的思想。其别名又叫BFS,属于一种盲目搜寻法,目的是系统地展开并检查图中的所有节点,以找寻结果。换句话说,它并不考虑结果的可能位置,彻底地搜索整张图,直到找到结果为止。
算法:
1.将起点入队;
2.队首结点拓展的点入队;
如果没有拓展的点,将队首结点出队,重复该步骤,直到到达目标位置;
例题1:
坐标点(1,1)可以向坐标点(1,2)和(2,1)拓展,坐标点(1,2)和(2,1)只能向坐标点(2,2)拓展,当坐标点(1,1)可以向坐标点(1,2)和(2,1)拓展时,坐标点(1,2)和(2,1)入队,坐标点(1,1)出对,以此类推。
求坐标(1,1)—>(6,6)最短路径:
1代表障碍物,0代表可通行
001010
000000
110110
000100
011101
000000
用BFS解决例题1:
答案是:12
参考代码:
#include<iostream>
#include<queue>
#include<string>
using namespace std;
//地图
string MAP[6] =
{
"001010",
"000000",
"110110",
"000100",
"011101",
"000000"
};
//是否访问
bool vis[6][6];
//移动
int mv[4][2] = { {0,1},{1,0},{0,-1},{-1,0} };
struct node
{
int x;
int y;
int step;
node(int _x, int _y, int _step)
{
x = _x;
y = _y;
step = _step;
}
};
int main()
{
//定义队
queue<node>q;
//标记起点
vis[0][0] = true;
q.push(node(0, 0, 0));
//BFS
while (!q.empty()) //队空
{
node now = q.front();
q.pop();
if (now.x == 5 && now.y == 5)
{
cout << now.step << endl;
break;
}
for (int i = 0; i < 4; i++)
{
int tx = now.x + mv[i][0];
int ty = now.y + mv[i][1];
if (tx >= 0 && tx < 6 && ty >= 0 && ty < 6 && MAP[tx][ty] == '0' && !vis[tx][ty])
{
vis[tx][ty] = true;
q.push(node(tx, ty, now.step + 1));
}
}
}
return 0;
}
算法DFS
深度优先搜索属于图算法的一种,英文缩写为DFS即Depth First Search.其过程简要来说是对每一个可能的分支路径深入到不能再深入为止,而且每个节点只能访问一次.
举例说明之:下图是一个无向图,如果我们从A点发起深度优先搜索(以下的访问次序并不是唯一的,第二个点既可以是B也可以是C,D),则我们可能得到如下的一个访问过程:A->B->E(没有路了!回溯到A)->C->F->H->G->D(没有路,最终回溯到A,A也没有未访问的相邻节点,本次搜索结束)
深度优先遍历图的方法是,从图中某顶点v出发:
(1)访问顶点v;
(2)依次从v的未被访问的邻接点出发,对图进行深度优先遍历;直至图中和v有路径相通的顶点都被访问;
(3)若此时图中尚有顶点未被访问,则从一个未被访问的顶点出发,重新进行深度优先遍历,直到图中所有顶点均被访问过为止。
例题2:
先访问到从(1,1)–>(2,1)–>(3,1)–>……–>(6,6)访问一个点标记已访问,再返回去寻找最短路径
求坐标(1,1)—>(6,6)的最短路径:
1代表障碍物,0代表可通行
001101
010000
000010
011000
010010
000100
用DFS解决例题2:
参考代码:
#include<iostream>
#include<string>
using namespace std;
//地图
string MAP[6] =
{
"001101",
"010000",
"000010",
"011000",
"010010",
"000100"
};
int mv[4][2] = { {0,1},{1,0},{0,-1},{-1,0} };
bool vis[6][6];//true-->已访问,false-->未访问
int MIN = 99999;//给MIN赋一个比较大的值
void dfs(int x, int y, int step)
{
if (x == 5 && y == 5)
{
if (MIN > step) MIN = step;
return;
}
for (int i = 0; i < 4; i++)
{
int tx = x + mv[i][0];
int ty = y + mv[i][1];
if (ty >= 0 && ty < 6 && tx >= 0 && tx < 6 && MAP[tx][ty] == '0' && !vis[tx][ty])
{
vis[tx][ty] = true;
dfs(tx, ty, step + 1);
vis[tx][ty] = false;
}
}
}
int main()
{
//初值
vis[0][0] = true;
dfs(0, 0, 0);
cout << MIN << endl;
return 0;
}
第十届蓝桥杯 试题E:迷宫
用BFS解决:
答案:
DDDDRRURRRRRRDRRRRDDDLDDRDDDDDDDDDDDDRDDRRRURRUURRDDDDRDRRRRRRDRRURRDDDRRRRUURUUUUUUULULLUUUURRRRUULLLUUUULLUUULUURRURRURURRRDDRRRRRDDRRDDLLLDDRRDDRDDLDDDLLDDLLLDLDDDLDDRRRRRRRRRDDDDDDRR
参考代码:
#include<iostream>
#include<queue>
#include<string>
using namespace std;
int n = 30, m = 50;
bool vis[30][50];
int mv[4][2] = { {1,0},{0,1},{0,-1},{-1,0} };// D R L U 字典序
string Map[30]
{
"01010101001011001001010110010110100100001000101010",
"00001000100000101010010000100000001001100110100101",
"01111011010010001000001101001011100011000000010000",
"01000000001010100011010000101000001010101011001011",
"00011111000000101000010010100010100000101100000000",
"11001000110101000010101100011010011010101011110111",
"00011011010101001001001010000001000101001110000000",
"10100000101000100110101010111110011000010000111010",
"00111000001010100001100010000001000101001100001001",
"11000110100001110010001001010101010101010001101000",
"00010000100100000101001010101110100010101010000101",
"11100100101001001000010000010101010100100100010100",
"00000010000000101011001111010001100000101010100011",
"10101010011100001000011000010110011110110100001000",
"10101010100001101010100101000010100000111011101001",
"10000000101100010000101100101101001011100000000100",
"10101001000000010100100001000100000100011110101001",
"00101001010101101001010100011010101101110000110101",
"11001010000100001100000010100101000001000111000010",
"00001000110000110101101000000100101001001000011101",
"10100101000101000000001110110010110101101010100001",
"00101000010000110101010000100010001001000100010101",
"10100001000110010001000010101001010101011111010010",
"00000100101000000110010100101001000001000000000010",
"11010000001001110111001001000011101001011011101000",
"00000110100010001000100000001000011101000000110011",
"10101000101000100010001111100010101001010000001000",
"10000010100101001010110000000100101010001011101000",
"00111100001000010000000110111000000001000000001011",
"10000001100111010111010001000110111010101101111000"
};
struct Node {
int x;
int y;
int step;
string str;
Node(int _x, int _y, int _step, string _str)
{
x = _x;
y = _y;
step = _step;
str = _str;
}
};
int main()
{
queue<Node>q;
string s = "";
vis[0][0] = true;
q.push(Node(0, 0, 0, ""));
while (!q.empty())
{
Node now = q.front();
q.pop();
if (now.x == n - 1 && now.y == m - 1)
{
cout << now.str << endl;
}
for (int i = 0; i < 4; i++)
{
int tx = now.x + mv[i][0];
int ty = now.y + mv[i][1];
if (tx >= 0 && tx < n && ty >= 0 && ty < m && !vis[tx][ty] && Map[tx][ty] == '0')
{
if (i == 0)
{
s = "D";
}
else if (i == 1)
{
s = "R";
}
else if (i == 2)
{
s = "L";
}
else
{
s = "U";
}
vis[tx][ty] = true;
q.push(Node(tx, ty, now.step + 1, now.str + s));
}
}
}
return 0;
}
第八届蓝桥杯 试题D:方格分割
用DFS解决:
答案:509
参考代码:
#include <iostream>
#include<string>
using namespace std;
int ans = 0;
int mv[4][2] = { {1,0},{-1,0},{0,1},{0,-1} };
bool vis[8][8];
int MAP[8][8] = {0};
void dfs(int x, int y)
{
if (x == 0 || y == 0 || x == 6 || y == 6) {
ans++;
return;
}
for (int i = 0; i < 4; i++)
{
int tx = x + mv[i][0];
int ty = y + mv[i][1];
if (vis[tx][ty] == 0)
{
vis[tx][ty] = true;
vis[6 - tx][6 - ty] = true;
dfs(tx, ty);
vis[tx][ty] = 0;
vis[6 - tx][6 - ty] = 0;
}
}
}
int main()
{
vis[3][3] = true;
dfs(3, 3);
cout << ans / 4 << endl;
return 0;
}
总结:BFS和DFS是对整个地图进行遍历最后得到最短路径,可以这两个算法从最短路径延伸到其他的最优问题求解。