From 93fb0075cc33a2e0bd07547336809609b56e7c49 Mon Sep 17 00:00:00 2001
From: krahets <krahets@163.com>
Date: Sat, 25 Feb 2023 02:19:48 +0800
Subject: [PATCH] Update graph_bfs.js and graph_dfs.js

---
 codes/javascript/chapter_graph/graph_bfs.js | 9 ++++-----
 codes/javascript/chapter_graph/graph_dfs.js | 2 +-
 codes/typescript/chapter_graph/graph_bfs.ts | 4 ++--
 3 files changed, 7 insertions(+), 8 deletions(-)

diff --git a/codes/javascript/chapter_graph/graph_bfs.js b/codes/javascript/chapter_graph/graph_bfs.js
index 695bc42dc..7ea1502a8 100644
--- a/codes/javascript/chapter_graph/graph_bfs.js
+++ b/codes/javascript/chapter_graph/graph_bfs.js
@@ -11,7 +11,7 @@ const { Vertex } = require('../include/Vertex');
 
 /* 广度优先遍历 BFS */
 // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
-function graphBfs(graph, startVet) {
+function graphBFS(graph, startVet) {
     // 顶点遍历序列
     const res = [];
     // 哈希表，用于记录已被访问过的顶点
@@ -19,7 +19,6 @@ function graphBfs(graph, startVet) {
     visited.add(startVet);
     // 队列用于实现 BFS
     const que = [startVet];
-
     // 以顶点 vet 为起点，循环直至访问完所有顶点
     while (que.length) {
         const vet = que.shift();    // 队首顶点出队
@@ -42,13 +41,13 @@ function graphBfs(graph, startVet) {
 /* 初始化无向图 */
 const v = Vertex.valsToVets([0, 1, 2, 3, 4, 5, 6, 7, 8, 9]);
 const edges = [[v[0], v[1]], [v[0], v[3]], [v[1], v[2]], [v[1], v[4]],
-[v[2], v[5]], [v[3], v[4]], [v[3], v[6]], [v[4], v[5]],
-[v[4], v[7]], [v[5], v[8]], [v[6], v[7]], [v[7], v[8]]];
+               [v[2], v[5]], [v[3], v[4]], [v[3], v[6]], [v[4], v[5]],
+               [v[4], v[7]], [v[5], v[8]], [v[6], v[7]], [v[7], v[8]]];
 const graph = new GraphAdjList(edges);
 console.log("\n初始化后，图为");
 graph.print();
 
 /* 广度优先遍历 BFS */
-const res = graphBfs(graph, v[0]);
+const res = graphBFS(graph, v[0]);
 console.log("\n广度优先遍历（BFS）顶点序列为");
 console.log(Vertex.vetsToVals(res));
diff --git a/codes/javascript/chapter_graph/graph_dfs.js b/codes/javascript/chapter_graph/graph_dfs.js
index e4abaafa6..ef8d52879 100644
--- a/codes/javascript/chapter_graph/graph_dfs.js
+++ b/codes/javascript/chapter_graph/graph_dfs.js
@@ -39,7 +39,7 @@ function graphDFS(graph, startVet) {
 /* 初始化无向图 */
 const v = Vertex.valsToVets([0, 1, 2, 3, 4, 5, 6]);
 const edges = [[v[0], v[1]], [v[0], v[3]], [v[1], v[2]],
-[v[2], v[5]], [v[4], v[5]], [v[5], v[6]]];
+               [v[2], v[5]], [v[4], v[5]], [v[5], v[6]]];
 const graph = new GraphAdjList(edges);
 console.log("\n初始化后，图为");
 graph.print();
diff --git a/codes/typescript/chapter_graph/graph_bfs.ts b/codes/typescript/chapter_graph/graph_bfs.ts
index 4f1adc220..a4bbeed06 100644
--- a/codes/typescript/chapter_graph/graph_bfs.ts
+++ b/codes/typescript/chapter_graph/graph_bfs.ts
@@ -10,7 +10,7 @@ import { Vertex } from '../module/Vertex';
 
 /* 广度优先遍历 BFS */
 // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
-function graphBfs(graph: GraphAdjList, startVet: Vertex): Vertex[] {
+function graphBFS(graph: GraphAdjList, startVet: Vertex): Vertex[] {
     // 顶点遍历序列
     const res: Vertex[] = [];
     // 哈希表，用于记录已被访问过的顶点
@@ -47,6 +47,6 @@ console.log("\n初始化后，图为");
 graph.print();
 
 /* 广度优先遍历 BFS */
-const res = graphBfs(graph, v[0]);
+const res = graphBFS(graph, v[0]);
 console.log("\n广度优先遍历（BFS）顶点序列为");
 console.log(Vertex.vetsToVals(res));