algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-12-16 03:59:18 +08:00
Code Issues Packages Projects Releases Wiki Activity

Fomrat the JS and TS codes with prettier.

Browse Source
This commit is contained in:
krahets
2023-04-17 21:58:11 +08:00
parent 9a98ff8a5e
commit c4ea4e39f3
68 changed files with 634 additions and 510 deletions
Download Patch File Download Diff File Expand all files Collapse all files

18
codes/javascript/chapter_graph/graph_dfs.js
View File

@@ -10,8 +10,8 @@ const { GraphAdjList } = require('./graph_adjacency_list');
/* 深度优先遍历 DFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
function dfs(graph, visited, res, vet) {
res.push(vet); // 记录访问顶点
visited.add(vet); // 标记该顶点已被访问
res.push(vet); // 记录访问顶点
visited.add(vet); // 标记该顶点已被访问
// 遍历该顶点的所有邻接顶点
for (const adjVet of graph.adjList.get(vet)) {
if (visited.has(adjVet)) {
@@ -36,13 +36,19 @@ function graphDFS(graph, startVet) {
/* Driver Code */
/* 初始化无向图 */
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]]];
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]],
];
const graph = new GraphAdjList(edges);
console.log("\n初始化后，图为");
console.log('\n初始化后，图为');
graph.print();
/* 深度优先遍历 DFS */
const res = graphDFS(graph, v[0]);
console.log("\n深度优先遍历（DFS）顶点序列为");
console.log('\n深度优先遍历（DFS）顶点序列为');
console.log(Vertex.vetsToVals(res));