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/c/chapter_graph/graph_bfs.c

@@ -66,7 +66,7 @@ void graphBFS(GraphAdjList *graph, Vertex *startVet, Vertex **res, int *resSize,
         // 遍历该顶点的所有邻接顶点
         AdjListNode *node = findNode(graph, vet);
         while (node != NULL) {
-            // 跳过已被访问过的顶点
+            // 跳过已被访问的顶点
             if (!isVisited(visited, *visitedSize, node->vertex)) {
                 enqueue(queue, node->vertex);             // 只入队未访问的顶点
                 visited[(*visitedSize)++] = node->vertex; // 标记该顶点已被访问

codes/c/chapter_graph/graph_dfs.c

@@ -27,7 +27,7 @@ void dfs(GraphAdjList *graph, Vertex **res, int *resSize, Vertex *vet) {
     // 遍历该顶点的所有邻接顶点
     AdjListNode *node = findNode(graph, vet);
     while (node != NULL) {
-        // 跳过已被访问过的顶点
+        // 跳过已被访问的顶点
         if (!isVisited(res, *resSize, node->vertex)) {
             // 递归访问邻接顶点
             dfs(graph, res, resSize, node->vertex);