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

@@ -10,7 +10,7 @@ use std::collections::HashMap;
 
 /* 基于邻接表实现的无向图类型 */
 pub struct GraphAdjList {
-    // 邻接表，key: 顶点，value：该顶点的所有邻接顶点
+    // 邻接表，key：顶点，value：该顶点的所有邻接顶点
     pub adj_list: HashMap<Vertex, Vec<Vertex>>,
 }
 

codes/rust/chapter_graph/graph_adjacency_matrix.rs

@@ -72,7 +72,7 @@ impl GraphAdjMat {
         if i >= self.size() || j >= self.size() || i == j {
             panic!("index error")
         }
-        // 在无向图中，邻接矩阵沿主对角线对称，即满足 (i, j) == (j, i)
+        // 在无向图中，邻接矩阵关于主对角线对称，即满足 (i, j) == (j, i)
         self.adj_mat[i][j] = 1;
         self.adj_mat[j][i] = 1;
     }

codes/rust/chapter_graph/graph_bfs.rs

@@ -29,7 +29,7 @@ fn graph_bfs(graph: GraphAdjList, start_vet: Vertex) -> Vec<Vertex> {
         if let Some(adj_vets) = graph.adj_list.get(&vet) {
             for &adj_vet in adj_vets {
                 if visited.contains(&adj_vet) {
-                    continue; // 跳过已被访问过的顶点
+                    continue; // 跳过已被访问的顶点
                 }
                 que.push_back(adj_vet); // 只入队未访问的顶点
                 visited.insert(adj_vet); // 标记该顶点已被访问

codes/rust/chapter_graph/graph_dfs.rs

@@ -18,7 +18,7 @@ fn dfs(graph: &GraphAdjList, visited: &mut HashSet<Vertex>, res: &mut Vec<Vertex
     if let Some(adj_vets) = graph.adj_list.get(&vet) {
         for &adj_vet in adj_vets {
             if visited.contains(&adj_vet) {
-                continue; // 跳过已被访问过的顶点
+                continue; // 跳过已被访问的顶点
             }
             // 递归访问邻接顶点
             dfs(graph, visited, res, adj_vet);