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

@@ -8,7 +8,7 @@ import '../utils/vertex.dart';
 
 /* 基于邻接表实现的无向图类 */
 class GraphAdjList {
-  // 邻接表，key: 顶点，value：该顶点的所有邻接顶点
+  // 邻接表，key：顶点，value：该顶点的所有邻接顶点
   Map<Vertex, List<Vertex>> adjList = {};
 
   /* 构造方法 */

codes/dart/chapter_graph/graph_adjacency_matrix.dart

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

codes/dart/chapter_graph/graph_bfs.dart

@@ -27,7 +27,7 @@ List<Vertex> graphBFS(GraphAdjList graph, Vertex startVet) {
     // 遍历该顶点的所有邻接顶点
     for (Vertex adjVet in graph.adjList[vet]!) {
       if (visited.contains(adjVet)) {
-        continue; // 跳过已被访问过的顶点
+        continue; // 跳过已被访问的顶点
       }
       que.add(adjVet); // 只入队未访问的顶点
       visited.add(adjVet); // 标记该顶点已被访问

codes/dart/chapter_graph/graph_dfs.dart

@@ -19,7 +19,7 @@ void dfs(
   // 遍历该顶点的所有邻接顶点
   for (Vertex adjVet in graph.adjList[vet]!) {
     if (visited.contains(adjVet)) {
-      continue; // 跳过已被访问过的顶点
+      continue; // 跳过已被访问的顶点
     }
     // 递归访问邻接顶点
     dfs(graph, visited, res, adjVet);