预备知识：图的深度/广度优先遍历

深度优先遍历

//
// Created by YaMiwan on 2020-05-07.
//


#include <iostream>
#include <vector>

using namespace std;


struct GraphNode {  // 图的邻接表数据结构
    int label;  // 图的顶点的值
    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[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]);

    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;
}

From label[0]:0 2 3 4
From label[1]:1

广度优先遍历

//
// Created by YaMiwan on 2020-05-07.
//


#include <iostream>
#include <vector>
#include <queue>

using namespace std;


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

    GraphNode(int x) : label(x) {};
};

// 图广度优先遍历
void BFS_graph(GraphNode *node, int *visit){
    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[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]);

    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;
}

From label[0]:0 2 4 3
From label[1]:1