因为图一般存储结构有两种:
邻接矩阵
邻接表
本文基于邻接矩阵实现图的深度优先遍历
递归实现
#include <iostream>
#include<vector>
using namespace std;
int book[101], sum, n, e[101][101];
vector<char> vec;
void dfs(int cur)
{
int i;
cout << vec[cur-1] << " ";
sum++;//没访问一个节点sum就++
if (sum == n)return;//所有的顶点已经访问过直接退出
for (int i = 1; i <= n; i++)
{
//判断当前顶点cur到顶点i是否有边,并判断顶点i是否已经访问过
if (e[cur][i] == 1 && book[i] == 0)
{
book[i] = 1;
dfs(i);
}
}
return;
}
int main()
{
int i, j, m;
int a, b;
char c;
cout << "请输入图的全部结点(字符型式)" << endl;
while (cin >> c)
{
vec.push_back(c);
}
cin.clear();
cout << "请输入图的定点个数和弧的个数" << endl;
cin >> n >> m;
//初始化二维矩阵
for (i = 1; i <= n; i++)
for (j = 1; j <= n; j++)
if (i == j)e[i][j] = 0;
else e[i][j] = 0x3f;
cout << "请输入每个弧的两个顶点" << endl;
//读入顶点之间的弧
for (i = 1; i <= m; i++)
{
cin >> a >> b;
e[a][b] = 1;
e[b][a] = 1; //无向图需要将其对应的点的左边也赋值为1
}
//从顶点1出发
book[1] = 1;//标记一号顶点已经被访问
dfs(1);//从1号顶点开始遍历
cout << endl;
system("pause");
return 0;
}
非递归实现(用栈)
#include<iostream>
#include<stack>
#include<vector>
using namespace std;
#define MaxNode 20
#define MAX 2000
#define StartNode 1
int map[MaxNode + 1][MaxNode + 1];
vector<char> vec;
void dfs_stack(int start, int n)
{
int visited[MaxNode], s_top;
for (int i = 0; i < MaxNode; i++)
{
visited[i] = 0;
}
visited[start] = 1;
stack<int> s;
cout << vec[start-1] << " ";
for (int i = 1; i <= n; i++)//把起始点相连的结点压入栈
{
if (map[i][start] == 1 && !visited[i])
{
visited[i] = 1;
s.push(i);
}
}
while (!s.empty())
{
s_top = s.top();
visited[s_top] = 1;
cout << vec[s_top-1] << " ";
s.pop();//别忘了弹出
for (int i = 1; i <= n; i++)
{
if (map[i][s_top] == 1 && !visited[i])
{
visited[i] = 1;
s.push(i);
}
}
}
cout << endl;
}
int main(int argc, const char * argv[])
{
int num_edge, num_node;
int x, y;
char c;
cout << "请输入图的全部结点(字符型式)" << endl;
while (cin >> c)
{
vec.push_back(c);
}
cin.clear();
cout << "输入结点和弧数量" << endl;
cin >> num_node >> num_edge;
for (int i = 0; i < num_node; i++)
{
for (int j = 0; j < num_node; j++)
{
map[i][j] = 0;
}
}
cout << "请输入每个弧的两个节点" << endl;
for (int i = 1; i <= num_edge; i++)
{
cin >> x >> y;
map[x][y] = map[y][x] = 1;
}
dfs_stack(1, num_node);
system("pause");
return 0;
}
可见,对于相同的无权无向图,虽然都使用DFS,但是结果不一定相同!!