深度优先和广度优先搜索
在对一个无向图进行遍历时,必须先画出该无向图的邻接矩阵。
DFS
class node
{
public:
int node_num;
int node_value;
};
#include<iostream>
#include"node.h"
using namespace std;
int dfs(int num_a);
//定义邻接矩阵
int matrix_a[7][7] =
{
{0,1,1,1,0,0,0},
{1,0,0,1,0,1,0},
{1,0,0,1,0,0,0},
{1,1,1,0,1,0,0},
{0,0,0,1,0,0,1},
{0,1,0,0,0,0,1},
{0,0,0,0,1,1,0}
};
//定义点的矩阵
node matrix_node[7];
int main(void)
{
for (int i = 0;i < 7;i++)
{
matrix_node[i].node_num = i;
matrix_node[i].node_value = 0;
}
//执行dfs算法
int begin_a;
cin >> begin_a;
matrix_node[begin_a].node_value = 1;
cout << "dfs的结果为:" << endl;
cout << begin_a << endl;
dfs(begin_a);
return 0;
}
int dfs(int num_a)
{
for (int i = 0;i < 7;i++)
{
//判断该点与num_a是否连接,该点是否被遍历过
if (matrix_a[num_a][i] == 1 && matrix_node[i].node_value == 0)
{
cout << matrix_node[i].node_num << endl;
matrix_node[i].node_value = 1;
dfs(i);
}
}
return 0;
}
BFS
class node
{
public:
int node_num;
int node_value;
};
#include<iostream>
#include"node.h"
#include<vector>
using namespace std;
int bfs(vector<int>save_node);
node matrix_node[7];
//定义邻接矩阵
int matrix_a[7][7] =
{
{0,1,1,1,0,0,0},
{1,0,0,1,0,1,0},
{1,0,0,1,0,0,0},
{1,1,1,0,1,0,0},
{0,0,0,1,0,0,1},
{0,1,0,0,0,0,1},
{0,0,0,0,1,1,0}
};
//vector类
vector<int>save_node;
int main(void)
{
for (int i=0;i<7;i++)
{
matrix_node[i].node_num = i;
matrix_node[i].node_value = 0;
}
int begin_a;
cin >> begin_a;
cout << "广度优先遍历的结果为:" << endl;
cout << begin_a << endl;
matrix_node[begin_a].node_value = 1;
save_node.push_back(begin_a);
bfs(save_node);
return 0;
}
int bfs(vector<int> save_node)
{
vector<int>cur_node;
for (int j = 0;j < (int)save_node.size();j++)
{
for (int i = 0;i < 7;i++)
{
if (matrix_a[save_node[j]][i] == 1 && matrix_node[i].node_value == 0)
{
cout << i << endl;
cur_node.push_back(i);
matrix_node[i].node_value = 1;
}
}
}
if (cur_node.size() == 0)
{
return 0;
}
else
{
bfs(cur_node);
}
}
对于DFS来说:
0链接1,1链接2,2链接3,3链接4,4链接的是已经遍历过的点;
那么在3找,3还链接5,5链接6。
0-1-2-3-4-5-6
对于BFS来说:
0链接1,2,3;
2链接4,3链接5;
4链接的是已经遍历过的点,5链接6。
0-1-2-3-4-5-6