min-heap-typed 1.41.6 → 1.41.7

package/dist/data-structures/graph/abstract-graph.js

@@ -172,21 +172,21 @@ class AbstractGraph {
             return [];
         }
         const dfs = (cur, dest, visiting, path) => {
-            visiting.set(cur, true);
+            visiting.add(cur);
             if (cur === dest) {
                 paths.push([vertex1, ...path]);
             }
             const neighbors = this.getNeighbors(cur);
             for (const neighbor of neighbors) {
-                if (!visiting.get(neighbor)) {
+                if (!visiting.has(neighbor)) {
                     path.push(neighbor);
                     dfs(neighbor, dest, visiting, path);
-                    (0, utils_1.arrayRemove)(path, (vertex) => vertex === neighbor);
+                    path.pop();
                 }
             }
-            visiting.set(cur, false);
+            visiting.delete(cur);
         };
-        dfs(vertex1, vertex2, new Map(), []);
+        dfs(vertex1, vertex2, new Set(), []);
         return paths;
     }
     /**

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "min-heap-typed",
-  "version": "1.41.6",
+  "version": "1.41.7",
   "description": "Min Heap. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -132,6 +132,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.41.6"
+    "data-structure-typed": "^1.41.7"
   }
 }

package/src/data-structures/graph/abstract-graph.ts

@@ -233,8 +233,8 @@ export abstract class AbstractGraph<
       return [];
     }
 
-    const dfs = (cur: VO, dest: VO, visiting: Map<VO, boolean>, path: VO[]) => {
-      visiting.set(cur, true);
+    const dfs = (cur: VO, dest: VO, visiting: Set<VO>, path: VO[]) => {
+      visiting.add(cur);
 
       if (cur === dest) {
         paths.push([vertex1, ...path]);
@@ -242,17 +242,17 @@ export abstract class AbstractGraph<
 
       const neighbors = this.getNeighbors(cur);
       for (const neighbor of neighbors) {
-        if (!visiting.get(neighbor)) {
+        if (!visiting.has(neighbor)) {
           path.push(neighbor);
           dfs(neighbor, dest, visiting, path);
-          arrayRemove(path, (vertex: VO) => vertex === neighbor);
+          path.pop();
         }
       }
 
-      visiting.set(cur, false);
+      visiting.delete(cur);
     };
 
-    dfs(vertex1, vertex2, new Map<VO, boolean>(), []);
+    dfs(vertex1, vertex2, new Set<VO>(), []);
     return paths;
   }