xmengnet/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2024-12-25 13:26:30 +08:00
Code Issues Projects Releases Packages Wiki Activity Actions

Update graph_bfs.js and graph_dfs.js

Browse source
This commit is contained in:
krahets 2023-02-25 02:19:48 +08:00
parent e8f311e900
commit 93fb0075cc
3 changed files with 7 additions and 8 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

9
codes/javascript/chapter_graph/graph_bfs.js
View file

@ -11,7 +11,7 @@ const { Vertex } = require('../include/Vertex');
/* 广度优先遍历 BFS */ /* 广度优先遍历 BFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点 // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
function graphBfs(graph, startVet) { function graphBFS(graph, startVet) {
// 顶点遍历序列 // 顶点遍历序列
const res = []; const res = [];
// 哈希表，用于记录已被访问过的顶点 // 哈希表，用于记录已被访问过的顶点
@ -19,7 +19,6 @@ function graphBfs(graph, startVet) {
visited.add(startVet); visited.add(startVet);
// 队列用于实现 BFS // 队列用于实现 BFS
const que = [startVet]; const que = [startVet];
// 以顶点 vet 为起点，循环直至访问完所有顶点 // 以顶点 vet 为起点，循环直至访问完所有顶点
while (que.length) { while (que.length) {
const vet = que.shift(); // 队首顶点出队 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 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]], 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[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[4], v[7]], [v[5], v[8]], [v[6], v[7]], [v[7], v[8]]];
const graph = new GraphAdjList(edges); const graph = new GraphAdjList(edges);
console.log("\n初始化后，图为"); console.log("\n初始化后，图为");
graph.print(); graph.print();
/* 广度优先遍历 BFS */ /* 广度优先遍历 BFS */
const res = graphBfs(graph, v[0]); const res = graphBFS(graph, v[0]);
console.log("\n广度优先遍历（BFS）顶点序列为"); console.log("\n广度优先遍历（BFS）顶点序列为");
console.log(Vertex.vetsToVals(res)); console.log(Vertex.vetsToVals(res));

2
codes/javascript/chapter_graph/graph_dfs.js
View file

@ -39,7 +39,7 @@ function graphDFS(graph, startVet) {
/* 初始化无向图 */ /* 初始化无向图 */
const v = Vertex.valsToVets([0, 1, 2, 3, 4, 5, 6]); 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]], 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); const graph = new GraphAdjList(edges);
console.log("\n初始化后，图为"); console.log("\n初始化后，图为");
graph.print(); graph.print();

4
codes/typescript/chapter_graph/graph_bfs.ts
View file

@ -10,7 +10,7 @@ import { Vertex } from '../module/Vertex';
/* 广度优先遍历 BFS */ /* 广度优先遍历 BFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点 // 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
function graphBfs(graph: GraphAdjList, startVet: Vertex): Vertex[] { function graphBFS(graph: GraphAdjList, startVet: Vertex): Vertex[] {
// 顶点遍历序列 // 顶点遍历序列
const res: Vertex[] = []; const res: Vertex[] = [];
// 哈希表，用于记录已被访问过的顶点 // 哈希表，用于记录已被访问过的顶点
@ -47,6 +47,6 @@ console.log("\n初始化后，图为");
graph.print(); graph.print();
/* 广度优先遍历 BFS */ /* 广度优先遍历 BFS */
const res = graphBfs(graph, v[0]); const res = graphBFS(graph, v[0]);
console.log("\n广度优先遍历（BFS）顶点序列为"); console.log("\n广度优先遍历（BFS）顶点序列为");
console.log(Vertex.vetsToVals(res)); console.log(Vertex.vetsToVals(res));