data-structure-typed 2.0.0 → 2.0.1

package/dist/umd/data-structure-typed.js

@@ -6256,7 +6256,7 @@ var dataStructureTyped = (() => {
       if (isWeight === void 0) isWeight = false;
       if (isWeight) {
         const allPaths = this.getAllPathsBetween(v1, v2);
-        let min = Infinity;
+        let min = Number.MAX_SAFE_INTEGER;
         for (const path of allPaths) {
           min = Math.min(this.getPathSumWeight(path), min);
         }
@@ -6317,7 +6317,7 @@ var dataStructureTyped = (() => {
       if (isWeight) {
         if (isDFS) {
           const allPaths = this.getAllPathsBetween(v1, v2, 1e4);
-          let min = Infinity;
+          let min = Number.MAX_SAFE_INTEGER;
           let minIndex = -1;
           let index = 0;
           for (const path of allPaths) {
@@ -6377,7 +6377,7 @@ var dataStructureTyped = (() => {
      * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<VO>`.
      */
     dijkstraWithoutHeap(src, dest = void 0, getMinDist = false, genPaths = false) {
-      let minDist = Infinity;
+      let minDist = Number.MAX_SAFE_INTEGER;
       let minDest = void 0;
       let minPath = [];
       const paths = [];
@@ -6392,12 +6392,12 @@ var dataStructureTyped = (() => {
       }
       for (const vertex of vertexMap) {
         const vertexOrKey = vertex[1];
-        if (vertexOrKey instanceof AbstractVertex) distMap.set(vertexOrKey, Infinity);
+        if (vertexOrKey instanceof AbstractVertex) distMap.set(vertexOrKey, Number.MAX_SAFE_INTEGER);
       }
       distMap.set(srcVertex, 0);
       preMap.set(srcVertex, void 0);
       const getMinOfNoSeen = () => {
-        let min = Infinity;
+        let min = Number.MAX_SAFE_INTEGER;
         let minV = void 0;
         for (const [key, value] of distMap) {
           if (!seen.has(key)) {
@@ -6431,7 +6431,7 @@ var dataStructureTyped = (() => {
           seen.add(cur);
           if (destVertex && destVertex === cur) {
             if (getMinDist) {
-              minDist = distMap.get(destVertex) || Infinity;
+              minDist = distMap.get(destVertex) || Number.MAX_SAFE_INTEGER;
             }
             if (genPaths) {
               getPaths(destVertex);
@@ -6490,7 +6490,7 @@ var dataStructureTyped = (() => {
      */
     dijkstra(src, dest = void 0, getMinDist = false, genPaths = false) {
       var _a;
-      let minDist = Infinity;
+      let minDist = Number.MAX_SAFE_INTEGER;
       let minDest = void 0;
       let minPath = [];
       const paths = [];
@@ -6503,7 +6503,7 @@ var dataStructureTyped = (() => {
       if (!srcVertex) return void 0;
       for (const vertex of vertexMap) {
         const vertexOrKey = vertex[1];
-        if (vertexOrKey instanceof AbstractVertex) distMap.set(vertexOrKey, Infinity);
+        if (vertexOrKey instanceof AbstractVertex) distMap.set(vertexOrKey, Number.MAX_SAFE_INTEGER);
       }
       const heap = new Heap([], { comparator: (a, b) => a.key - b.key });
       heap.add({ key: 0, value: srcVertex });
@@ -6534,7 +6534,7 @@ var dataStructureTyped = (() => {
             seen.add(cur);
             if (destVertex && destVertex === cur) {
               if (getMinDist) {
-                minDist = distMap.get(destVertex) || Infinity;
+                minDist = distMap.get(destVertex) || Number.MAX_SAFE_INTEGER;
               }
               if (genPaths) {
                 getPaths(destVertex);
@@ -6600,7 +6600,7 @@ var dataStructureTyped = (() => {
       const paths = [];
       const distMap = /* @__PURE__ */ new Map();
       const preMap = /* @__PURE__ */ new Map();
-      let min = Infinity;
+      let min = Number.MAX_SAFE_INTEGER;
       let minPath = [];
       let hasNegativeCycle;
       if (scanNegativeCycle) hasNegativeCycle = false;
@@ -6610,7 +6610,7 @@ var dataStructureTyped = (() => {
       const edgeMap = this.edgeSet();
       const numOfEdges = edgeMap.length;
       this._vertexMap.forEach((vertex) => {
-        distMap.set(vertex, Infinity);
+        distMap.set(vertex, Number.MAX_SAFE_INTEGER);
       });
       distMap.set(srcVertex, 0);
       for (let i = 1; i < numOfVertices; ++i) {
@@ -6622,7 +6622,7 @@ var dataStructureTyped = (() => {
             const sWeight = distMap.get(s);
             const dWeight = distMap.get(d);
             if (sWeight !== void 0 && dWeight !== void 0) {
-              if (distMap.get(s) !== Infinity && sWeight + weight < dWeight) {
+              if (distMap.get(s) !== Number.MAX_SAFE_INTEGER && sWeight + weight < dWeight) {
                 distMap.set(d, sWeight + weight);
                 if (genPath) preMap.set(d, s);
               }
@@ -6664,7 +6664,7 @@ var dataStructureTyped = (() => {
           const weight = edgeMap[j].weight;
           const sWeight = distMap.get(s);
           if (sWeight) {
-            if (sWeight !== Infinity && sWeight + weight < sWeight) hasNegativeCycle = true;
+            if (sWeight !== Number.MAX_SAFE_INTEGER && sWeight + weight < sWeight) hasNegativeCycle = true;
           }
         }
       }
@@ -6712,7 +6712,7 @@ var dataStructureTyped = (() => {
       }
       for (let i = 0; i < n; i++) {
         for (let j = 0; j < n; j++) {
-          costs[i][j] = ((_a = this.getEdge(idAndVertices[i][1], idAndVertices[j][1])) == null ? void 0 : _a.weight) || Infinity;
+          costs[i][j] = ((_a = this.getEdge(idAndVertices[i][1], idAndVertices[j][1])) == null ? void 0 : _a.weight) || Number.MAX_SAFE_INTEGER;
         }
       }
       for (let k = 0; k < n; k++) {