Update the book based on the revised second edition (#1014)

* Revised the book

* Update the book with the second revised edition

* Revise base on the manuscript of the first edition

codes/rust/chapter_graph/graph_bfs.rs

@@ -10,7 +10,7 @@ use std::collections::{HashSet, VecDeque};
 use graph_adjacency_list::GraphAdjList;
 use graph_adjacency_list::{Vertex, vets_to_vals, vals_to_vets};
 
-/* 广度优先遍历 BFS */
+/* 广度优先遍历 */
 // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
 fn graph_bfs(graph: GraphAdjList, start_vet: Vertex) -> Vec<Vertex> {
     // 顶点遍历序列
@@ -62,7 +62,7 @@ fn main() {
     println!("\n初始化后，图为");
     graph.print();
 
-    /* 广度优先遍历 BFS */
+    /* 广度优先遍历 */
     let res = graph_bfs(graph, v[0]);
     println!("\n广度优先遍历（BFS）顶点序列为");
     println!("{:?}", vets_to_vals(res));