data-structure-typed 0.9.16 → 1.3.1

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

@@ -1,390 +1,422 @@
 "use strict";
-var __extends = (this && this.__extends) || (function () {
-    var extendStatics = function (d, b) {
-        extendStatics = Object.setPrototypeOf ||
-            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
-            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
-        return extendStatics(d, b);
-    };
-    return function (d, b) {
-        if (typeof b !== "function" && b !== null)
-            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
-        extendStatics(d, b);
-        function __() { this.constructor = d; }
-        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-    };
-})();
-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));
-};
-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.");
-};
 Object.defineProperty(exports, "__esModule", { value: true });
 exports.DirectedGraph = exports.DirectedEdge = exports.DirectedVertex = void 0;
-var utils_1 = require("../../utils");
-var abstract_graph_1 = require("./abstract-graph");
-var DirectedVertex = /** @class */ (function (_super) {
-    __extends(DirectedVertex, _super);
-    function DirectedVertex(id) {
-        return _super.call(this, id) || this;
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+const utils_1 = require("../../utils");
+const abstract_graph_1 = require("./abstract-graph");
+class DirectedVertex extends abstract_graph_1.AbstractVertex {
+    /**
+     * The constructor function initializes a vertex with an optional value.
+     * @param {VertexId} id - The `id` parameter is of type `VertexId` and represents the identifier of the vertex. It is
+     * used to uniquely identify the vertex within a graph or data structure.
+     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to initialize the value of the
+     * vertex. If no value is provided, the vertex will be initialized with a default value.
+     */
+    constructor(id, val) {
+        super(id, val);
     }
-    return DirectedVertex;
-}(abstract_graph_1.AbstractVertex));
+}
 exports.DirectedVertex = DirectedVertex;
-var DirectedEdge = /** @class */ (function (_super) {
-    __extends(DirectedEdge, _super);
-    function DirectedEdge(src, dest, weight) {
-        var _this = _super.call(this, weight) || this;
-        _this._src = src;
-        _this._dest = dest;
-        return _this;
+class DirectedEdge extends abstract_graph_1.AbstractEdge {
+    /**
+     * The constructor function initializes the source and destination vertices of an edge, along with an optional weight
+     * and value.
+     * @param {VertexId} src - The `src` parameter is the source vertex ID. It represents the starting point of an edge in
+     * a graph.
+     * @param {VertexId} dest - The `dest` parameter represents the destination vertex of an edge. It is of type
+     * `VertexId`, which is likely a unique identifier for a vertex in a graph.
+     * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge.
+     * @param {T} [val] - The `val` parameter is an optional parameter of type `T`. It represents the value associated with
+     * the edge.
+     */
+    constructor(src, dest, weight, val) {
+        super(weight, val);
+        this._src = src;
+        this._dest = dest;
+    }
+    get src() {
+        return this._src;
+    }
+    set src(v) {
+        this._src = v;
+    }
+    get dest() {
+        return this._dest;
+    }
+    set dest(v) {
+        this._dest = v;
     }
-    Object.defineProperty(DirectedEdge.prototype, "src", {
-        get: function () {
-            return this._src;
-        },
-        set: function (v) {
-            this._src = v;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    Object.defineProperty(DirectedEdge.prototype, "dest", {
-        get: function () {
-            return this._dest;
-        },
-        set: function (v) {
-            this._dest = v;
-        },
-        enumerable: false,
-        configurable: true
-    });
-    return DirectedEdge;
-}(abstract_graph_1.AbstractEdge));
+}
 exports.DirectedEdge = DirectedEdge;
-// Strongly connected, One direction connected, Weakly connected
-var DirectedGraph = /** @class */ (function (_super) {
-    __extends(DirectedGraph, _super);
-    function DirectedGraph() {
-        var _this = _super.call(this) || this;
-        _this._outEdgeMap = new Map();
-        _this._inEdgeMap = new Map();
-        return _this;
+class DirectedGraph extends abstract_graph_1.AbstractGraph {
+    /**
+     * The constructor function initializes an instance of a class.
+     */
+    constructor() {
+        super();
+        this._outEdgeMap = new Map();
+        this._inEdgeMap = new Map();
+    }
+    get outEdgeMap() {
+        return this._outEdgeMap;
+    }
+    get inEdgeMap() {
+        return this._inEdgeMap;
     }
-    DirectedGraph.prototype.getEdge = function (srcOrId, destOrId) {
-        var edges = [];
+    /**
+     * 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.
+     */
+    /**
+     * The function creates a new vertex with an optional value and returns it.
+     * @param {VertexId} id - The `id` parameter is the unique identifier for the vertex. It is of type `VertexId`, which
+     * could be a number or a string depending on how you want to identify your vertices.
+     * @param [val] - The 'val' parameter is an optional value that can be assigned to the vertex. If a value is provided,
+     * it will be assigned to the 'val' property of the vertex. If no value is provided, the 'val' property will be
+     * assigned the same value as the 'id' parameter
+     * @returns a new instance of a DirectedVertex object, casted as type V.
+     */
+    createVertex(id, val) {
+        return new DirectedVertex(id, val !== null && val !== void 0 ? val : id);
+    }
+    /**
+     * 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.
+     */
+    /**
+     * The function creates a directed edge between two vertices with an optional weight and value.
+     * @param {VertexId} src - The source vertex ID of the edge. It represents the starting point of the edge.
+     * @param {VertexId} dest - The `dest` parameter is the identifier of the destination vertex for the edge.
+     * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge. If no
+     * weight is provided, it defaults to 1.
+     * @param [val] - The 'val' parameter is an optional value that can be assigned to the edge. It can be of any type and
+     * is used to store additional information or data associated with the edge.
+     * @returns a new instance of a DirectedEdge object, casted as type E.
+     */
+    createEdge(src, dest, weight, val) {
+        return new DirectedEdge(src, dest, weight !== null && weight !== void 0 ? weight : 1, val);
+    }
+    /**
+     * The `getEdge` function retrieves an edge between two vertices based on their source and destination IDs.
+     * @param {V | null | VertexId} srcOrId - The source vertex or its ID. It can be either a vertex object or a vertex ID.
+     * @param {V | null | VertexId} destOrId - The `destOrId` parameter in the `getEdge` function represents the
+     * destination vertex of the edge. It can be either a vertex object (`V`), a vertex ID (`VertexId`), or `null` if the
+     * destination is not specified.
+     * @returns the first edge found between the source and destination vertices, or null if no such edge is found.
+     */
+    getEdge(srcOrId, destOrId) {
+        let edges = [];
         if (srcOrId !== null && destOrId !== null) {
-            var src = this.getVertex(srcOrId);
-            var dest_1 = this.getVertex(destOrId);
-            if (src && dest_1) {
-                var srcOutEdges = this._outEdgeMap.get(src);
+            const src = this._getVertex(srcOrId);
+            const dest = this._getVertex(destOrId);
+            if (src && dest) {
+                const srcOutEdges = this._outEdgeMap.get(src);
                 if (srcOutEdges) {
-                    edges = srcOutEdges.filter(function (edge) { return edge.dest === dest_1.id; });
+                    edges = srcOutEdges.filter(edge => edge.dest === dest.id);
                 }
             }
         }
         return edges[0] || null;
-    };
-    DirectedGraph.prototype.addEdge = function (edge) {
-        if (!(this.containsVertex(edge.src) && this.containsVertex(edge.dest))) {
-            return false;
-        }
-        var srcVertex = this.getVertex(edge.src);
-        var destVertex = this.getVertex(edge.dest);
-        // TODO after no-non-null-assertion not ensure the logic
-        if (srcVertex && destVertex) {
-            var srcOutEdges = this._outEdgeMap.get(srcVertex);
-            if (srcOutEdges) {
-                srcOutEdges.push(edge);
-            }
-            else {
-                this._outEdgeMap.set(srcVertex, [edge]);
-            }
-            var destInEdges = this._inEdgeMap.get(destVertex);
-            if (destInEdges) {
-                destInEdges.push(edge);
-            }
-            else {
-                this._inEdgeMap.set(destVertex, [edge]);
-            }
-            return true;
-        }
-        else {
-            return false;
-        }
-    };
-    DirectedGraph.prototype.removeEdgeBetween = function (srcOrId, destOrId) {
-        var src = this.getVertex(srcOrId);
-        var dest = this.getVertex(destOrId);
-        var removed = null;
+    }
+    /**
+     * The function removes an edge between two vertices in a graph and returns the removed edge.
+     * @param {V | VertexId} srcOrId - The source vertex or its ID.
+     * @param {V | VertexId} destOrId - The `destOrId` parameter represents the destination vertex or its ID.
+     * @returns the removed edge (E) if it exists, or null if either the source or destination vertex does not exist.
+     */
+    removeEdgeSrcToDest(srcOrId, destOrId) {
+        const src = this._getVertex(srcOrId);
+        const dest = this._getVertex(destOrId);
+        let removed = null;
         if (!src || !dest) {
             return null;
         }
-        var srcOutEdges = this._outEdgeMap.get(src);
+        const srcOutEdges = this._outEdgeMap.get(src);
         if (srcOutEdges) {
-            (0, utils_1.arrayRemove)(srcOutEdges, function (edge) { return edge.dest === dest.id; });
+            (0, utils_1.arrayRemove)(srcOutEdges, (edge) => edge.dest === dest.id);
         }
-        var destInEdges = this._inEdgeMap.get(dest);
+        const destInEdges = this._inEdgeMap.get(dest);
         if (destInEdges) {
-            removed = (0, utils_1.arrayRemove)(destInEdges, function (edge) { return edge.src === src.id; })[0] || null;
+            removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.src === src.id)[0] || null;
         }
         return removed;
-    };
-    DirectedGraph.prototype.removeEdge = function (edge) {
-        var removed = null;
-        var src = this.getVertex(edge.src);
-        var dest = this.getVertex(edge.dest);
+    }
+    /**
+     * The function removes an edge from a graph and returns the removed edge, or null if the edge was not found.
+     * @param {E} edge - The `edge` parameter is an object that represents an edge in a graph. It has two properties: `src`
+     * and `dest`, which represent the source and destination vertices of the edge, respectively.
+     * @returns The method `removeEdge` returns the removed edge (`E`) if it exists, or `null` if the edge does not exist.
+     */
+    removeEdge(edge) {
+        let removed = null;
+        const src = this._getVertex(edge.src);
+        const dest = this._getVertex(edge.dest);
         if (src && dest) {
-            var srcOutEdges = this._outEdgeMap.get(src);
+            const srcOutEdges = this._outEdgeMap.get(src);
             if (srcOutEdges && srcOutEdges.length > 0) {
-                (0, utils_1.arrayRemove)(srcOutEdges, function (edge) { return edge.src === src.id; });
+                (0, utils_1.arrayRemove)(srcOutEdges, (edge) => edge.src === src.id);
             }
-            var destInEdges = this._inEdgeMap.get(dest);
+            const destInEdges = this._inEdgeMap.get(dest);
             if (destInEdges && destInEdges.length > 0) {
-                removed = (0, utils_1.arrayRemove)(destInEdges, function (edge) { return edge.dest === dest.id; })[0];
+                removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.dest === dest.id)[0];
             }
         }
         return removed;
-    };
-    DirectedGraph.prototype.removeAllEdges = function (src, dest) {
-        return [];
-    };
-    DirectedGraph.prototype.incomingEdgesOf = function (vertexOrId) {
-        var target = this.getVertex(vertexOrId);
+    }
+    /**
+     * The function removes edges between two vertices and returns the removed edges.
+     * @param {VertexId | V} v1 - The parameter `v1` can be either a `VertexId` or a `V`. A `VertexId` represents the
+     * unique identifier of a vertex in a graph, while `V` represents the actual vertex object.
+     * @param {VertexId | V} v2 - The parameter `v2` represents either a `VertexId` or a `V` object. It is used to specify
+     * the second vertex in the edge that needs to be removed.
+     * @returns an array of removed edges (E[]).
+     */
+    removeEdgesBetween(v1, v2) {
+        const removed = [];
+        if (v1 && v2) {
+            const v1ToV2 = this.removeEdgeSrcToDest(v1, v2);
+            const v2ToV1 = this.removeEdgeSrcToDest(v2, v1);
+            v1ToV2 && removed.push(v1ToV2);
+            v2ToV1 && removed.push(v2ToV1);
+        }
+        return removed;
+    }
+    /**
+     * The function `incomingEdgesOf` returns an array of incoming edges for a given vertex or vertex ID.
+     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a vertex object (`V`) or a vertex ID
+     * (`VertexId`).
+     * @returns The method `incomingEdgesOf` returns an array of edges (`E[]`).
+     */
+    incomingEdgesOf(vertexOrId) {
+        const target = this._getVertex(vertexOrId);
         if (target) {
-            return this._inEdgeMap.get(target) || [];
+            return this.inEdgeMap.get(target) || [];
         }
         return [];
-    };
-    DirectedGraph.prototype.outgoingEdgesOf = function (vertexOrId) {
-        var target = this.getVertex(vertexOrId);
+    }
+    /**
+     * The function `outgoingEdgesOf` returns an array of outgoing edges from a given vertex or vertex ID.
+     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can accept either a vertex object (`V`) or a vertex ID
+     * (`VertexId`).
+     * @returns The method `outgoingEdgesOf` returns an array of edges (`E[]`).
+     */
+    outgoingEdgesOf(vertexOrId) {
+        const target = this._getVertex(vertexOrId);
         if (target) {
             return this._outEdgeMap.get(target) || [];
         }
         return [];
-    };
-    DirectedGraph.prototype.degreeOf = function (vertexOrId) {
+    }
+    /**
+     * The function "degreeOf" returns the total degree of a vertex, which is the sum of its out-degree and in-degree.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
+     * @returns The sum of the out-degree and in-degree of the specified vertex or vertex ID.
+     */
+    degreeOf(vertexOrId) {
         return this.outDegreeOf(vertexOrId) + this.inDegreeOf(vertexOrId);
-    };
-    DirectedGraph.prototype.inDegreeOf = function (vertexOrId) {
+    }
+    /**
+     * The function "inDegreeOf" returns the number of incoming edges for a given vertex.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
+     * @returns The number of incoming edges of the specified vertex or vertex ID.
+     */
+    inDegreeOf(vertexOrId) {
         return this.incomingEdgesOf(vertexOrId).length;
-    };
-    DirectedGraph.prototype.outDegreeOf = function (vertexOrId) {
+    }
+    /**
+     * The function `outDegreeOf` returns the number of outgoing edges from a given vertex.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
+     * @returns The number of outgoing edges from the specified vertex or vertex ID.
+     */
+    outDegreeOf(vertexOrId) {
         return this.outgoingEdgesOf(vertexOrId).length;
-    };
-    DirectedGraph.prototype.edgesOf = function (vertexOrId) {
-        return __spreadArray(__spreadArray([], __read(this.outgoingEdgesOf(vertexOrId)), false), __read(this.incomingEdgesOf(vertexOrId)), false);
-    };
-    DirectedGraph.prototype.getEdgeSrc = function (e) {
-        return this.getVertex(e.src);
-    };
-    DirectedGraph.prototype.getEdgeDest = function (e) {
-        return this.getVertex(e.dest);
-    };
-    DirectedGraph.prototype.getDestinations = function (vertex) {
-        var e_1, _a;
+    }
+    /**
+     * The function "edgesOf" returns an array of both outgoing and incoming edges of a given vertex or vertex ID.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
+     * @returns The function `edgesOf` returns an array of edges.
+     */
+    edgesOf(vertexOrId) {
+        return [...this.outgoingEdgesOf(vertexOrId), ...this.incomingEdgesOf(vertexOrId)];
+    }
+    /**
+     * The function "getEdgeSrc" returns the source vertex of an edge, or null if the edge does not exist.
+     * @param {E} e - The parameter "e" is of type E, which represents an edge in a graph.
+     * @returns either a vertex object (V) or null.
+     */
+    getEdgeSrc(e) {
+        return this._getVertex(e.src);
+    }
+    /**
+     * The function "getEdgeDest" returns the destination vertex of an edge.
+     * @param {E} e - The parameter "e" is of type "E", which represents an edge in a graph.
+     * @returns either a vertex object of type V or null.
+     */
+    getEdgeDest(e) {
+        return this._getVertex(e.dest);
+    }
+    /**
+     * The function `getDestinations` returns an array of destination vertices connected to a given vertex.
+     * @param {V | VertexId | null} vertex - The `vertex` parameter represents the starting vertex from which we want to
+     * find the destinations. It can be either a `V` object, a `VertexId` value, or `null`.
+     * @returns an array of vertices (V[]).
+     */
+    getDestinations(vertex) {
         if (vertex === null) {
             return [];
         }
-        var destinations = [];
-        var outgoingEdges = this.outgoingEdgesOf(vertex);
-        try {
-            for (var outgoingEdges_1 = __values(outgoingEdges), outgoingEdges_1_1 = outgoingEdges_1.next(); !outgoingEdges_1_1.done; outgoingEdges_1_1 = outgoingEdges_1.next()) {
-                var outEdge = outgoingEdges_1_1.value;
-                var child = this.getEdgeDest(outEdge);
-                if (child) {
-                    destinations.push(child);
-                }
-            }
-        }
-        catch (e_1_1) { e_1 = { error: e_1_1 }; }
-        finally {
-            try {
-                if (outgoingEdges_1_1 && !outgoingEdges_1_1.done && (_a = outgoingEdges_1.return)) _a.call(outgoingEdges_1);
+        const destinations = [];
+        const outgoingEdges = this.outgoingEdgesOf(vertex);
+        for (const outEdge of outgoingEdges) {
+            const child = this.getEdgeDest(outEdge);
+            if (child) {
+                destinations.push(child);
             }
-            finally { if (e_1) throw e_1.error; }
         }
         return destinations;
-    };
-    /**--- start find cycles --- */
+    }
     /**
-     * when stored with adjacency list time: O(V+E)
-     * when stored with adjacency matrix time: O(V^2)
+     * The `topologicalSort` function performs a topological sort on a graph and returns an array of vertices or vertex IDs
+     * in the sorted order, or null if the graph contains a cycle.
+     * @param {'vertex' | 'id'} [propertyName] - The `propertyName` parameter is an optional parameter that specifies the
+     * property to use for sorting the vertices. It can have two possible values: 'vertex' or 'id'. If 'vertex' is
+     * specified, the vertices themselves will be used for sorting. If 'id' is specified, the ids of
+     * @returns an array of vertices or vertex IDs in topological order. If there is a cycle in the graph, it returns null.
      */
-    DirectedGraph.prototype.topologicalSort = function () {
-        var e_2, _a, e_3, _b;
-        var _this = this;
-        // vector<vector<int>> g;
-        // vector<int> color;
-        // int last;
-        // bool hasCycle;
-        //
-        // bool topo_sort() {
-        //     int n = g.size();
-        //     vector<int> degree(n, 0);
-        //     queue<int> q;
-        //     for (int i = 0; i < n; i++) {
-        //         degree[i] = g[i].size();
-        //         if (degree[i] <= 1) {
-        //             q.push(i);
-        //         }
-        //     }
-        //     int cnt = 0;
-        //     while (!q.empty()) {
-        //         cnt++;
-        //         int root = q.front();
-        //         q.pop();
-        //         for (auto child : g[root]) {
-        //             degree[child]--;
-        //             if (degree[child] == 1) {
-        //                 q.push(child);
-        //             }
-        //         }
-        //     }
-        //     return (cnt != n);
-        // }
+    topologicalSort(propertyName) {
+        propertyName = propertyName !== null && propertyName !== void 0 ? propertyName : 'id';
         // When judging whether there is a cycle in the undirected graph, all nodes with degree of **<= 1** are enqueued
         // When judging whether there is a cycle in the directed graph, all nodes with **in degree = 0** are enqueued
-        var statusMap = new Map();
-        try {
-            for (var _c = __values(this._vertices), _d = _c.next(); !_d.done; _d = _c.next()) {
-                var entry = _d.value;
-                statusMap.set(entry[1], 0);
-            }
-        }
-        catch (e_2_1) { e_2 = { error: e_2_1 }; }
-        finally {
-            try {
-                if (_d && !_d.done && (_a = _c.return)) _a.call(_c);
-            }
-            finally { if (e_2) throw e_2.error; }
+        const statusMap = new Map();
+        for (const entry of this.vertices) {
+            statusMap.set(entry[1], 0);
         }
-        var sorted = [];
-        var hasCycle = false;
-        var dfs = function (cur) {
-            var e_4, _a;
+        let sorted = [];
+        let hasCycle = false;
+        const dfs = (cur) => {
             statusMap.set(cur, 1);
-            var children = _this.getDestinations(cur);
-            try {
-                for (var children_1 = __values(children), children_1_1 = children_1.next(); !children_1_1.done; children_1_1 = children_1.next()) {
-                    var child = children_1_1.value;
-                    var childStatus = statusMap.get(child);
-                    if (childStatus === 0) {
-                        dfs(child);
-                    }
-                    else if (childStatus === 1) {
-                        hasCycle = true;
-                    }
+            const children = this.getDestinations(cur);
+            for (const child of children) {
+                const childStatus = statusMap.get(child);
+                if (childStatus === 0) {
+                    dfs(child);
                 }
-            }
-            catch (e_4_1) { e_4 = { error: e_4_1 }; }
-            finally {
-                try {
-                    if (children_1_1 && !children_1_1.done && (_a = children_1.return)) _a.call(children_1);
+                else if (childStatus === 1) {
+                    hasCycle = true;
                 }
-                finally { if (e_4) throw e_4.error; }
             }
             statusMap.set(cur, 2);
             sorted.push(cur);
         };
-        try {
-            for (var _e = __values(this._vertices), _f = _e.next(); !_f.done; _f = _e.next()) {
-                var entry = _f.value;
-                if (statusMap.get(entry[1]) === 0) {
-                    dfs(entry[1]);
-                }
-            }
-        }
-        catch (e_3_1) { e_3 = { error: e_3_1 }; }
-        finally {
-            try {
-                if (_f && !_f.done && (_b = _e.return)) _b.call(_e);
+        for (const entry of this.vertices) {
+            if (statusMap.get(entry[1]) === 0) {
+                dfs(entry[1]);
             }
-            finally { if (e_3) throw e_3.error; }
         }
-        if (hasCycle) {
+        if (hasCycle)
             return null;
-        }
+        if (propertyName === 'id')
+            sorted = sorted.map(vertex => vertex instanceof DirectedVertex ? vertex.id : vertex);
         return sorted.reverse();
-    };
-    /**--- end find cycles --- */
-    DirectedGraph.prototype.edgeSet = function () {
-        var edges = [];
-        this._outEdgeMap.forEach(function (outEdges) {
-            edges = __spreadArray(__spreadArray([], __read(edges), false), __read(outEdges), false);
+    }
+    /**
+     * The `edgeSet` function returns an array of all the edges in the graph.
+     * @returns The `edgeSet()` method returns an array of edges (`E[]`).
+     */
+    edgeSet() {
+        let edges = [];
+        this._outEdgeMap.forEach(outEdges => {
+            edges = [...edges, ...outEdges];
         });
         return edges;
-    };
-    DirectedGraph.prototype.getNeighbors = function (vertexOrId) {
-        var e_5, _a;
-        var neighbors = [];
-        var vertex = this.getVertex(vertexOrId);
+    }
+    /**
+     * The function `getNeighbors` returns an array of neighboring vertices of a given vertex or vertex ID in a graph.
+     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a vertex object (`V`) or a vertex ID
+     * (`VertexId`).
+     * @returns an array of vertices (V[]).
+     */
+    getNeighbors(vertexOrId) {
+        const neighbors = [];
+        const vertex = this._getVertex(vertexOrId);
         if (vertex) {
-            var outEdges = this.outgoingEdgesOf(vertex);
-            try {
-                for (var outEdges_1 = __values(outEdges), outEdges_1_1 = outEdges_1.next(); !outEdges_1_1.done; outEdges_1_1 = outEdges_1.next()) {
-                    var outEdge = outEdges_1_1.value;
-                    var neighbor = this.getVertex(outEdge.dest);
-                    // TODO after no-non-null-assertion not ensure the logic
-                    if (neighbor) {
-                        neighbors.push(neighbor);
-                    }
-                }
-            }
-            catch (e_5_1) { e_5 = { error: e_5_1 }; }
-            finally {
-                try {
-                    if (outEdges_1_1 && !outEdges_1_1.done && (_a = outEdges_1.return)) _a.call(outEdges_1);
+            const outEdges = this.outgoingEdgesOf(vertex);
+            for (const outEdge of outEdges) {
+                const neighbor = this._getVertex(outEdge.dest);
+                // TODO after no-non-null-assertion not ensure the logic
+                if (neighbor) {
+                    neighbors.push(neighbor);
                 }
-                finally { if (e_5) throw e_5.error; }
             }
         }
         return neighbors;
-    };
-    DirectedGraph.prototype.getEndsOfEdge = function (edge) {
-        if (!this.containsEdge(edge.src, edge.dest)) {
+    }
+    /**
+     * The function "getEndsOfEdge" returns the source and destination vertices of an edge if it exists in the graph,
+     * otherwise it returns null.
+     * @param {E} edge - The parameter `edge` is of type `E`, which represents an edge in a graph.
+     * @returns The function `getEndsOfEdge` returns an array containing two vertices `[V, V]` if the edge exists in the
+     * graph. If the edge does not exist, it returns `null`.
+     */
+    getEndsOfEdge(edge) {
+        if (!this.hasEdge(edge.src, edge.dest)) {
             return null;
         }
-        var v1 = this.getVertex(edge.src);
-        var v2 = this.getVertex(edge.dest);
+        const v1 = this._getVertex(edge.src);
+        const v2 = this._getVertex(edge.dest);
         if (v1 && v2) {
             return [v1, v2];
         }
         else {
             return null;
         }
-    };
-    return DirectedGraph;
-}(abstract_graph_1.AbstractGraph));
+    }
+    /**
+     * The function `_addEdgeOnly` adds an edge to a graph if the source and destination vertices exist.
+     * @param {E} edge - The parameter `edge` is of type `E`, which represents an edge in a graph. It is the edge that
+     * needs to be added to the graph.
+     * @returns a boolean value. It returns true if the edge was successfully added to the graph, and false if either the
+     * source or destination vertex does not exist in the graph.
+     */
+    _addEdgeOnly(edge) {
+        if (!(this.hasVertex(edge.src) && this.hasVertex(edge.dest))) {
+            return false;
+        }
+        const srcVertex = this._getVertex(edge.src);
+        const destVertex = this._getVertex(edge.dest);
+        // TODO after no-non-null-assertion not ensure the logic
+        if (srcVertex && destVertex) {
+            const srcOutEdges = this._outEdgeMap.get(srcVertex);
+            if (srcOutEdges) {
+                srcOutEdges.push(edge);
+            }
+            else {
+                this._outEdgeMap.set(srcVertex, [edge]);
+            }
+            const destInEdges = this._inEdgeMap.get(destVertex);
+            if (destInEdges) {
+                destInEdges.push(edge);
+            }
+            else {
+                this._inEdgeMap.set(destVertex, [edge]);
+            }
+            return true;
+        }
+        else {
+            return false;
+        }
+    }
+    _setOutEdgeMap(value) {
+        this._outEdgeMap = value;
+    }
+    _setInEdgeMap(value) {
+        this._inEdgeMap = value;
+    }
+}
 exports.DirectedGraph = DirectedGraph;