data-structure-typed 1.19.2 → 1.19.4

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

@@ -1,40 +1,4 @@
 "use strict";
-var __values = (this && this.__values) || function(o) {
-    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
-    if (m) return m.call(o);
-    if (o && typeof o.length === "number") return {
-        next: function () {
-            if (o && i >= o.length) o = void 0;
-            return { value: o && o[i++], done: !o };
-        }
-    };
-    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
-};
-var __read = (this && this.__read) || function (o, n) {
-    var m = typeof Symbol === "function" && o[Symbol.iterator];
-    if (!m) return o;
-    var i = m.call(o), r, ar = [], e;
-    try {
-        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
-    }
-    catch (error) { e = { error: error }; }
-    finally {
-        try {
-            if (r && !r.done && (m = i["return"])) m.call(i);
-        }
-        finally { if (e) throw e.error; }
-    }
-    return ar;
-};
-var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
-    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
-        if (ar || !(i in from)) {
-            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
-            ar[i] = from[i];
-        }
-    }
-    return to.concat(ar || Array.prototype.slice.call(from));
-};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.AbstractGraph = exports.AbstractEdge = exports.AbstractVertex = void 0;
 /**
@@ -44,9 +8,9 @@ exports.AbstractGraph = exports.AbstractEdge = exports.AbstractVertex = void 0;
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-var utils_1 = require("../../utils");
-var priority_queue_1 = require("../priority-queue");
-var AbstractVertex = /** @class */ (function () {
+const utils_1 = require("../../utils");
+const priority_queue_1 = require("../priority-queue");
+class AbstractVertex {
     /**
      * The function is a protected constructor that takes an id and an optional value as parameters.
      * @param {VertexId} id - The `id` parameter is of type `VertexId` and represents the identifier of the vertex. It is
@@ -54,34 +18,25 @@ var AbstractVertex = /** @class */ (function () {
      * @param {T} [val] - The parameter "val" is an optional parameter of type T. It is used to assign a value to the
      * vertex. If no value is provided, it will be set to undefined.
      */
-    function AbstractVertex(id, val) {
+    constructor(id, val) {
         this._id = id;
         this._val = val;
     }
-    Object.defineProperty(AbstractVertex.prototype, "id", {
-        get: function () {
-            return this._id;
-        },
-        set: function (v) {
-            this._id = v;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(AbstractVertex.prototype, "val", {
-        get: function () {
-            return this._val;
-        },
-        set: function (value) {
-            this._val = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    return AbstractVertex;
-}());
+    get id() {
+        return this._id;
+    }
+    set id(v) {
+        this._id = v;
+    }
+    get val() {
+        return this._val;
+    }
+    set val(value) {
+        this._val = value;
+    }
+}
 exports.AbstractVertex = AbstractVertex;
-var AbstractEdge = /** @class */ (function () {
+class AbstractEdge {
     /**
      * The above function is a protected constructor that initializes the weight, value, and hash code properties of an
      * object.
@@ -91,38 +46,26 @@ var AbstractEdge = /** @class */ (function () {
      * @param {T} [val] - The `val` parameter is of type `T`, which means it can be any type. It is an optional parameter,
      * meaning it can be omitted when creating an instance of the class.
      */
-    function AbstractEdge(weight, val) {
+    constructor(weight, val) {
         this._weight = weight !== undefined ? weight : 1;
         this._val = val;
         this._hashCode = (0, utils_1.uuidV4)();
     }
-    Object.defineProperty(AbstractEdge.prototype, "val", {
-        get: function () {
-            return this._val;
-        },
-        set: function (value) {
-            this._val = value;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(AbstractEdge.prototype, "weight", {
-        get: function () {
-            return this._weight;
-        },
-        set: function (v) {
-            this._weight = v;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(AbstractEdge.prototype, "hashCode", {
-        get: function () {
-            return this._hashCode;
-        },
-        enumerable: false,
-        configurable: true
-    });
+    get val() {
+        return this._val;
+    }
+    set val(value) {
+        this._val = value;
+    }
+    get weight() {
+        return this._weight;
+    }
+    set weight(v) {
+        this._weight = v;
+    }
+    get hashCode() {
+        return this._hashCode;
+    }
     /**
      * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
      * This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.
@@ -132,23 +75,18 @@ var AbstractEdge = /** @class */ (function () {
      * @param {string} v - The parameter "v" is of type string and represents the value that will be assigned to the
      * "_hashCode" property.
      */
-    AbstractEdge.prototype._setHashCode = function (v) {
+    _setHashCode(v) {
         this._hashCode = v;
-    };
-    return AbstractEdge;
-}());
+    }
+}
 exports.AbstractEdge = AbstractEdge;
-var AbstractGraph = /** @class */ (function () {
-    function AbstractGraph() {
+class AbstractGraph {
+    constructor() {
         this._vertices = new Map();
     }
-    Object.defineProperty(AbstractGraph.prototype, "vertices", {
-        get: function () {
-            return this._vertices;
-        },
-        enumerable: false,
-        configurable: true
-    });
+    get vertices() {
+        return this._vertices;
+    }
     /**
      * The function "getVertex" returns the vertex with the specified ID or null if it doesn't exist.
      * @param {VertexId} vertexId - The `vertexId` parameter is the identifier of the vertex that you want to retrieve from
@@ -156,37 +94,37 @@ var AbstractGraph = /** @class */ (function () {
      * @returns The method `getVertex` returns the vertex with the specified `vertexId` if it exists in the `_vertices`
      * map. If the vertex does not exist, it returns `null`.
      */
-    AbstractGraph.prototype.getVertex = function (vertexId) {
+    getVertex(vertexId) {
         return this._vertices.get(vertexId) || null;
-    };
+    }
     /**
      * The function checks if a vertex exists in a graph.
      * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a vertex object (`V`) or a vertex ID
      * (`VertexId`).
      * @returns a boolean value.
      */
-    AbstractGraph.prototype.hasVertex = function (vertexOrId) {
+    hasVertex(vertexOrId) {
         return this._vertices.has(this._getVertexId(vertexOrId));
-    };
-    AbstractGraph.prototype.addVertex = function (idOrVertex, val) {
+    }
+    addVertex(idOrVertex, val) {
         if (idOrVertex instanceof AbstractVertex) {
             return this._addVertexOnly(idOrVertex);
         }
         else {
-            var newVertex = this.createVertex(idOrVertex, val);
+            const newVertex = this.createVertex(idOrVertex, val);
             return this._addVertexOnly(newVertex);
         }
-    };
+    }
     /**
      * The `removeVertex` function removes a vertex from a graph by its ID or by the vertex object itself.
      * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a vertex object (`V`) or a vertex ID
      * (`VertexId`).
      * @returns The method is returning a boolean value.
      */
-    AbstractGraph.prototype.removeVertex = function (vertexOrId) {
-        var vertexId = this._getVertexId(vertexOrId);
+    removeVertex(vertexOrId) {
+        const vertexId = this._getVertexId(vertexOrId);
         return this._vertices.delete(vertexId);
-    };
+    }
     /**
      * The function removes all vertices from a graph and returns a boolean indicating if any vertices were removed.
      * @param {V[] | VertexId[]} vertices - The `vertices` parameter can be either an array of vertices (`V[]`) or an array
@@ -194,24 +132,13 @@ var AbstractGraph = /** @class */ (function () {
      * @returns a boolean value. It returns true if at least one vertex was successfully removed, and false if no vertices
      * were removed.
      */
-    AbstractGraph.prototype.removeAllVertices = function (vertices) {
-        var e_1, _a;
-        var removed = [];
-        try {
-            for (var vertices_1 = __values(vertices), vertices_1_1 = vertices_1.next(); !vertices_1_1.done; vertices_1_1 = vertices_1.next()) {
-                var v = vertices_1_1.value;
-                removed.push(this.removeVertex(v));
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (vertices_1_1 && !vertices_1_1.done && (_a = vertices_1.return)) _a.call(vertices_1);
-            }
-            finally { if (e_1) throw e_1.error; }
+    removeAllVertices(vertices) {
+        const removed = [];
+        for (const v of vertices) {
+            removed.push(this.removeVertex(v));
         }
         return removed.length > 0;
-    };
+    }
     /**
      * The function checks if there is an edge between two vertices and returns a boolean value indicating the result.
      * @param {VertexId | V} v1 - The parameter v1 can be either a VertexId or a V. A VertexId represents the unique
@@ -220,11 +147,11 @@ var AbstractGraph = /** @class */ (function () {
      * `VertexId` or a `V` type, which represents the type of the vertex.
      * @returns A boolean value is being returned.
      */
-    AbstractGraph.prototype.hasEdge = function (v1, v2) {
-        var edge = this.getEdge(v1, v2);
+    hasEdge(v1, v2) {
+        const edge = this.getEdge(v1, v2);
         return !!edge;
-    };
-    AbstractGraph.prototype.addEdge = function (srcOrEdge, dest, weight, val) {
+    }
+    addEdge(srcOrEdge, dest, weight, val) {
         if (srcOrEdge instanceof AbstractEdge) {
             return this._addEdgeOnly(srcOrEdge);
         }
@@ -236,14 +163,14 @@ var AbstractGraph = /** @class */ (function () {
                     srcOrEdge = srcOrEdge.id;
                 if (dest instanceof AbstractVertex)
                     dest = dest.id;
-                var newEdge = this.createEdge(srcOrEdge, dest, weight, val);
+                const newEdge = this.createEdge(srcOrEdge, dest, weight, val);
                 return this._addEdgeOnly(newEdge);
             }
             else {
                 throw new Error('dest must be a Vertex or vertex id while srcOrEdge is an Edge');
             }
         }
-    };
+    }
     /**
      * The function sets the weight of an edge between two vertices in a graph.
      * @param {VertexId | V} srcOrId - The `srcOrId` parameter can be either a `VertexId` or a `V` object. It represents
@@ -255,8 +182,8 @@ var AbstractGraph = /** @class */ (function () {
      * @returns a boolean value. If the edge exists between the source and destination vertices, the function will update
      * the weight of the edge and return true. If the edge does not exist, the function will return false.
      */
-    AbstractGraph.prototype.setEdgeWeight = function (srcOrId, destOrId, weight) {
-        var edge = this.getEdge(srcOrId, destOrId);
+    setEdgeWeight(srcOrId, destOrId, weight) {
+        const edge = this.getEdge(srcOrId, destOrId);
         if (edge) {
             edge.weight = weight;
             return true;
@@ -264,7 +191,7 @@ var AbstractGraph = /** @class */ (function () {
         else {
             return false;
         }
-    };
+    }
     /**
      * The function `getAllPathsBetween` finds all paths between two vertices in a graph using depth-first search.
      * @param {V | VertexId} v1 - The parameter `v1` represents either a vertex object (`V`) or a vertex ID (`VertexId`).
@@ -272,59 +199,44 @@ var AbstractGraph = /** @class */ (function () {
      * @param {V | VertexId} v2 - The parameter `v2` represents either a vertex object (`V`) or a vertex ID (`VertexId`).
      * @returns The function `getAllPathsBetween` returns an array of arrays of vertices (`V[][]`).
      */
-    AbstractGraph.prototype.getAllPathsBetween = function (v1, v2) {
-        var _this = this;
-        var paths = [];
-        var vertex1 = this._getVertex(v1);
-        var vertex2 = this._getVertex(v2);
+    getAllPathsBetween(v1, v2) {
+        const paths = [];
+        const vertex1 = this._getVertex(v1);
+        const vertex2 = this._getVertex(v2);
         if (!(vertex1 && vertex2)) {
             return [];
         }
-        var dfs = function (cur, dest, visiting, path) {
-            var e_2, _a;
+        const dfs = (cur, dest, visiting, path) => {
             visiting.set(cur, true);
             if (cur === dest) {
-                paths.push(__spreadArray([vertex1], __read(path), false));
+                paths.push([vertex1, ...path]);
             }
-            var neighbors = _this.getNeighbors(cur);
-            var _loop_1 = function (neighbor) {
+            const neighbors = this.getNeighbors(cur);
+            for (const neighbor of neighbors) {
                 if (!visiting.get(neighbor)) {
                     path.push(neighbor);
                     dfs(neighbor, dest, visiting, path);
-                    (0, utils_1.arrayRemove)(path, function (vertex) { return vertex === neighbor; });
-                }
-            };
-            try {
-                for (var neighbors_1 = __values(neighbors), neighbors_1_1 = neighbors_1.next(); !neighbors_1_1.done; neighbors_1_1 = neighbors_1.next()) {
-                    var neighbor = neighbors_1_1.value;
-                    _loop_1(neighbor);
-                }
-            }
-            catch (e_2_1) { e_2 = { error: e_2_1 }; }
-            finally {
-                try {
-                    if (neighbors_1_1 && !neighbors_1_1.done && (_a = neighbors_1.return)) _a.call(neighbors_1);
+                    (0, utils_1.arrayRemove)(path, (vertex) => vertex === neighbor);
                 }
-                finally { if (e_2) throw e_2.error; }
             }
             visiting.set(cur, false);
         };
         dfs(vertex1, vertex2, new Map(), []);
         return paths;
-    };
+    }
     /**
      * The function calculates the sum of weights along a given path.
      * @param {V[]} path - An array of vertices (V) representing a path in a graph.
      * @returns The function `getPathSumWeight` returns the sum of the weights of the edges in the given path.
      */
-    AbstractGraph.prototype.getPathSumWeight = function (path) {
+    getPathSumWeight(path) {
         var _a;
-        var sum = 0;
-        for (var i = 0; i < path.length; i++) {
+        let sum = 0;
+        for (let i = 0; i < path.length; i++) {
             sum += ((_a = this.getEdge(path[i], path[i + 1])) === null || _a === void 0 ? void 0 : _a.weight) || 0;
         }
         return sum;
-    };
+    }
     /**
      * The function `getMinCostBetween` calculates the minimum cost between two vertices in a graph, either based on edge
      * weights or using a breadth-first search algorithm.
@@ -339,63 +251,42 @@ var AbstractGraph = /** @class */ (function () {
      * vertices. If `isWeight` is `false` or not provided, it uses a breadth-first search (BFS) algorithm to calculate the
      * minimum number of
      */
-    AbstractGraph.prototype.getMinCostBetween = function (v1, v2, isWeight) {
-        var e_3, _a, e_4, _b;
+    getMinCostBetween(v1, v2, isWeight) {
         if (isWeight === undefined)
             isWeight = false;
         if (isWeight) {
-            var allPaths = this.getAllPathsBetween(v1, v2);
-            var min = Infinity;
-            try {
-                for (var allPaths_1 = __values(allPaths), allPaths_1_1 = allPaths_1.next(); !allPaths_1_1.done; allPaths_1_1 = allPaths_1.next()) {
-                    var path = allPaths_1_1.value;
-                    min = Math.min(this.getPathSumWeight(path), min);
-                }
-            }
-            catch (e_3_1) { e_3 = { error: e_3_1 }; }
-            finally {
-                try {
-                    if (allPaths_1_1 && !allPaths_1_1.done && (_a = allPaths_1.return)) _a.call(allPaths_1);
-                }
-                finally { if (e_3) throw e_3.error; }
+            const allPaths = this.getAllPathsBetween(v1, v2);
+            let min = Infinity;
+            for (const path of allPaths) {
+                min = Math.min(this.getPathSumWeight(path), min);
             }
             return min;
         }
         else {
             // BFS
-            var vertex2 = this._getVertex(v2);
-            var vertex1 = this._getVertex(v1);
+            const vertex2 = this._getVertex(v2);
+            const vertex1 = this._getVertex(v1);
             if (!(vertex1 && vertex2)) {
                 return null;
             }
-            var visited = new Map();
-            var queue = [vertex1];
+            const visited = new Map();
+            const queue = [vertex1];
             visited.set(vertex1, true);
-            var cost = 0;
+            let cost = 0;
             while (queue.length > 0) {
-                for (var i = 0; i < queue.length; i++) {
-                    var cur = queue.shift();
+                for (let i = 0; i < queue.length; i++) {
+                    const cur = queue.shift();
                     if (cur === vertex2) {
                         return cost;
                     }
                     // TODO consider optimizing to AbstractGraph
                     if (cur !== undefined) {
-                        var neighbors = this.getNeighbors(cur);
-                        try {
-                            for (var neighbors_2 = (e_4 = void 0, __values(neighbors)), neighbors_2_1 = neighbors_2.next(); !neighbors_2_1.done; neighbors_2_1 = neighbors_2.next()) {
-                                var neighbor = neighbors_2_1.value;
-                                if (!visited.has(neighbor)) {
-                                    visited.set(neighbor, true);
-                                    queue.push(neighbor);
-                                }
-                            }
-                        }
-                        catch (e_4_1) { e_4 = { error: e_4_1 }; }
-                        finally {
-                            try {
-                                if (neighbors_2_1 && !neighbors_2_1.done && (_b = neighbors_2.return)) _b.call(neighbors_2);
+                        const neighbors = this.getNeighbors(cur);
+                        for (const neighbor of neighbors) {
+                            if (!visited.has(neighbor)) {
+                                visited.set(neighbor, true);
+                                queue.push(neighbor);
                             }
-                            finally { if (e_4) throw e_4.error; }
                         }
                     }
                 }
@@ -403,7 +294,7 @@ var AbstractGraph = /** @class */ (function () {
             }
             return null;
         }
-    };
+    }
     /**
      * The function `getMinPathBetween` returns the minimum path between two vertices in a graph, either based on weight or
      * using a breadth-first search algorithm.
@@ -417,78 +308,52 @@ var AbstractGraph = /** @class */ (function () {
      * @returns The function `getMinPathBetween` returns an array of vertices (`V[]`) representing the minimum path between
      * two vertices (`v1` and `v2`). If there is no path between the vertices, it returns `null`.
      */
-    AbstractGraph.prototype.getMinPathBetween = function (v1, v2, isWeight) {
-        var e_5, _a;
-        var _this = this;
+    getMinPathBetween(v1, v2, isWeight) {
         if (isWeight === undefined)
             isWeight = false;
         if (isWeight) {
-            var allPaths = this.getAllPathsBetween(v1, v2);
-            var min = Infinity;
-            var minIndex = -1;
-            var index = 0;
-            try {
-                for (var allPaths_2 = __values(allPaths), allPaths_2_1 = allPaths_2.next(); !allPaths_2_1.done; allPaths_2_1 = allPaths_2.next()) {
-                    var path = allPaths_2_1.value;
-                    var pathSumWeight = this.getPathSumWeight(path);
-                    if (pathSumWeight < min) {
-                        min = pathSumWeight;
-                        minIndex = index;
-                    }
-                    index++;
-                }
-            }
-            catch (e_5_1) { e_5 = { error: e_5_1 }; }
-            finally {
-                try {
-                    if (allPaths_2_1 && !allPaths_2_1.done && (_a = allPaths_2.return)) _a.call(allPaths_2);
-                }
-                finally { if (e_5) throw e_5.error; }
+            const allPaths = this.getAllPathsBetween(v1, v2);
+            let min = Infinity;
+            let minIndex = -1;
+            let index = 0;
+            for (const path of allPaths) {
+                const pathSumWeight = this.getPathSumWeight(path);
+                if (pathSumWeight < min) {
+                    min = pathSumWeight;
+                    minIndex = index;
+                }
+                index++;
             }
             return allPaths[minIndex] || null;
         }
         else {
             // BFS
-            var minPath_1 = [];
-            var vertex1_1 = this._getVertex(v1);
-            var vertex2 = this._getVertex(v2);
-            if (!(vertex1_1 && vertex2)) {
+            let minPath = [];
+            const vertex1 = this._getVertex(v1);
+            const vertex2 = this._getVertex(v2);
+            if (!(vertex1 && vertex2)) {
                 return [];
             }
-            var dfs_1 = function (cur, dest, visiting, path) {
-                var e_6, _a;
+            const dfs = (cur, dest, visiting, path) => {
                 visiting.set(cur, true);
                 if (cur === dest) {
-                    minPath_1 = __spreadArray([vertex1_1], __read(path), false);
+                    minPath = [vertex1, ...path];
                     return;
                 }
-                var neighbors = _this.getNeighbors(cur);
-                var _loop_2 = function (neighbor) {
+                const neighbors = this.getNeighbors(cur);
+                for (const neighbor of neighbors) {
                     if (!visiting.get(neighbor)) {
                         path.push(neighbor);
-                        dfs_1(neighbor, dest, visiting, path);
-                        (0, utils_1.arrayRemove)(path, function (vertex) { return vertex === neighbor; });
-                    }
-                };
-                try {
-                    for (var neighbors_3 = __values(neighbors), neighbors_3_1 = neighbors_3.next(); !neighbors_3_1.done; neighbors_3_1 = neighbors_3.next()) {
-                        var neighbor = neighbors_3_1.value;
-                        _loop_2(neighbor);
-                    }
-                }
-                catch (e_6_1) { e_6 = { error: e_6_1 }; }
-                finally {
-                    try {
-                        if (neighbors_3_1 && !neighbors_3_1.done && (_a = neighbors_3.return)) _a.call(neighbors_3);
+                        dfs(neighbor, dest, visiting, path);
+                        (0, utils_1.arrayRemove)(path, (vertex) => vertex === neighbor);
                     }
-                    finally { if (e_6) throw e_6.error; }
                 }
                 visiting.set(cur, false);
             };
-            dfs_1(vertex1_1, vertex2, new Map(), []);
-            return minPath_1;
+            dfs(vertex1, vertex2, new Map(), []);
+            return minPath;
         }
-    };
+    }
     /**
      * Dijkstra algorithm time: O(VE) space: O(V + E)
      * /
@@ -510,98 +375,65 @@ var AbstractGraph = /** @class */ (function () {
      * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
      * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<V>`.
      */
-    AbstractGraph.prototype.dijkstraWithoutHeap = function (src, dest, getMinDist, genPaths) {
-        var e_7, _a, e_8, _b;
+    dijkstraWithoutHeap(src, dest, getMinDist, genPaths) {
         if (getMinDist === undefined)
             getMinDist = false;
         if (genPaths === undefined)
             genPaths = false;
         if (dest === undefined)
             dest = null;
-        var minDist = Infinity;
-        var minDest = null;
-        var minPath = [];
-        var paths = [];
-        var vertices = this._vertices;
-        var distMap = new Map();
-        var seen = new Set();
-        var preMap = new Map(); // predecessor
-        var srcVertex = this._getVertex(src);
-        var destVertex = dest ? this._getVertex(dest) : null;
+        let minDist = Infinity;
+        let minDest = null;
+        let minPath = [];
+        const paths = [];
+        const vertices = this._vertices;
+        const distMap = new Map();
+        const seen = new Set();
+        const preMap = new Map(); // predecessor
+        const srcVertex = this._getVertex(src);
+        const destVertex = dest ? this._getVertex(dest) : null;
         if (!srcVertex) {
             return null;
         }
-        try {
-            for (var vertices_2 = __values(vertices), vertices_2_1 = vertices_2.next(); !vertices_2_1.done; vertices_2_1 = vertices_2.next()) {
-                var vertex = vertices_2_1.value;
-                var vertexOrId = vertex[1];
-                if (vertexOrId instanceof AbstractVertex)
-                    distMap.set(vertexOrId, Infinity);
-            }
-        }
-        catch (e_7_1) { e_7 = { error: e_7_1 }; }
-        finally {
-            try {
-                if (vertices_2_1 && !vertices_2_1.done && (_a = vertices_2.return)) _a.call(vertices_2);
-            }
-            finally { if (e_7) throw e_7.error; }
+        for (const vertex of vertices) {
+            const vertexOrId = vertex[1];
+            if (vertexOrId instanceof AbstractVertex)
+                distMap.set(vertexOrId, Infinity);
         }
         distMap.set(srcVertex, 0);
         preMap.set(srcVertex, null);
-        var getMinOfNoSeen = function () {
-            var e_9, _a;
-            var min = Infinity;
-            var minV = null;
-            try {
-                for (var distMap_1 = __values(distMap), distMap_1_1 = distMap_1.next(); !distMap_1_1.done; distMap_1_1 = distMap_1.next()) {
-                    var _b = __read(distMap_1_1.value, 2), key = _b[0], val = _b[1];
-                    if (!seen.has(key)) {
-                        if (val < min) {
-                            min = val;
-                            minV = key;
-                        }
+        const getMinOfNoSeen = () => {
+            let min = Infinity;
+            let minV = null;
+            for (const [key, val] of distMap) {
+                if (!seen.has(key)) {
+                    if (val < min) {
+                        min = val;
+                        minV = key;
                     }
                 }
             }
-            catch (e_9_1) { e_9 = { error: e_9_1 }; }
-            finally {
-                try {
-                    if (distMap_1_1 && !distMap_1_1.done && (_a = distMap_1.return)) _a.call(distMap_1);
-                }
-                finally { if (e_9) throw e_9.error; }
-            }
             return minV;
         };
-        var getPaths = function (minV) {
-            var e_10, _a;
-            try {
-                for (var vertices_3 = __values(vertices), vertices_3_1 = vertices_3.next(); !vertices_3_1.done; vertices_3_1 = vertices_3.next()) {
-                    var vertex = vertices_3_1.value;
-                    var vertexOrId = vertex[1];
-                    if (vertexOrId instanceof AbstractVertex) {
-                        var path = [vertexOrId];
-                        var parent = preMap.get(vertexOrId);
-                        while (parent) {
-                            path.push(parent);
-                            parent = preMap.get(parent);
-                        }
-                        var reversed = path.reverse();
-                        if (vertex[1] === minV)
-                            minPath = reversed;
-                        paths.push(reversed);
+        const getPaths = (minV) => {
+            for (const vertex of vertices) {
+                const vertexOrId = vertex[1];
+                if (vertexOrId instanceof AbstractVertex) {
+                    const path = [vertexOrId];
+                    let parent = preMap.get(vertexOrId);
+                    while (parent) {
+                        path.push(parent);
+                        parent = preMap.get(parent);
                     }
+                    const reversed = path.reverse();
+                    if (vertex[1] === minV)
+                        minPath = reversed;
+                    paths.push(reversed);
                 }
             }
-            catch (e_10_1) { e_10 = { error: e_10_1 }; }
-            finally {
-                try {
-                    if (vertices_3_1 && !vertices_3_1.done && (_a = vertices_3.return)) _a.call(vertices_3);
-                }
-                finally { if (e_10) throw e_10.error; }
-            }
         };
-        for (var i = 1; i < vertices.size; i++) {
-            var cur = getMinOfNoSeen();
+        for (let i = 1; i < vertices.size; i++) {
+            const cur = getMinOfNoSeen();
             if (cur) {
                 seen.add(cur);
                 if (destVertex && destVertex === cur) {
@@ -611,38 +443,28 @@ var AbstractGraph = /** @class */ (function () {
                     if (genPaths) {
                         getPaths(destVertex);
                     }
-                    return { distMap: distMap, preMap: preMap, seen: seen, paths: paths, minDist: minDist, minPath: minPath };
-                }
-                var neighbors = this.getNeighbors(cur);
-                try {
-                    for (var neighbors_4 = (e_8 = void 0, __values(neighbors)), neighbors_4_1 = neighbors_4.next(); !neighbors_4_1.done; neighbors_4_1 = neighbors_4.next()) {
-                        var neighbor = neighbors_4_1.value;
-                        if (!seen.has(neighbor)) {
-                            var edge = this.getEdge(cur, neighbor);
-                            if (edge) {
-                                var curFromMap = distMap.get(cur);
-                                var neighborFromMap = distMap.get(neighbor);
-                                // TODO after no-non-null-assertion not ensure the logic
-                                if (curFromMap !== undefined && neighborFromMap !== undefined) {
-                                    if (edge.weight + curFromMap < neighborFromMap) {
-                                        distMap.set(neighbor, edge.weight + curFromMap);
-                                        preMap.set(neighbor, cur);
-                                    }
+                    return { distMap, preMap, seen, paths, minDist, minPath };
+                }
+                const neighbors = this.getNeighbors(cur);
+                for (const neighbor of neighbors) {
+                    if (!seen.has(neighbor)) {
+                        const edge = this.getEdge(cur, neighbor);
+                        if (edge) {
+                            const curFromMap = distMap.get(cur);
+                            const neighborFromMap = distMap.get(neighbor);
+                            // TODO after no-non-null-assertion not ensure the logic
+                            if (curFromMap !== undefined && neighborFromMap !== undefined) {
+                                if (edge.weight + curFromMap < neighborFromMap) {
+                                    distMap.set(neighbor, edge.weight + curFromMap);
+                                    preMap.set(neighbor, cur);
                                 }
                             }
                         }
                     }
                 }
-                catch (e_8_1) { e_8 = { error: e_8_1 }; }
-                finally {
-                    try {
-                        if (neighbors_4_1 && !neighbors_4_1.done && (_b = neighbors_4.return)) _b.call(neighbors_4);
-                    }
-                    finally { if (e_8) throw e_8.error; }
-                }
             }
         }
-        getMinDist && distMap.forEach(function (d, v) {
+        getMinDist && distMap.forEach((d, v) => {
             if (v !== srcVertex) {
                 if (d < minDist) {
                     minDist = d;
@@ -652,8 +474,8 @@ var AbstractGraph = /** @class */ (function () {
             }
         });
         genPaths && getPaths(minDest);
-        return { distMap: distMap, preMap: preMap, seen: seen, paths: paths, minDist: minDist, minPath: minPath };
-    };
+        return { distMap, preMap, seen, paths, minDist, minPath };
+    }
     /**
      * Dijkstra algorithm time: O(logVE) space: O(V + E)
      *
@@ -680,79 +502,57 @@ var AbstractGraph = /** @class */ (function () {
      * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
      * @returns The function `dijkstra` returns an object of type `DijkstraResult<V>`.
      */
-    AbstractGraph.prototype.dijkstra = function (src, dest, getMinDist, genPaths) {
-        var e_11, _a, e_12, _b;
-        var _c;
+    dijkstra(src, dest, getMinDist, genPaths) {
+        var _a;
         if (getMinDist === undefined)
             getMinDist = false;
         if (genPaths === undefined)
             genPaths = false;
         if (dest === undefined)
             dest = null;
-        var minDist = Infinity;
-        var minDest = null;
-        var minPath = [];
-        var paths = [];
-        var vertices = this._vertices;
-        var distMap = new Map();
-        var seen = new Set();
-        var preMap = new Map(); // predecessor
-        var srcVertex = this._getVertex(src);
-        var destVertex = dest ? this._getVertex(dest) : null;
+        let minDist = Infinity;
+        let minDest = null;
+        let minPath = [];
+        const paths = [];
+        const vertices = this._vertices;
+        const distMap = new Map();
+        const seen = new Set();
+        const preMap = new Map(); // predecessor
+        const srcVertex = this._getVertex(src);
+        const destVertex = dest ? this._getVertex(dest) : null;
         if (!srcVertex) {
             return null;
         }
-        try {
-            for (var vertices_4 = __values(vertices), vertices_4_1 = vertices_4.next(); !vertices_4_1.done; vertices_4_1 = vertices_4.next()) {
-                var vertex = vertices_4_1.value;
-                var vertexOrId = vertex[1];
-                if (vertexOrId instanceof AbstractVertex)
-                    distMap.set(vertexOrId, Infinity);
-            }
-        }
-        catch (e_11_1) { e_11 = { error: e_11_1 }; }
-        finally {
-            try {
-                if (vertices_4_1 && !vertices_4_1.done && (_a = vertices_4.return)) _a.call(vertices_4);
-            }
-            finally { if (e_11) throw e_11.error; }
+        for (const vertex of vertices) {
+            const vertexOrId = vertex[1];
+            if (vertexOrId instanceof AbstractVertex)
+                distMap.set(vertexOrId, Infinity);
         }
-        var heap = new priority_queue_1.PriorityQueue({ comparator: function (a, b) { return a.id - b.id; } });
+        const heap = new priority_queue_1.PriorityQueue({ comparator: (a, b) => a.id - b.id });
         heap.add({ id: 0, val: srcVertex });
         distMap.set(srcVertex, 0);
         preMap.set(srcVertex, null);
-        var getPaths = function (minV) {
-            var e_13, _a;
-            try {
-                for (var vertices_5 = __values(vertices), vertices_5_1 = vertices_5.next(); !vertices_5_1.done; vertices_5_1 = vertices_5.next()) {
-                    var vertex = vertices_5_1.value;
-                    var vertexOrId = vertex[1];
-                    if (vertexOrId instanceof AbstractVertex) {
-                        var path = [vertexOrId];
-                        var parent = preMap.get(vertexOrId);
-                        while (parent) {
-                            path.push(parent);
-                            parent = preMap.get(parent);
-                        }
-                        var reversed = path.reverse();
-                        if (vertex[1] === minV)
-                            minPath = reversed;
-                        paths.push(reversed);
+        const getPaths = (minV) => {
+            for (const vertex of vertices) {
+                const vertexOrId = vertex[1];
+                if (vertexOrId instanceof AbstractVertex) {
+                    const path = [vertexOrId];
+                    let parent = preMap.get(vertexOrId);
+                    while (parent) {
+                        path.push(parent);
+                        parent = preMap.get(parent);
                     }
+                    const reversed = path.reverse();
+                    if (vertex[1] === minV)
+                        minPath = reversed;
+                    paths.push(reversed);
                 }
             }
-            catch (e_13_1) { e_13 = { error: e_13_1 }; }
-            finally {
-                try {
-                    if (vertices_5_1 && !vertices_5_1.done && (_a = vertices_5.return)) _a.call(vertices_5);
-                }
-                finally { if (e_13) throw e_13.error; }
-            }
         };
         while (heap.size > 0) {
-            var curHeapNode = heap.poll();
-            var dist = curHeapNode === null || curHeapNode === void 0 ? void 0 : curHeapNode.id;
-            var cur = curHeapNode === null || curHeapNode === void 0 ? void 0 : curHeapNode.val;
+            const curHeapNode = heap.poll();
+            const dist = curHeapNode === null || curHeapNode === void 0 ? void 0 : curHeapNode.id;
+            const cur = curHeapNode === null || curHeapNode === void 0 ? void 0 : curHeapNode.val;
             if (dist !== undefined) {
                 if (cur) {
                     seen.add(cur);
@@ -763,39 +563,29 @@ var AbstractGraph = /** @class */ (function () {
                         if (genPaths) {
                             getPaths(destVertex);
                         }
-                        return { distMap: distMap, preMap: preMap, seen: seen, paths: paths, minDist: minDist, minPath: minPath };
+                        return { distMap, preMap, seen, paths, minDist, minPath };
                     }
-                    var neighbors = this.getNeighbors(cur);
-                    try {
-                        for (var neighbors_5 = (e_12 = void 0, __values(neighbors)), neighbors_5_1 = neighbors_5.next(); !neighbors_5_1.done; neighbors_5_1 = neighbors_5.next()) {
-                            var neighbor = neighbors_5_1.value;
-                            if (!seen.has(neighbor)) {
-                                var weight = (_c = this.getEdge(cur, neighbor)) === null || _c === void 0 ? void 0 : _c.weight;
-                                if (typeof weight === 'number') {
-                                    var distSrcToNeighbor = distMap.get(neighbor);
-                                    if (distSrcToNeighbor) {
-                                        if (dist + weight < distSrcToNeighbor) {
-                                            heap.add({ id: dist + weight, val: neighbor });
-                                            preMap.set(neighbor, cur);
-                                            distMap.set(neighbor, dist + weight);
-                                        }
+                    const neighbors = this.getNeighbors(cur);
+                    for (const neighbor of neighbors) {
+                        if (!seen.has(neighbor)) {
+                            const weight = (_a = this.getEdge(cur, neighbor)) === null || _a === void 0 ? void 0 : _a.weight;
+                            if (typeof weight === 'number') {
+                                const distSrcToNeighbor = distMap.get(neighbor);
+                                if (distSrcToNeighbor) {
+                                    if (dist + weight < distSrcToNeighbor) {
+                                        heap.add({ id: dist + weight, val: neighbor });
+                                        preMap.set(neighbor, cur);
+                                        distMap.set(neighbor, dist + weight);
                                     }
                                 }
                             }
                         }
                     }
-                    catch (e_12_1) { e_12 = { error: e_12_1 }; }
-                    finally {
-                        try {
-                            if (neighbors_5_1 && !neighbors_5_1.done && (_b = neighbors_5.return)) _b.call(neighbors_5);
-                        }
-                        finally { if (e_12) throw e_12.error; }
-                    }
                 }
             }
         }
         if (getMinDist) {
-            distMap.forEach(function (d, v) {
+            distMap.forEach((d, v) => {
                 if (v !== srcVertex) {
                     if (d < minDist) {
                         minDist = d;
@@ -808,8 +598,8 @@ var AbstractGraph = /** @class */ (function () {
         if (genPaths) {
             getPaths(minDest);
         }
-        return { distMap: distMap, preMap: preMap, seen: seen, paths: paths, minDist: minDist, minPath: minPath };
-    };
+        return { distMap, preMap, seen, paths, minDist, minPath };
+    }
     /**
      * Dijkstra algorithm time: O(logVE) space: O(V + E)
      * /
@@ -850,40 +640,39 @@ var AbstractGraph = /** @class */ (function () {
      * vertex.
      * @returns The function `bellmanFord` returns an object with the following properties:
      */
-    AbstractGraph.prototype.bellmanFord = function (src, scanNegativeCycle, getMin, genPath) {
-        var e_14, _a;
+    bellmanFord(src, scanNegativeCycle, getMin, genPath) {
         if (getMin === undefined)
             getMin = false;
         if (genPath === undefined)
             genPath = false;
-        var srcVertex = this._getVertex(src);
-        var paths = [];
-        var distMap = new Map();
-        var preMap = new Map(); // predecessor
-        var min = Infinity;
-        var minPath = [];
+        const srcVertex = this._getVertex(src);
+        const paths = [];
+        const distMap = new Map();
+        const preMap = new Map(); // predecessor
+        let min = Infinity;
+        let minPath = [];
         // TODO
-        var hasNegativeCycle;
+        let hasNegativeCycle;
         if (scanNegativeCycle)
             hasNegativeCycle = false;
         if (!srcVertex)
-            return { hasNegativeCycle: hasNegativeCycle, distMap: distMap, preMap: preMap, paths: paths, min: min, minPath: minPath };
-        var vertices = this._vertices;
-        var numOfVertices = vertices.size;
-        var edges = this.edgeSet();
-        var numOfEdges = edges.length;
-        this._vertices.forEach(function (vertex) {
+            return { hasNegativeCycle, distMap, preMap, paths, min, minPath };
+        const vertices = this._vertices;
+        const numOfVertices = vertices.size;
+        const edges = this.edgeSet();
+        const numOfEdges = edges.length;
+        this._vertices.forEach(vertex => {
             distMap.set(vertex, Infinity);
         });
         distMap.set(srcVertex, 0);
-        for (var i = 1; i < numOfVertices; ++i) {
-            for (var j = 0; j < numOfEdges; ++j) {
-                var ends = this.getEndsOfEdge(edges[j]);
+        for (let i = 1; i < numOfVertices; ++i) {
+            for (let j = 0; j < numOfEdges; ++j) {
+                const ends = this.getEndsOfEdge(edges[j]);
                 if (ends) {
-                    var _b = __read(ends, 2), s = _b[0], d = _b[1];
-                    var weight = edges[j].weight;
-                    var sWeight = distMap.get(s);
-                    var dWeight = distMap.get(d);
+                    const [s, d] = ends;
+                    const weight = edges[j].weight;
+                    const sWeight = distMap.get(s);
+                    const dWeight = distMap.get(d);
                     if (sWeight !== undefined && dWeight !== undefined) {
                         if (distMap.get(s) !== Infinity && sWeight + weight < dWeight) {
                             distMap.set(d, sWeight + weight);
@@ -893,9 +682,9 @@ var AbstractGraph = /** @class */ (function () {
                 }
             }
         }
-        var minDest = null;
+        let minDest = null;
         if (getMin) {
-            distMap.forEach(function (d, v) {
+            distMap.forEach((d, v) => {
                 if (v !== srcVertex) {
                     if (d < min) {
                         min = d;
@@ -906,46 +695,36 @@ var AbstractGraph = /** @class */ (function () {
             });
         }
         if (genPath) {
-            try {
-                for (var vertices_6 = __values(vertices), vertices_6_1 = vertices_6.next(); !vertices_6_1.done; vertices_6_1 = vertices_6.next()) {
-                    var vertex = vertices_6_1.value;
-                    var vertexOrId = vertex[1];
-                    if (vertexOrId instanceof AbstractVertex) {
-                        var path = [vertexOrId];
-                        var parent = preMap.get(vertexOrId);
-                        while (parent !== undefined) {
-                            path.push(parent);
-                            parent = preMap.get(parent);
-                        }
-                        var reversed = path.reverse();
-                        if (vertex[1] === minDest)
-                            minPath = reversed;
-                        paths.push(reversed);
+            for (const vertex of vertices) {
+                const vertexOrId = vertex[1];
+                if (vertexOrId instanceof AbstractVertex) {
+                    const path = [vertexOrId];
+                    let parent = preMap.get(vertexOrId);
+                    while (parent !== undefined) {
+                        path.push(parent);
+                        parent = preMap.get(parent);
                     }
+                    const reversed = path.reverse();
+                    if (vertex[1] === minDest)
+                        minPath = reversed;
+                    paths.push(reversed);
                 }
             }
-            catch (e_14_1) { e_14 = { error: e_14_1 }; }
-            finally {
-                try {
-                    if (vertices_6_1 && !vertices_6_1.done && (_a = vertices_6.return)) _a.call(vertices_6);
-                }
-                finally { if (e_14) throw e_14.error; }
-            }
         }
-        for (var j = 0; j < numOfEdges; ++j) {
-            var ends = this.getEndsOfEdge(edges[j]);
+        for (let j = 0; j < numOfEdges; ++j) {
+            const ends = this.getEndsOfEdge(edges[j]);
             if (ends) {
-                var _c = __read(ends, 1), s = _c[0];
-                var weight = edges[j].weight;
-                var sWeight = distMap.get(s);
+                const [s] = ends;
+                const weight = edges[j].weight;
+                const sWeight = distMap.get(s);
                 if (sWeight) {
                     if (sWeight !== Infinity && sWeight + weight < sWeight)
                         hasNegativeCycle = true;
                 }
             }
         }
-        return { hasNegativeCycle: hasNegativeCycle, distMap: distMap, preMap: preMap, paths: paths, min: min, minPath: minPath };
-    };
+        return { hasNegativeCycle, distMap, preMap, paths, min, minPath };
+    }
     /**
      * Floyd algorithm time: O(V^3) space: O(V^2), not support graph with negative weight cycle
      * all pairs
@@ -962,28 +741,28 @@ var AbstractGraph = /** @class */ (function () {
      * `predecessor` property is a 2D array of vertices (or `null`) representing the predecessor vertices in the shortest
      * path between vertices in the
      */
-    AbstractGraph.prototype.floyd = function () {
+    floyd() {
         var _a;
-        var idAndVertices = __spreadArray([], __read(this._vertices), false);
-        var n = idAndVertices.length;
-        var costs = [];
-        var predecessor = [];
+        const idAndVertices = [...this._vertices];
+        const n = idAndVertices.length;
+        const costs = [];
+        const predecessor = [];
         // successors
-        for (var i = 0; i < n; i++) {
+        for (let i = 0; i < n; i++) {
             costs[i] = [];
             predecessor[i] = [];
-            for (var j = 0; j < n; j++) {
+            for (let j = 0; j < n; j++) {
                 predecessor[i][j] = null;
             }
         }
-        for (var i = 0; i < n; i++) {
-            for (var j = 0; j < n; j++) {
+        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 || _a === void 0 ? void 0 : _a.weight) || Infinity;
             }
         }
-        for (var k = 0; k < n; k++) {
-            for (var i = 0; i < n; i++) {
-                for (var j = 0; j < n; j++) {
+        for (let k = 0; k < n; k++) {
+            for (let i = 0; i < n; i++) {
+                for (let j = 0; j < n; j++) {
                     if (costs[i][j] > costs[i][k] + costs[k][j]) {
                         costs[i][j] = costs[i][k] + costs[k][j];
                         predecessor[i][j] = idAndVertices[k][1];
@@ -991,8 +770,8 @@ var AbstractGraph = /** @class */ (function () {
                 }
             }
         }
-        return { costs: costs, predecessor: predecessor };
-    };
+        return { costs, predecessor };
+    }
     /**
      * Tarjan is an algorithm based on DFS,which is used to solve the connectivity problem of graphs.
      * Tarjan can find cycles in directed or undirected graph
@@ -1022,12 +801,11 @@ var AbstractGraph = /** @class */ (function () {
      * are arrays of vertices that form cycles within the SCCs.
      * @returns The function `tarjan` returns an object with the following properties:
      */
-    AbstractGraph.prototype.tarjan = function (needArticulationPoints, needBridges, needSCCs, needCycles) {
+    tarjan(needArticulationPoints, needBridges, needSCCs, needCycles) {
         // !! in undirected graph we will not let child visit parent when DFS
         // !! articulation point(in DFS search tree not in graph): (cur !== root && cur.has(child)) && (low(child) >= dfn(cur)) || (cur === root && cur.children() >= 2)
         // !! bridge: low(child) > dfn(cur)
-        var _this = this;
-        var defaultConfig = false;
+        const defaultConfig = false;
         if (needArticulationPoints === undefined)
             needArticulationPoints = defaultConfig;
         if (needBridges === undefined)
@@ -1036,71 +814,60 @@ var AbstractGraph = /** @class */ (function () {
             needSCCs = defaultConfig;
         if (needCycles === undefined)
             needCycles = defaultConfig;
-        var dfnMap = new Map();
-        var lowMap = new Map();
-        var vertices = this._vertices;
-        vertices.forEach(function (v) {
+        const dfnMap = new Map();
+        const lowMap = new Map();
+        const vertices = this._vertices;
+        vertices.forEach(v => {
             dfnMap.set(v, -1);
             lowMap.set(v, Infinity);
         });
-        var _a = __read(vertices.values(), 1), root = _a[0];
-        var articulationPoints = [];
-        var bridges = [];
-        var dfn = 0;
-        var dfs = function (cur, parent) {
-            var e_15, _a;
+        const [root] = vertices.values();
+        const articulationPoints = [];
+        const bridges = [];
+        let dfn = 0;
+        const dfs = (cur, parent) => {
             dfn++;
             dfnMap.set(cur, dfn);
             lowMap.set(cur, dfn);
-            var neighbors = _this.getNeighbors(cur);
-            var childCount = 0; // child in DFS tree not child in graph
-            try {
-                for (var neighbors_6 = __values(neighbors), neighbors_6_1 = neighbors_6.next(); !neighbors_6_1.done; neighbors_6_1 = neighbors_6.next()) {
-                    var neighbor = neighbors_6_1.value;
-                    if (neighbor !== parent) {
-                        if (dfnMap.get(neighbor) === -1) {
-                            childCount++;
-                            dfs(neighbor, cur);
-                        }
-                        var childLow = lowMap.get(neighbor);
-                        var curLow = lowMap.get(cur);
-                        // TODO after no-non-null-assertion not ensure the logic
-                        if (curLow !== undefined && childLow !== undefined) {
-                            lowMap.set(cur, Math.min(curLow, childLow));
-                        }
-                        var curFromMap = dfnMap.get(cur);
-                        if (childLow !== undefined && curFromMap !== undefined) {
-                            if (needArticulationPoints) {
-                                if ((cur === root && childCount >= 2) || ((cur !== root) && (childLow >= curFromMap))) {
-                                    // todo not ensure the logic if (cur === root && childCount >= 2 || ((cur !== root) && (childLow >= curFromMap))) {
-                                    articulationPoints.push(cur);
-                                }
+            const neighbors = this.getNeighbors(cur);
+            let childCount = 0; // child in DFS tree not child in graph
+            for (const neighbor of neighbors) {
+                if (neighbor !== parent) {
+                    if (dfnMap.get(neighbor) === -1) {
+                        childCount++;
+                        dfs(neighbor, cur);
+                    }
+                    const childLow = lowMap.get(neighbor);
+                    const curLow = lowMap.get(cur);
+                    // TODO after no-non-null-assertion not ensure the logic
+                    if (curLow !== undefined && childLow !== undefined) {
+                        lowMap.set(cur, Math.min(curLow, childLow));
+                    }
+                    const curFromMap = dfnMap.get(cur);
+                    if (childLow !== undefined && curFromMap !== undefined) {
+                        if (needArticulationPoints) {
+                            if ((cur === root && childCount >= 2) || ((cur !== root) && (childLow >= curFromMap))) {
+                                // todo not ensure the logic if (cur === root && childCount >= 2 || ((cur !== root) && (childLow >= curFromMap))) {
+                                articulationPoints.push(cur);
                             }
-                            if (needBridges) {
-                                if (childLow > curFromMap) {
-                                    var edgeCurToNeighbor = _this.getEdge(cur, neighbor);
-                                    if (edgeCurToNeighbor) {
-                                        bridges.push(edgeCurToNeighbor);
-                                    }
+                        }
+                        if (needBridges) {
+                            if (childLow > curFromMap) {
+                                const edgeCurToNeighbor = this.getEdge(cur, neighbor);
+                                if (edgeCurToNeighbor) {
+                                    bridges.push(edgeCurToNeighbor);
                                 }
                             }
                         }
                     }
                 }
             }
-            catch (e_15_1) { e_15 = { error: e_15_1 }; }
-            finally {
-                try {
-                    if (neighbors_6_1 && !neighbors_6_1.done && (_a = neighbors_6.return)) _a.call(neighbors_6);
-                }
-                finally { if (e_15) throw e_15.error; }
-            }
         };
         dfs(root, null);
-        var SCCs = new Map();
-        var getSCCs = function () {
-            var SCCs = new Map();
-            lowMap.forEach(function (low, vertex) {
+        let SCCs = new Map();
+        const getSCCs = () => {
+            const SCCs = new Map();
+            lowMap.forEach((low, vertex) => {
                 var _a;
                 if (!SCCs.has(low)) {
                     SCCs.set(low, [vertex]);
@@ -1114,38 +881,37 @@ var AbstractGraph = /** @class */ (function () {
         if (needSCCs) {
             SCCs = getSCCs();
         }
-        var cycles = new Map();
+        const cycles = new Map();
         if (needCycles) {
-            var SCCs_1 = new Map();
-            if (SCCs_1.size < 1) {
-                SCCs_1 = getSCCs();
+            let SCCs = new Map();
+            if (SCCs.size < 1) {
+                SCCs = getSCCs();
             }
-            SCCs_1.forEach(function (SCC, low) {
+            SCCs.forEach((SCC, low) => {
                 if (SCC.length > 1) {
                     cycles.set(low, SCC);
                 }
             });
         }
-        return { dfnMap: dfnMap, lowMap: lowMap, bridges: bridges, articulationPoints: articulationPoints, SCCs: SCCs, cycles: cycles };
-    };
-    AbstractGraph.prototype._addVertexOnly = function (newVertex) {
+        return { dfnMap, lowMap, bridges, articulationPoints, SCCs, cycles };
+    }
+    _addVertexOnly(newVertex) {
         if (this.hasVertex(newVertex)) {
             return false;
             // throw (new Error('Duplicated vertex id is not allowed'));
         }
         this._vertices.set(newVertex.id, newVertex);
         return true;
-    };
-    AbstractGraph.prototype._getVertex = function (vertexOrId) {
-        var vertexId = this._getVertexId(vertexOrId);
+    }
+    _getVertex(vertexOrId) {
+        const vertexId = this._getVertexId(vertexOrId);
         return this._vertices.get(vertexId) || null;
-    };
-    AbstractGraph.prototype._getVertexId = function (vertexOrId) {
+    }
+    _getVertexId(vertexOrId) {
         return vertexOrId instanceof AbstractVertex ? vertexOrId.id : vertexOrId;
-    };
-    AbstractGraph.prototype._setVertices = function (value) {
+    }
+    _setVertices(value) {
         this._vertices = value;
-    };
-    return AbstractGraph;
-}());
+    }
+}
 exports.AbstractGraph = AbstractGraph;