algorithm/hello-algo
1
0
Fork 0
mirror of https://github.com/krahets/hello-algo.git synced 2025-11-04 14:18:20 +08:00
Code Issues Packages Projects Releases Wiki Activity

update: Use function declarations instead of function expressions. (#385)

Browse Source 
Co-authored-by: steak-zhuo <zhuoqinyue@gmail.com>
This commit is contained in:
zhuoqinyue
2023-02-24 12:15:46 -06:00
committed by GitHub
parent f894199d58
commit e8f311e900
4 changed files with 6 additions and 6 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
codes/javascript/chapter_graph/graph_bfs.js
View File

@ -11,7 +11,7 @@ const { Vertex } = require('../include/Vertex');
/* 广度优先遍历 BFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
const graphBfs = (graph, startVet) => {
function graphBfs(graph, startVet) {
// 顶点遍历序列
const res = [];
// 哈希表，用于记录已被访问过的顶点

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

@ -10,7 +10,7 @@ const { GraphAdjList } = require('./graph_adjacency_list');
/* 深度优先遍历 DFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
const dfs = (graph, visited, res, vet) => {
function dfs(graph, visited, res, vet) {
res.push(vet); // 记录访问顶点
visited.add(vet); // 标记该顶点已被访问
// 遍历该顶点的所有邻接顶点
@ -25,7 +25,7 @@ const dfs = (graph, visited, res, vet) => {
/* 深度优先遍历 DFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
const graphDFS = (graph, startVet) => {
function graphDFS(graph, startVet) {
// 顶点遍历序列
const res = [];
// 哈希表，用于记录已被访问过的顶点

2
codes/typescript/chapter_graph/graph_bfs.ts
View File

@ -10,7 +10,7 @@ import { Vertex } from '../module/Vertex';
/* 广度优先遍历 BFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
const graphBfs = (graph: GraphAdjList, startVet: Vertex): Vertex[] => {
function graphBfs(graph: GraphAdjList, startVet: Vertex): Vertex[] {
// 顶点遍历序列
const res: Vertex[] = [];
// 哈希表，用于记录已被访问过的顶点

4
codes/typescript/chapter_graph/graph_dfs.ts
View File

@ -9,7 +9,7 @@ import { Vertex } from '../module/Vertex';
import { GraphAdjList } from './graph_adjacency_list';
/* 深度优先遍历 DFS 辅助函数 */
const dfs = (graph: GraphAdjList, visited: Set<Vertex>, res: Vertex[], vet: Vertex): void => {
function dfs(graph: GraphAdjList, visited: Set<Vertex>, res: Vertex[], vet: Vertex): void {
res.push(vet); // 记录访问顶点
visited.add(vet); // 标记该顶点已被访问
// 遍历该顶点的所有邻接顶点
@ -24,7 +24,7 @@ const dfs = (graph: GraphAdjList, visited: Set<Vertex>, res: Vertex[], vet: Vert
/* 深度优先遍历 DFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
const graphDFS = (graph: GraphAdjList, startVet: Vertex): Vertex[] => {
function graphDFS(graph: GraphAdjList, startVet: Vertex): Vertex[] {
// 顶点遍历序列
const res: Vertex[] = [];
// 哈希表，用于记录已被访问过的顶点