图的基础知识（定义、深度优先遍历和宽度优先遍历）

图(Graph)

定义

由顶点的有穷非空集合和顶点之间边的集合组成，通常表示为：G(V, E)，其中，G表示一个图，V是图G中顶点的集合，E是图G中边的集合。
图分为无向图与有向图，根据有无图的边长，又分为带权图与不带权图。

如下图：

邻接矩阵表示：

#include <stdio.h>

int main(){
	const int MAX_N = 5; //一共5个顶点
	int Graph[MAX_N][MAX_N] = {0}; //使用邻接矩阵
	Graph[0][2] = 1; //将图连通，且不带权
	Graph[0][4] = 1; //一般用邻接矩阵表示稠密图
	Graph[1][0] = 1;
	Graph[1][2] = 1;
	Graph[2][3] = 1;
	Graph[3][4] = 1;
	Graph[4][3] = 1;
	printf("Graph:\n");
	for (int i = 0; i < MAX_N; i++){
		for (int j = 0; j < MAX_N; j++){
			printf("%d ", Graph[i][j]);
		}
		printf("\n");
	}
	return 0;
}

邻接表表示：

#include <stdio.h>
#include <vector>

struct GraphNode{ //图的邻接表数据结构
	int label; //图的顶点值
	std::vector<GraphNode *> neighbors; //相邻节点指针数组
	GraphNode(int x) : label(x) {};
};

int main(){	
	const int MAX_N = 5;
	GraphNode *Graph[MAX_N]; //5个顶点
	
	for (int i = 0; i < MAX_N; i++){
		Graph[i] = new GraphNode(i);
	}
	
	Graph[0]->neighbors.push_back(Graph[2]);
	Graph[0]->neighbors.push_back(Graph[4]);
	Graph[1]->neighbors.push_back(Graph[0]);
	Graph[1]->neighbors.push_back(Graph[2]);
	Graph[2]->neighbors.push_back(Graph[3]);
	Graph[3]->neighbors.push_back(Graph[4]);
	Graph[4]->neighbors.push_back(Graph[3]);
	
	printf("Graph:\n");
	for (int i = 0; i < MAX_N; i++){
		printf("Label(%d) : ", i);
		for (int j = 0; j < Graph[i]->neighbors.size(); j++){
			printf("%d ", Graph[i]->neighbors[j]->label);
		}
		printf("\n");
	}
	
	for (int i = 0; i < MAX_N; i++){
		delete Graph[i];
	}
	
	return 0;
}

深度优先遍历

从图中的某个顶点出发，首先访问该顶点，然后依次从它的各个未访问的邻接点出发深度优先搜索遍历图，直至图中所有和开始的顶点有路径相同且未被访问的顶点都被访问到。若此时尚有顶点未被访问到，则另选一个未被访问到的顶点作为起始点，重复上述过程，直至所有的顶点都被访问到。
过程展示如下：

#include <stdio.h>
#include <vector>

struct GraphNode{
	int label;
	std::vector<GraphNode *> neighbors;
	GraphNode(int x) : label(x) {};
};

void DFS_graph(GraphNode *node, int visit[]){
	visit[node->label] = 1; //标记为已访问的的顶点
	printf("%d ", node->label);
	for (int i = 0; i < node->neighbors.size(); i++){
		if (visit[node->neighbors[i]->label] == 0){ //访问相邻的且没有被访问的顶点
			DFS_graph(node->neighbors[i], visit);
		}
	}
} 

int main(){
	const int MAX_N = 5;
	GraphNode *Graph[MAX_N];	
	for (int i = 0; i < MAX_N; i++){
		Graph[i] = new GraphNode(i);
	}
	
	Graph[0]->neighbors.push_back(Graph[4]);
	Graph[0]->neighbors.push_back(Graph[2]);	
	Graph[1]->neighbors.push_back(Graph[0]);
	Graph[1]->neighbors.push_back(Graph[2]);
	Graph[2]->neighbors.push_back(Graph[3]);
	Graph[3]->neighbors.push_back(Graph[4]);
	Graph[4]->neighbors.push_back(Graph[3]);
	
	int visit[MAX_N] = {0};
	for (int i = 0; i < MAX_N; i++){
		if (visit[i] == 0){
			printf("From label(%d) : ", Graph[i]->label);
			DFS_graph(Graph[i], visit);
			printf("\n");
		}
	}
	
	for (int i = 0; i < MAX_N; i++){
		delete Graph[i];
	}
	
	return 0;
}

图的宽度优先遍历

从某个顶点出发，在访问了该顶点之后依次访问它的各个未曾访问过的邻接点，然后分别从这些邻接点出发依次访问他们的邻接点，并使得“先被访问的顶点的邻接点先于后被访问的顶点的邻接点被访问”，直至图中所有已被访问的顶点的邻接点都被访问到。若此时图中尚有未被访问到的顶点，则需要另选一个未曾访问过的顶点作为新的起始点，重复上述操作，直至图中所有顶点都被访问到为止。
过程展示如下：

实现代码如下：

#include <stdio.h>
#include <vector>
#include <queue>

struct GraphNode{
	int label;
	std::vector<GraphNode *> neighbors;
	GraphNode(int x) : label(x) {};
};

void BFS_graph(GraphNode *node, int visit[]){
	std::queue<GraphNode *> Q;
	Q.push(node);
	visit[node->label] = 1;
	while(!Q.empty()){ //宽度优先搜索使用队列，队列不空即一直循环
		GraphNode *node = Q.front();
		Q.pop();
		printf("%d ", node->label);
		for (int i = 0; i < node->neighbors.size(); i++){
			if (visit[node->neighbors[i]->label] == 0){
				Q.push(node->neighbors[i]);
				visit[node->neighbors[i]->label] = 1;
			}
		}
	}
}

int main(){
	const int MAX_N = 5;
	GraphNode *Graph[MAX_N];
	for (int i = 0; i < MAX_N; i++){
		Graph[i] = new GraphNode(i);
	} //添加图的边，需注意添加边的顺序
	
	Graph[0]->neighbors.push_back(Graph[4]);
	Graph[0]->neighbors.push_back(Graph[2]);
	Graph[1]->neighbors.push_back(Graph[0]);
	Graph[1]->neighbors.push_back(Graph[2]);
	Graph[2]->neighbors.push_back(Graph[3]);
	Graph[3]->neighbors.push_back(Graph[4]);
	Graph[4]->neighbors.push_back(Graph[3]);
	
	int visit[MAX_N] = {0};
	for (int i = 0; i < MAX_N; i++){
		if (visit[i] == 0){
			printf("From label(%d) : ", Graph[i]->label);
			BFS_graph(Graph[i], visit);
			printf("\n");
		}
	}
	
	for (int i = 0; i < MAX_N; i++){
		delete Graph[i];
	}
	
	return 0;
}

致谢

本章知识点和思路由小象学院相关视频提供，由本人学习并梳理得出，希望自己加深记忆的同时，也能给大家提供更多有关于一些算法的知识点。
你的点赞、评论、收藏就是对我最大的支持与鼓励，谢谢！