数据结构：图（2. 图的遍历）

数据结构：图（2. 图的遍历）

图的遍历方式

1. 深度优先遍历DFS(Depth First Search)

2. 广度优先遍历BFS(Breadth First Search)

根据上一篇文章(数据结构：图（1. 图的存储）)的邻接矩阵和邻接表来分别实现对图的两种遍历

1. 邻接矩阵

graph.h 邻接矩阵头文件 添加以下代码

//添加头文件 STL的队列  #include<queue>

class graph
{
public:  //图的操作
	std::string DFS(const std::string v);  //深度优先遍历
	std::string BFS(const std::string v);  //广度优先遍历
private:
	std::vector<bool> visited; //是否访问过 
	std::string Result;
	void DFS(int pos);
};

graph.cpp 邻接矩阵的cpp代码实现以上函数

std::string graph::DFS(const std::string v) //深度优先 Depth First Search
{
	int pos = _getPos(v); //获取v的位置
	if (pos == -1) return std::string("Invalid start node!"); //无效的节点
	visited.resize(Vex.size(), false);
	for (int i = 0; i < visited.size(); ++i) visited[i] = false;
	visited[pos] = true; //v在最开始被访问
	Result = v + " "; //先访问第一个节点
	DFS(pos);
	return Result;
}
void graph::DFS(int pos)
{
	for (int i = 0; i < Vex.size(); ++i)
	{
		if (matrix[pos][i] != 0 && visited[i] == false)  //有边 且未被访问过
		{
			Result += Vex[i] + " ";
			visited[i] = true;
			DFS(i);
		}
	}
}

std::string graph::BFS(const std::string v) //广度优先 Breadth First Search
{
	int pos = _getPos(v); //获取v的位置
	if (pos == -1) return std::string("Invalid start node!"); //无效的节点
	visited.resize(Vex.size(), false);
	for (int i = 0; i < visited.size(); ++i) visited[i] = false;
	Result = v + " ";
	visited[pos] = true;
	std::queue<int> Q;
	Q.push(pos); //首个元素入队
	while (!Q.empty()) //队列不空
	{
		int nodeId = Q.front();
		Q.pop(); //出队
		for (int i = 0; i < Vex.size(); i++)
		{
			if (matrix[nodeId][i] != 0 && visited[i] == false)
			{
				Result += Vex[i] + " ";
				visited[i] = true;
				Q.push(i);
			}
		}
	}
	return Result;
}

2. 邻接表

Graph_linked.h 邻接矩阵头文件 添加以下代码

//添加头文件 STL的队列  #include<queue>

class Graph_linked
{
public:  //图的操作
	std::string DFS(const std::string v);  //深度优先遍历
	std::string BFS(const std::string v);  //广度优先遍历
private:
	std::vector<bool> visited; //是否访问过 
	std::string Result;
	void DFS(int pos);
};

函数实现

std::string Graph_linked::DFS(const std::string v)  //深度优先
{
	int pos = _getPos(v); //获取v的位置
	if (pos == -1) return std::string("Invalid start node!"); //无效的节点
	visited.resize(Vex.size(), false);
	for (int i = 0; i < visited.size(); ++i) visited[i] = false;
	visited[pos] = true; //v在最开始被访问
	Result = v + " "; //先访问第一个节点
	DFS(pos);
	return Result;
}
void Graph_linked::DFS(int pos)
{
	for (std::list<edge>::iterator it = edges[pos].begin(); it != edges[pos].end(); it++)
	{
		if (visited[it->adj] == false)
		{
			Result += Vex[it->adj] + " ";
			visited[it->adj] = true;
			DFS(it->adj);
		}
	}
}
std::string Graph_linked::BFS(const std::string v)  //广度优先
{
	int pos = _getPos(v); //获取v的位置
	if (pos == -1) return std::string("Invalid start node!"); //无效的节点
	visited.resize(Vex.size(), false);
	for (int i = 0; i < visited.size(); ++i) visited[i] = false;
	visited[pos] = true; //v在最开始被访问
	Result = v + " "; //先访问第一个节点
	std::queue<int> Q;
	Q.push(pos);
	while (!Q.empty())
	{
		int nodeId = Q.front();
		Q.pop();
		for (std::list<edge>::iterator it = edges[nodeId].begin(); it != edges[nodeId].end(); it++)
		{
			if (visited[it->adj] == false)
			{
				Result += Vex[it->adj] + " ";
				visited[it->adj] = true;
				Q.push(it->adj);
			}
		}
	}
	return Result;
}

3. 测试

main.cpp

void test3()
{
    //无向图 邻接矩阵表示
	graph g(9);
	g.AddNode("v0");
	g.AddNode("v1");
	g.AddNode("v2");
	g.AddNode("v3");
	g.AddNode("v4");
	g.AddNode("v5");
	g.AddNode("v6");
	g.AddNode("v7");
	g.AddNode("v8");
	g.Link("v0", "v1");
	g.Link("v0", "v2");
	g.Link("v1", "v3");
	g.Link("v1", "v4");
	g.Link("v2", "v5");
	g.Link("v2", "v6");
	g.Link("v5", "v6");
	g.Link("v7", "v3");
	g.Link("v7", "v4");
	g.Link("v7", "v8");
	cout << g.OutMatrix() << endl;
	cout << "深度优先搜索：" << g.DFS("v0") << endl;
	cout << "广度优先搜索：" << g.BFS("v0") << endl;
	
    //有向图 邻接表表示
	Graph_linked fg(5, Graph_linked::Directed);
	fg.AddNode("A");
	fg.AddNode("B");
	fg.AddNode("C");
	fg.AddNode("D");
	fg.AddNode("E");
	fg.Link("A", "B");
	fg.Link("B", "C");
	fg.Link("C", "A");
	fg.Link("A", "D");
	fg.Link("E", "A");
	fg.Link("A", "E");
	fg.Link("C", "E");
	cout << fg.OutTable() << endl;
	cout << "深度优先搜索：" << fg.DFS("A") << endl;
	cout << "广度优先搜索：" << fg.BFS("A") << endl;
}
int main()
{
	test3();
}

图1:

图2