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

@@ -8,7 +8,7 @@ namespace hello_algo.chapter_graph;
 
 /* 基于邻接表实现的无向图类 */
 public class GraphAdjList {
-    // 邻接表，key: 顶点，value：该顶点的所有邻接顶点
+    // 邻接表，key：顶点，value：该顶点的所有邻接顶点
     public Dictionary<Vertex, List<Vertex>> adjList;
 
     /* 构造函数 */

codes/csharp/chapter_graph/graph_adjacency_matrix.cs

@@ -68,7 +68,7 @@ class GraphAdjMat {
         // 索引越界与相等处理
         if (i < 0 || j < 0 || i >= Size() || j >= Size() || i == j)
             throw new IndexOutOfRangeException();
-        // 在无向图中，邻接矩阵沿主对角线对称，即满足 (i, j) == (j, i)
+        // 在无向图中，邻接矩阵关于主对角线对称，即满足 (i, j) == (j, i)
         adjMat[i][j] = 1;
         adjMat[j][i] = 1;
     }

codes/csharp/chapter_graph/graph_bfs.cs

@@ -23,7 +23,7 @@ public class graph_bfs {
             res.Add(vet);               // 记录访问顶点
             foreach (Vertex adjVet in graph.adjList[vet]) {
                 if (visited.Contains(adjVet)) {
-                    continue;          // 跳过已被访问过的顶点
+                    continue;          // 跳过已被访问的顶点
                 }
                 que.Enqueue(adjVet);   // 只入队未访问的顶点
                 visited.Add(adjVet);   // 标记该顶点已被访问

codes/csharp/chapter_graph/graph_dfs.cs

@@ -14,7 +14,7 @@ public class graph_dfs {
         // 遍历该顶点的所有邻接顶点
         foreach (Vertex adjVet in graph.adjList[vet]) {
             if (visited.Contains(adjVet)) {
-                continue; // 跳过已被访问过的顶点                             
+                continue; // 跳过已被访问的顶点                             
             }
             // 递归访问邻接顶点
             DFS(graph, visited, res, adjVet);