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

@@ -16,7 +16,7 @@ class GraphAdjList:
 
     def __init__(self, edges: list[list[Vertex]]):
         """构造方法"""
-        # 邻接表，key: 顶点，value：该顶点的所有邻接顶点
+        # 邻接表，key：顶点，value：该顶点的所有邻接顶点
         self.adj_list = dict[Vertex, list[Vertex]]()
         # 添加所有顶点和边
         for edge in edges:

codes/python/chapter_graph/graph_adjacency_matrix.py

@@ -62,7 +62,7 @@ class GraphAdjMat:
         # 索引越界与相等处理
         if i < 0 or j < 0 or i >= self.size() or j >= self.size() or i == j:
             raise IndexError()
-        # 在无向图中，邻接矩阵沿主对角线对称，即满足 (i, j) == (j, i)
+        # 在无向图中，邻接矩阵关于主对角线对称，即满足 (i, j) == (j, i)
         self.adj_mat[i][j] = 1
         self.adj_mat[j][i] = 1
 

codes/python/chapter_graph/graph_bfs.py

@@ -29,7 +29,7 @@ def graph_bfs(graph: GraphAdjList, start_vet: Vertex) -> list[Vertex]:
         # 遍历该顶点的所有邻接顶点
         for adj_vet in graph.adj_list[vet]:
             if adj_vet in visited:
-                continue  # 跳过已被访问过的顶点
+                continue  # 跳过已被访问的顶点
             que.append(adj_vet)  # 只入队未访问的顶点
             visited.add(adj_vet)  # 标记该顶点已被访问
     # 返回顶点遍历序列

codes/python/chapter_graph/graph_dfs.py

@@ -19,7 +19,7 @@ def dfs(graph: GraphAdjList, visited: set[Vertex], res: list[Vertex], vet: Verte
     # 遍历该顶点的所有邻接顶点
     for adjVet in graph.adj_list[vet]:
         if adjVet in visited:
-            continue  # 跳过已被访问过的顶点
+            continue  # 跳过已被访问的顶点
         # 递归访问邻接顶点
         dfs(graph, visited, res, adjVet)