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

@@ -8,7 +8,7 @@ import utils
 
 /* 基于邻接表实现的无向图类 */
 public class GraphAdjList {
-    // 邻接表，key: 顶点，value：该顶点的所有邻接顶点
+    // 邻接表，key：顶点，value：该顶点的所有邻接顶点
     public private(set) var adjList: [Vertex: [Vertex]]
 
     /* 构造方法 */

codes/swift/chapter_graph/graph_adjacency_matrix.swift

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

codes/swift/chapter_graph/graph_bfs.swift

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

codes/swift/chapter_graph/graph_dfs.swift

@@ -14,7 +14,7 @@ func dfs(graph: GraphAdjList, visited: inout Set<Vertex>, res: inout [Vertex], v
     // 遍历该顶点的所有邻接顶点
     for adjVet in graph.adjList[vet] ?? [] {
         if visited.contains(adjVet) {
-            continue // 跳过已被访问过的顶点
+            continue // 跳过已被访问的顶点
         }
         // 递归访问邻接顶点
         dfs(graph: graph, visited: &visited, res: &res, vet: adjVet)