feat: Revised the book (#978)

* Sync recent changes to the revised Word.

* Revised the preface chapter

* Revised the introduction chapter

* Revised the computation complexity chapter

* Revised the chapter data structure

* Revised the chapter array and linked list

* Revised the chapter stack and queue

* Revised the chapter hashing

* Revised the chapter tree

* Revised the chapter heap

* Revised the chapter graph

* Revised the chapter searching

* Reivised the sorting chapter

* Revised the divide and conquer chapter

* Revised the chapter backtacking

* Revised the DP chapter

* Revised the greedy chapter

* Revised the appendix chapter

* Revised the preface chapter doubly

* Revised the figures

codes/cpp/chapter_graph/graph_adjacency_list.cpp

@@ -9,7 +9,7 @@
 /* 基于邻接表实现的无向图类 */
 class GraphAdjList {
   public:
-    // 邻接表，key: 顶点，value：该顶点的所有邻接顶点
+    // 邻接表，key：顶点，value：该顶点的所有邻接顶点
     unordered_map<Vertex *, vector<Vertex *>> adjList;
 
     /* 在 vector 中删除指定节点 */

codes/cpp/chapter_graph/graph_adjacency_matrix.cpp

@@ -65,7 +65,7 @@ class GraphAdjMat {
         if (i < 0 || j < 0 || i >= size() || j >= size() || i == j) {
             throw out_of_range("顶点不存在");
         }
-        // 在无向图中，邻接矩阵沿主对角线对称，即满足 (i, j) == (j, i)
+        // 在无向图中，邻接矩阵关于主对角线对称，即满足 (i, j) == (j, i)
         adjMat[i][j] = 1;
         adjMat[j][i] = 1;
     }

codes/cpp/chapter_graph/graph_bfs.cpp

@@ -25,7 +25,7 @@ vector<Vertex *> graphBFS(GraphAdjList &graph, Vertex *startVet) {
         // 遍历该顶点的所有邻接顶点
         for (auto adjVet : graph.adjList[vet]) {
             if (visited.count(adjVet))
-                continue;            // 跳过已被访问过的顶点
+                continue;            // 跳过已被访问的顶点
             que.push(adjVet);        // 只入队未访问的顶点
             visited.emplace(adjVet); // 标记该顶点已被访问
         }

codes/cpp/chapter_graph/graph_dfs.cpp

@@ -14,7 +14,7 @@ void dfs(GraphAdjList &graph, unordered_set<Vertex *> &visited, vector<Vertex *>
     // 遍历该顶点的所有邻接顶点
     for (Vertex *adjVet : graph.adjList[vet]) {
         if (visited.count(adjVet))
-            continue; // 跳过已被访问过的顶点
+            continue; // 跳过已被访问的顶点
         // 递归访问邻接顶点
         dfs(graph, visited, res, adjVet);
     }