feat: add main

codes/typescript/chapter_graph/graph_adjacency_list.ts

@@ -92,46 +92,48 @@ class GraphAdjList {
 }
 
 /* Driver Code */
-/* 初始化无向图 */
-const v0 = new Vertex(1),
-    v1 = new Vertex(3),
-    v2 = new Vertex(2),
-    v3 = new Vertex(5),
-    v4 = new Vertex(4);
-const edges = [
-    [v0, v1],
-    [v1, v2],
-    [v2, v3],
-    [v0, v3],
-    [v2, v4],
-    [v3, v4],
-];
-const graph = new GraphAdjList(edges);
-console.log('\n初始化后，图为');
-graph.print();
+if (import.meta.url === new URL('file://' + process.argv[1]).href) {
+    /* 初始化无向图 */
+    const v0 = new Vertex(1),
+        v1 = new Vertex(3),
+        v2 = new Vertex(2),
+        v3 = new Vertex(5),
+        v4 = new Vertex(4);
+    const edges = [
+        [v0, v1],
+        [v1, v2],
+        [v2, v3],
+        [v0, v3],
+        [v2, v4],
+        [v3, v4],
+    ];
+    const graph = new GraphAdjList(edges);
+    console.log('\n初始化后，图为');
+    graph.print();
 
-/* 添加边 */
-// 顶点 1, 2 即 v0, v2
-graph.addEdge(v0, v2);
-console.log('\n添加边 1-2 后，图为');
-graph.print();
+    /* 添加边 */
+    // 顶点 1, 2 即 v0, v2
+    graph.addEdge(v0, v2);
+    console.log('\n添加边 1-2 后，图为');
+    graph.print();
 
-/* 删除边 */
-// 顶点 1, 3 即 v0, v1
-graph.removeEdge(v0, v1);
-console.log('\n删除边 1-3 后，图为');
-graph.print();
+    /* 删除边 */
+    // 顶点 1, 3 即 v0, v1
+    graph.removeEdge(v0, v1);
+    console.log('\n删除边 1-3 后，图为');
+    graph.print();
 
-/* 添加顶点 */
-const v5 = new Vertex(6);
-graph.addVertex(v5);
-console.log('\n添加顶点 6 后，图为');
-graph.print();
+    /* 添加顶点 */
+    const v5 = new Vertex(6);
+    graph.addVertex(v5);
+    console.log('\n添加顶点 6 后，图为');
+    graph.print();
 
-/* 删除顶点 */
-// 顶点 3 即 v1
-graph.removeVertex(v1);
-console.log('\n删除顶点 3 后，图为');
-graph.print();
+    /* 删除顶点 */
+    // 顶点 3 即 v1
+    graph.removeVertex(v1);
+    console.log('\n删除顶点 3 后，图为');
+    graph.print();
+}
 
 export { GraphAdjList };

codes/typescript/chapter_heap/my_heap.ts

@@ -122,7 +122,7 @@ class MaxHeap {
 }
 
 /* Driver Code */
-
+if (import.meta.url === new URL('file://' + process.argv[1]).href) {
     /* 初始化大顶堆 */
     const maxHeap = new MaxHeap([9, 8, 6, 6, 7, 5, 2, 1, 4, 3, 6, 2]);
     console.log('\n输入列表并建堆后');
@@ -150,6 +150,6 @@ class MaxHeap {
     /* 判断堆是否为空 */
     const isEmpty = maxHeap.isEmpty();
     console.log(`\n堆是否为空 ${isEmpty}`);
-
+}
 
 export { MaxHeap };

codes/typescript/package.json

@@ -6,6 +6,7 @@
         "check": "tsc"
     },
     "devDependencies": {
+        "@types/node": "^20.12.7",
         "tsx": "^4.7.2",
         "typescript": "^5.4.5"
     }

codes/typescript/tsconfig.json

@@ -10,7 +10,7 @@
         "moduleResolution": "node",
         "paths": {},
         "resolveJsonModule": true,
-        "types": [],
+        "types": ["@types/node"],
 
         "noEmit": true,