mirror of
https://github.com/krahets/hello-algo.git
synced 2024-12-26 00:26:29 +08:00
Update graph_bfs.js and graph_dfs.js
This commit is contained in:
parent
e8f311e900
commit
93fb0075cc
3 changed files with 7 additions and 8 deletions
|
@ -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(); // 队首顶点出队
|
||||||
|
@ -49,6 +48,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));
|
||||||
|
|
|
@ -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));
|
||||||
|
|
Loading…
Reference in a new issue