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/javascript/chapter_graph/graph_adjacency_list.js

@@ -8,7 +8,7 @@ const { Vertex } = require('../modules/Vertex');
 
 /* 基于邻接表实现的无向图类 */
 class GraphAdjList {
-    // 邻接表，key: 顶点，value：该顶点的所有邻接顶点
+    // 邻接表，key：顶点，value：该顶点的所有邻接顶点
     adjList;
 
     /* 构造方法 */

codes/javascript/chapter_graph/graph_adjacency_matrix.js

@@ -69,7 +69,7 @@ class GraphAdjMat {
         if (i < 0 || j < 0 || i >= this.size() || j >= this.size() || i === j) {
             throw new RangeError('Index Out Of Bounds Exception');
         }
-        // 在无向图中，邻接矩阵沿主对角线对称，即满足 (i, j) === (j, i)
+        // 在无向图中，邻接矩阵关于主对角线对称，即满足 (i, j) === (j, i)
         this.adjMat[i][j] = 1;
         this.adjMat[j][i] = 1;
     }

codes/javascript/chapter_graph/graph_bfs.js

@@ -24,7 +24,7 @@ function graphBFS(graph, startVet) {
         // 遍历该顶点的所有邻接顶点
         for (const adjVet of graph.adjList.get(vet) ?? []) {
             if (visited.has(adjVet)) {
-                continue; // 跳过已被访问过的顶点
+                continue; // 跳过已被访问的顶点
             }
             que.push(adjVet); // 只入队未访问的顶点
             visited.add(adjVet); // 标记该顶点已被访问

codes/javascript/chapter_graph/graph_dfs.js

@@ -15,7 +15,7 @@ function dfs(graph, visited, res, vet) {
     // 遍历该顶点的所有邻接顶点
     for (const adjVet of graph.adjList.get(vet)) {
         if (visited.has(adjVet)) {
-            continue; // 跳过已被访问过的顶点
+            continue; // 跳过已被访问的顶点
         }
         // 递归访问邻接顶点
         dfs(graph, visited, res, adjVet);