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

Update JavaScript and TypeScript codes for all chapters, rename JavaScript and TypeScript import folder to modules (#402)

Browse Source 
* Update JavaScript and TypeScript codes

* Rename JavaScript and TypeScript import folder to modules
This commit is contained in:
Justin Tse
2023-03-03 01:34:53 +08:00
committed by GitHub
parent 7b41e6c2f0
commit e4a98bc9c5
61 changed files with 324 additions and 290 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -4,7 +4,7 @@
* Author: Justin (xiefahit@gmail.com)
*/
const { Vertex } = require('../include/Vertex')
const { Vertex } = require('../modules/Vertex')
/* 基于邻接表实现的无向图类 */
class GraphAdjList {

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

@ -92,7 +92,7 @@ class GraphAdjMat {
}
}
/* Driver Code */
/* 初始化无向图 */
// 请注意，edges 元素代表顶点索引，即对应 vertices 元素索引
const vertices = [1, 3, 2, 5, 4];

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

@ -4,10 +4,8 @@
* Author: Zhuo Qinyue (1403450829@qq.com)
*/
const { GraphAdjList } = require('./graph_adjacency_list');
const { Vertex } = require('../include/Vertex');
const { Vertex } = require('../modules/Vertex');
/* 广度优先遍历 BFS */
// 使用邻接表来表示图，以便获取指定顶点的所有邻接顶点
@ -36,7 +34,6 @@ function graphBFS(graph, startVet) {
return res;
}
/* Driver Code */
/* 初始化无向图 */
const v = Vertex.valsToVets([0, 1, 2, 3, 4, 5, 6, 7, 8, 9]);

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

@ -4,8 +4,7 @@
* Author: Zhuo Qinyue (1403450829@qq.com)
*/
const { Vertex } = require('../include/Vertex');
const { Vertex } = require('../modules/Vertex');
const { GraphAdjList } = require('./graph_adjacency_list');
/* 深度优先遍历 DFS */
@ -34,7 +33,6 @@ function graphDFS(graph, startVet) {
return res;
}
/* Driver Code */
/* 初始化无向图 */
const v = Vertex.valsToVets([0, 1, 2, 3, 4, 5, 6]);