@raikuxq/alg-ds 1.1.7 → 1.2.2

package/lib/data-structures/BinaryTree/BinarySearchTree/BinarySearchTree.js

@@ -1,271 +0,0 @@
-"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) {
-        extendStatics(d, b);
-        function __() { this.constructor = d; }
-        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
-    };
-})();
-Object.defineProperty(exports, "__esModule", { value: true });
-var EnumTreeTraversalType_1 = require("../../../types/EnumTreeTraversalType");
-var AbstractBinaryTree_1 = require("../AbstractBinaryTree/AbstractBinaryTree");
-var BinarySearchNode_1 = require("./BinarySearchNode");
-var Queue_1 = require("../../Queue/Queue");
-var IsAlreadyExistsException_1 = require("../../../exceptions/IsAlreadyExistsException");
-var IsNotFoundException_1 = require("../../../exceptions/IsNotFoundException");
-var IsEmptyException_1 = require("../../../exceptions/IsEmptyException");
-/**
- * Unbalanced binary search tree implementation
- */
-var BinarySearchTree = /** @class */ (function (_super) {
-    __extends(BinarySearchTree, _super);
-    /**
-     * @inheritDoc
-     */
-    function BinarySearchTree(fnCompare) {
-        var _this = _super.call(this, fnCompare) || this;
-        _this._head = null;
-        return _this;
-    }
-    /**
-     *
-     * @throws when head is empty
-     */
-    BinarySearchTree.prototype.checkIsEmpty = function () {
-        if (this._head === null) {
-            throw new IsEmptyException_1.default("Tree is empty");
-        }
-    };
-    /**
-     * Will update left and right links parent with current node
-     */
-    BinarySearchTree.prototype.updateLeftRightParents = function (node) {
-        if (node.left && node.left.parent !== node) {
-            node.left.parent = node;
-        }
-        if (node.right && node.right.parent !== node) {
-            node.right.parent = node;
-        }
-    };
-    /**
-     * Will return node instance by its data
-     */
-    BinarySearchTree.prototype.findNode = function (value) {
-        var current = this._head;
-        while (current && current.data !== value) {
-            current = this.compare(current.data, value)
-                ? current.left
-                : current.right;
-        }
-        return current;
-    };
-    /**
-     * @inheritDoc
-     */
-    BinarySearchTree.prototype.insertToLeaf = function (createdNode) {
-        var parent = null;
-        var current = this._head;
-        while (current) {
-            parent = current;
-            current = this.compare(current.data, createdNode.data)
-                ? current.left
-                : current.right;
-        }
-        createdNode.parent = parent;
-        if (parent === null) {
-            this._head = createdNode;
-        }
-        else {
-            if (this.compare(parent.data, createdNode.data)) {
-                parent.left = createdNode;
-            }
-            else {
-                parent.right = createdNode;
-            }
-        }
-        this._length++;
-    };
-    /**
-     * Will join two trees into one   */
-    BinarySearchTree.prototype.join = function (treeLeft, treeRight) {
-        if (treeLeft === null) {
-            return treeRight;
-        }
-        if (treeRight === null) {
-            return treeLeft;
-        }
-        treeRight.left = this.join(treeLeft, treeRight.left);
-        if (treeRight.left) {
-            this.updateLeftRightParents(treeRight);
-        }
-        return treeRight;
-    };
-    /**
-     * @inheritDoc
-     */
-    BinarySearchTree.prototype.max = function () {
-        this.checkIsEmpty();
-        var currentNode = this._head;
-        while (currentNode === null || currentNode === void 0 ? void 0 : currentNode.right) {
-            currentNode = currentNode.right;
-        }
-        return currentNode.data;
-    };
-    /**
-     * @inheritDoc
-     */
-    BinarySearchTree.prototype.min = function () {
-        this.checkIsEmpty();
-        var currentNode = this._head;
-        while (currentNode === null || currentNode === void 0 ? void 0 : currentNode.left) {
-            currentNode = currentNode.left;
-        }
-        return currentNode.data;
-    };
-    /**
-     * @inheritDoc
-     */
-    BinarySearchTree.prototype.insert = function (value) {
-        if (this.has(value)) {
-            throw new IsAlreadyExistsException_1.default("Node already exists");
-        }
-        var createdNode = new BinarySearchNode_1.default(value);
-        this.insertToLeaf(createdNode);
-    };
-    /**
-     * @inheritDoc
-     */
-    BinarySearchTree.prototype.has = function (value) {
-        var current = this.findNode(value);
-        return (current === null || current === void 0 ? void 0 : current.data) === value;
-    };
-    /**
-     * @inheritDoc
-     */
-    BinarySearchTree.prototype.delete = function (value) {
-        var _this = this;
-        if (!this.has(value)) {
-            throw new IsNotFoundException_1.default("Value does not exist in the tree");
-        }
-        var recursiveDelete = function (node, value) {
-            if (node === null) {
-                return node;
-            }
-            if (node.data === value) {
-                var updatedNode = _this.join(node.left, node.right);
-                if (updatedNode) {
-                    updatedNode.parent = node.parent;
-                }
-                return updatedNode;
-            }
-            else if (_this.compare(node.data, value)) {
-                node.left = recursiveDelete(node.left, value);
-            }
-            else {
-                node.right = recursiveDelete(node.right, value);
-            }
-            _this.updateLeftRightParents(node);
-            return node;
-        };
-        this._head = recursiveDelete(this._head, value);
-        this._length--;
-    };
-    /**
-     * @inheritDoc
-     */
-    BinarySearchTree.prototype.subtree = function (value) {
-        var tree = new BinarySearchTree();
-        var node = this.findNode(value);
-        var queue = new Queue_1.default();
-        var traverse = [];
-        queue.push(node);
-        while (!queue.isEmpty()) {
-            var currentNode = queue.pop();
-            traverse.push(currentNode);
-            if (currentNode === null || currentNode === void 0 ? void 0 : currentNode.left) {
-                queue.push(currentNode.left);
-            }
-            if (currentNode === null || currentNode === void 0 ? void 0 : currentNode.right) {
-                queue.push(currentNode.right);
-            }
-        }
-        traverse.forEach(function (elem) {
-            if (elem !== null) {
-                tree.insert(elem.data);
-            }
-        });
-        return tree;
-    };
-    /**
-     * @inheritDoc
-     */
-    BinarySearchTree.prototype.traverse = function (type, from) {
-        this.checkIsEmpty();
-        var array = new Array(this.length());
-        var root = from !== undefined ? this.findNode(from) : this._head;
-        var storeInOrder = function (node) {
-            if (node === null) {
-                return;
-            }
-            storeInOrder(node.left);
-            array.push(node.data);
-            storeInOrder(node.right);
-        };
-        var storePostOrder = function (node) {
-            if (node === null) {
-                return;
-            }
-            storeInOrder(node.left);
-            storeInOrder(node.right);
-            array.push(node.data);
-        };
-        var storePreOrder = function (node) {
-            if (node === null) {
-                return;
-            }
-            array.push(node.data);
-            storeInOrder(node.left);
-            storeInOrder(node.right);
-        };
-        switch (type) {
-            case EnumTreeTraversalType_1.EnumTreeTraversalType.InOrder:
-                storeInOrder(root);
-                break;
-            case EnumTreeTraversalType_1.EnumTreeTraversalType.PostOrder:
-                storePostOrder(root);
-                break;
-            case EnumTreeTraversalType_1.EnumTreeTraversalType.PreOrder:
-                storePreOrder(root);
-                break;
-        }
-        return array.filter(function (item) { return item !== undefined; });
-    };
-    /**
-     * Calc max height of the largest branch of the tree
-     */
-    BinarySearchTree.prototype.height = function () {
-        var calcHeight = function (node) {
-            if (node === null)
-                return 0;
-            var left = node.left === null ? -1 : calcHeight(node.left);
-            var right = node.right === null ? -1 : calcHeight(node.right);
-            var max = left > right ? left : right;
-            return max + 1;
-        };
-        if (this._head === null) {
-            return 0;
-        }
-        else {
-            return calcHeight(this._head) + 1;
-        }
-    };
-    return BinarySearchTree;
-}(AbstractBinaryTree_1.default));
-exports.default = BinarySearchTree;
-//# sourceMappingURL=data:application/json;base64,{"version":3,"file":"BinarySearchTree.js","sourceRoot":"","sources":["../../../../src/data-structures/BinaryTree/BinarySearchTree/BinarySearchTree.ts"],"names":[],"mappings":";;;;;;;;;;;;;;;AACA,8EAA6E;AAE7E,+EAA0E;AAC1E,uDAAkD;AAClD,2CAAsC;AACtC,yFAAoF;AACpF,+EAA0E;AAC1E,yEAAoE;AAEpE;;GAEG;AACH;IAAiD,oCAAqB;IAMpE;;OAEG;IACH,0BAAmB,SAA2B;QAA9C,YACE,kBAAM,SAAS,CAAC,SAEjB;QADC,KAAI,CAAC,KAAK,GAAG,IAAI,CAAC;;IACpB,CAAC;IAED;;;OAGG;IACO,uCAAY,GAAtB;QACE,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACvB,MAAM,IAAI,0BAAgB,CAAC,eAAe,CAAC,CAAC;SAC7C;IACH,CAAC;IAED;;OAEG;IACO,iDAAsB,GAAhC,UAAiC,IAAyB;QACxD,IAAI,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,IAAI,EAAE;YAC1C,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,IAAI,CAAC;SACzB;QACD,IAAI,IAAI,CAAC,KAAK,IAAI,IAAI,CAAC,KAAK,CAAC,MAAM,KAAK,IAAI,EAAE;YAC5C,IAAI,CAAC,KAAK,CAAC,MAAM,GAAG,IAAI,CAAC;SAC1B;IACH,CAAC;IAED;;OAEG;IACO,mCAAQ,GAAlB,UAAmB,KAAQ;QACzB,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,OAAO,OAAO,IAAI,OAAO,CAAC,IAAI,KAAK,KAAK,EAAE;YACxC,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,KAAK,CAAC;gBACzC,CAAC,CAAC,OAAO,CAAC,IAAI;gBACd,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;SACnB;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;OAEG;IACO,uCAAY,GAAtB,UAAuB,WAAgC;QACrD,IAAI,MAAM,GAAG,IAAI,CAAC;QAClB,IAAI,OAAO,GAAG,IAAI,CAAC,KAAK,CAAC;QAEzB,OAAO,OAAO,EAAE;YACd,MAAM,GAAG,OAAO,CAAC;YAEjB,OAAO,GAAG,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC;gBACpD,CAAC,CAAC,OAAO,CAAC,IAAI;gBACd,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC;SACnB;QAED,WAAW,CAAC,MAAM,GAAG,MAAM,CAAC;QAE5B,IAAI,MAAM,KAAK,IAAI,EAAE;YACnB,IAAI,CAAC,KAAK,GAAG,WAAW,CAAC;SAC1B;aAAM;YACL,IAAI,IAAI,CAAC,OAAO,CAAC,MAAM,CAAC,IAAI,EAAE,WAAW,CAAC,IAAI,CAAC,EAAE;gBAC/C,MAAM,CAAC,IAAI,GAAG,WAAW,CAAC;aAC3B;iBAAM;gBACL,MAAM,CAAC,KAAK,GAAG,WAAW,CAAC;aAC5B;SACF;QACD,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAED;wCACoC;IAC1B,+BAAI,GAAd,UACE,QAAoC,EACpC,SAAqC;QAErC,IAAI,QAAQ,KAAK,IAAI,EAAE;YACrB,OAAO,SAAS,CAAC;SAClB;QACD,IAAI,SAAS,KAAK,IAAI,EAAE;YACtB,OAAO,QAAQ,CAAC;SACjB;QAED,SAAS,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,EAAE,SAAS,CAAC,IAAI,CAAC,CAAC;QACrD,IAAI,SAAS,CAAC,IAAI,EAAE;YAClB,IAAI,CAAC,sBAAsB,CAAC,SAAS,CAAC,CAAC;SACxC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;OAEG;IACI,8BAAG,GAAV;QACE,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC;QAC7B,OAAO,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,KAAK,EAAE;YACzB,WAAW,GAAG,WAAW,CAAC,KAAK,CAAC;SACjC;QACD,OAAO,WAAY,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED;;OAEG;IACI,8BAAG,GAAV;QACE,IAAI,CAAC,YAAY,EAAE,CAAC;QACpB,IAAI,WAAW,GAAG,IAAI,CAAC,KAAK,CAAC;QAC7B,OAAO,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,IAAI,EAAE;YACxB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;SAChC;QACD,OAAO,WAAY,CAAC,IAAI,CAAC;IAC3B,CAAC;IAED;;OAEG;IACI,iCAAM,GAAb,UAAc,KAAQ;QACpB,IAAI,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACnB,MAAM,IAAI,kCAAwB,CAAC,qBAAqB,CAAC,CAAC;SAC3D;QACD,IAAM,WAAW,GAAG,IAAI,0BAAgB,CAAC,KAAK,CAAC,CAAC;QAChD,IAAI,CAAC,YAAY,CAAC,WAAW,CAAC,CAAC;IACjC,CAAC;IAED;;OAEG;IACI,8BAAG,GAAV,UAAW,KAAQ;QACjB,IAAM,OAAO,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QACrC,OAAO,CAAA,OAAO,aAAP,OAAO,uBAAP,OAAO,CAAE,IAAI,MAAK,KAAK,CAAC;IACjC,CAAC;IAED;;OAEG;IACI,iCAAM,GAAb,UAAc,KAAQ;QAAtB,iBA2BC;QA1BC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE;YACpB,MAAM,IAAI,6BAAmB,CAAC,kCAAkC,CAAC,CAAC;SACnE;QAED,IAAM,eAAe,GAAG,UAAC,IAAgC,EAAE,KAAQ;YACjE,IAAI,IAAI,KAAK,IAAI,EAAE;gBACjB,OAAO,IAAI,CAAC;aACb;YAED,IAAI,IAAI,CAAC,IAAI,KAAK,KAAK,EAAE;gBACvB,IAAM,WAAW,GAAG,KAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC;gBACrD,IAAI,WAAW,EAAE;oBACf,WAAW,CAAC,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC;iBAClC;gBACD,OAAO,WAAW,CAAC;aACpB;iBAAM,IAAI,KAAI,CAAC,OAAO,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,EAAE;gBACzC,IAAI,CAAC,IAAI,GAAG,eAAe,CAAC,IAAI,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;aAC/C;iBAAM;gBACL,IAAI,CAAC,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;aACjD;YACD,KAAI,CAAC,sBAAsB,CAAC,IAAI,CAAC,CAAC;YAClC,OAAO,IAAI,CAAC;QACd,CAAC,CAAC;QAEF,IAAI,CAAC,KAAK,GAAG,eAAe,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC;QAChD,IAAI,CAAC,OAAO,EAAE,CAAC;IACjB,CAAC;IAED;;OAEG;IACI,kCAAO,GAAd,UAAe,KAAQ;QACrB,IAAM,IAAI,GAAG,IAAI,gBAAgB,EAAK,CAAC;QACvC,IAAM,IAAI,GAAG,IAAI,CAAC,QAAQ,CAAC,KAAK,CAAC,CAAC;QAClC,IAAM,KAAK,GAAG,IAAI,eAAK,EAA8B,CAAC;QAEtD,IAAM,QAAQ,GAAG,EAAE,CAAC;QACpB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEjB,OAAO,CAAC,KAAK,CAAC,OAAO,EAAE,EAAE;YACvB,IAAM,WAAW,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;YAChC,QAAQ,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YAC3B,IAAI,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,IAAI,EAAE;gBACrB,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,IAAI,CAAC,CAAC;aAC9B;YACD,IAAI,WAAW,aAAX,WAAW,uBAAX,WAAW,CAAE,KAAK,EAAE;gBACtB,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;aAC/B;SACF;QAED,QAAQ,CAAC,OAAO,CAAC,UAAC,IAAI;YACpB,IAAI,IAAI,KAAK,IAAI,EAAE;gBACjB,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;aACxB;QACH,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED;;OAEG;IACI,mCAAQ,GAAf,UAAgB,IAA2B,EAAE,IAAQ;QACnD,IAAI,CAAC,YAAY,EAAE,CAAC;QAEpB,IAAM,KAAK,GAAG,IAAI,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;QACvC,IAAM,IAAI,GAAG,IAAI,KAAK,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC;QAEnE,IAAM,YAAY,GAAG,UAAC,IAAgC;YACpD,IAAI,IAAI,KAAK,IAAI,EAAE;gBACjB,OAAO;aACR;YACD,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC,CAAC;QAEF,IAAM,cAAc,GAAG,UAAC,IAAgC;YACtD,IAAI,IAAI,KAAK,IAAI,EAAE;gBACjB,OAAO;aACR;YACD,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACzB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACxB,CAAC,CAAC;QAEF,IAAM,aAAa,GAAG,UAAC,IAAgC;YACrD,IAAI,IAAI,KAAK,IAAI,EAAE;gBACjB,OAAO;aACR;YACD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACtB,YAAY,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACxB,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QAC3B,CAAC,CAAC;QAEF,QAAQ,IAAI,EAAE;YACZ,KAAK,6CAAqB,CAAC,OAAO;gBAChC,YAAY,CAAC,IAAI,CAAC,CAAC;gBACnB,MAAM;YACR,KAAK,6CAAqB,CAAC,SAAS;gBAClC,cAAc,CAAC,IAAI,CAAC,CAAC;gBACrB,MAAM;YACR,KAAK,6CAAqB,CAAC,QAAQ;gBACjC,aAAa,CAAC,IAAI,CAAC,CAAC;gBACpB,MAAM;SACT;QAED,OAAO,KAAK,CAAC,MAAM,CAAC,UAAC,IAAI,IAAK,OAAA,IAAI,KAAK,SAAS,EAAlB,CAAkB,CAAC,CAAC;IACpD,CAAC;IAED;;OAEG;IACI,iCAAM,GAAb;QACE,IAAM,UAAU,GAAG,UAAC,IAAyB;YAC3C,IAAI,IAAI,KAAK,IAAI;gBAAE,OAAO,CAAC,CAAC;YAC5B,IAAM,IAAI,GAAW,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrE,IAAM,KAAK,GAAW,IAAI,CAAC,KAAK,KAAK,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACxE,IAAM,GAAG,GAAG,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,KAAK,CAAC;YACxC,OAAO,GAAG,GAAG,CAAC,CAAC;QACjB,CAAC,CAAC;QAEF,IAAI,IAAI,CAAC,KAAK,KAAK,IAAI,EAAE;YACvB,OAAO,CAAC,CAAC;SACV;aAAM;YACL,OAAO,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC;SACnC;IACH,CAAC;IACH,uBAAC;AAAD,CAAC,AAnRD,CAAiD,4BAAkB,GAmRlE"}

package/lib/data-structures/Graph/demo/generateRandomGraph.js

@@ -1,66 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.generateRandomGraph = void 0;
-var EnumGraphType_1 = require("../../../types/EnumGraphType");
-var createGraph_1 = require("../../../helpers/createGraph");
-var utils_1 = require("../../../utils");
-var EnumRandomGenerationFormat_1 = require("../../../types/EnumRandomGenerationFormat");
-var getRandomVertex = function () {
-    return "_" + Math.random().toString(36).substr(2, 9);
-};
-var getPossibleEdgesCount = function (type, verticesCount) {
-    var possibleEdgesCount = verticesCount * (verticesCount - 1);
-    switch (type) {
-        case EnumGraphType_1.EnumGraphType.Directed: {
-            break;
-        }
-        case EnumGraphType_1.EnumGraphType.Undirected: {
-            possibleEdgesCount = Math.floor(possibleEdgesCount / 2);
-            break;
-        }
-    }
-    return possibleEdgesCount;
-};
-var fillGraphRandomly = function (graph, format, verticesCount) {
-    switch (format) {
-        case EnumRandomGenerationFormat_1.EnumRandomGenerationFormat.Hash: {
-            for (var i = 0; i < verticesCount; i++) {
-                graph.addVertex(getRandomVertex());
-            }
-            break;
-        }
-        case EnumRandomGenerationFormat_1.EnumRandomGenerationFormat.Numbers: {
-            for (var i = 0; i < verticesCount; i++) {
-                graph.addVertex((i + 1).toString());
-            }
-            break;
-        }
-    }
-};
-exports.generateRandomGraph = function (verticesCount, edgesCount, type, format) {
-    if (type === void 0) { type = EnumGraphType_1.EnumGraphType.Undirected; }
-    if (format === void 0) { format = EnumRandomGenerationFormat_1.EnumRandomGenerationFormat.Numbers; }
-    var graph = createGraph_1.createGraph(type);
-    var possibleEdgesCount = getPossibleEdgesCount(type, verticesCount);
-    if (edgesCount <= 0 || edgesCount > possibleEdgesCount) {
-        throw new Error("Edges count must be in range between 0 and " + possibleEdgesCount);
-    }
-    fillGraphRandomly(graph, format, verticesCount);
-    var addedVertices = graph.vertices();
-    var addedEdgesCount = 0;
-    while (addedEdgesCount < edgesCount) {
-        var randomizeIndex = function () {
-            return utils_1.randomizeNumberInRange(0, addedVertices.length);
-        };
-        var randomVertexFrom = addedVertices[randomizeIndex()];
-        var randomVertexTo = addedVertices[randomizeIndex()];
-        var isEdgeAlreadyExists = graph.hasEdge(randomVertexFrom, randomVertexTo);
-        var isTheSameVertex = randomVertexFrom === randomVertexTo;
-        if (!isTheSameVertex && !isEdgeAlreadyExists) {
-            graph.addEdge(randomVertexFrom, randomVertexTo);
-            addedEdgesCount++;
-        }
-    }
-    return graph;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiZ2VuZXJhdGVSYW5kb21HcmFwaC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uL3NyYy9kYXRhLXN0cnVjdHVyZXMvR3JhcGgvZGVtby9nZW5lcmF0ZVJhbmRvbUdyYXBoLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUNBLDhEQUE2RDtBQUM3RCw0REFBMkQ7QUFDM0Qsd0NBQXdEO0FBQ3hELHdGQUF1RjtBQUV2RixJQUFNLGVBQWUsR0FBRztJQUN0QixPQUFPLEdBQUcsR0FBRyxJQUFJLENBQUMsTUFBTSxFQUFFLENBQUMsUUFBUSxDQUFDLEVBQUUsQ0FBQyxDQUFDLE1BQU0sQ0FBQyxDQUFDLEVBQUUsQ0FBQyxDQUFDLENBQUM7QUFDdkQsQ0FBQyxDQUFDO0FBRUYsSUFBTSxxQkFBcUIsR0FBRyxVQUM1QixJQUFtQixFQUNuQixhQUFxQjtJQUVyQixJQUFJLGtCQUFrQixHQUFHLGFBQWEsR0FBRyxDQUFDLGFBQWEsR0FBRyxDQUFDLENBQUMsQ0FBQztJQUU3RCxRQUFRLElBQUksRUFBRTtRQUNaLEtBQUssNkJBQWEsQ0FBQyxRQUFRLENBQUMsQ0FBQztZQUMzQixNQUFNO1NBQ1A7UUFDRCxLQUFLLDZCQUFhLENBQUMsVUFBVSxDQUFDLENBQUM7WUFDN0Isa0JBQWtCLEdBQUcsSUFBSSxDQUFDLEtBQUssQ0FBQyxrQkFBa0IsR0FBRyxDQUFDLENBQUMsQ0FBQztZQUN4RCxNQUFNO1NBQ1A7S0FDRjtJQUVELE9BQU8sa0JBQWtCLENBQUM7QUFDNUIsQ0FBQyxDQUFDO0FBRUYsSUFBTSxpQkFBaUIsR0FBRyxVQUN4QixLQUFxQixFQUNyQixNQUFrQyxFQUNsQyxhQUFxQjtJQUVyQixRQUFRLE1BQU0sRUFBRTtRQUNkLEtBQUssdURBQTBCLENBQUMsSUFBSSxDQUFDLENBQUM7WUFDcEMsS0FBSyxJQUFJLENBQUMsR0FBRyxDQUFDLEVBQUUsQ0FBQyxHQUFHLGFBQWEsRUFBRSxDQUFDLEVBQUUsRUFBRTtnQkFDdEMsS0FBSyxDQUFDLFNBQVMsQ0FBQyxlQUFlLEVBQUUsQ0FBQyxDQUFDO2FBQ3BDO1lBQ0QsTUFBTTtTQUNQO1FBQ0QsS0FBSyx1REFBMEIsQ0FBQyxPQUFPLENBQUMsQ0FBQztZQUN2QyxLQUFLLElBQUksQ0FBQyxHQUFHLENBQUMsRUFBRSxDQUFDLEdBQUcsYUFBYSxFQUFFLENBQUMsRUFBRSxFQUFFO2dCQUN0QyxLQUFLLENBQUMsU0FBUyxDQUFDLENBQUMsQ0FBQyxHQUFHLENBQUMsQ0FBQyxDQUFDLFFBQVEsRUFBRSxDQUFDLENBQUM7YUFDckM7WUFDRCxNQUFNO1NBQ1A7S0FDRjtBQUNILENBQUMsQ0FBQztBQUVXLFFBQUEsbUJBQW1CLEdBQUcsVUFDakMsYUFBcUIsRUFDckIsVUFBa0IsRUFDbEIsSUFBOEMsRUFDOUMsTUFBdUU7SUFEdkUscUJBQUEsRUFBQSxPQUFzQiw2QkFBYSxDQUFDLFVBQVU7SUFDOUMsdUJBQUEsRUFBQSxTQUFxQyx1REFBMEIsQ0FBQyxPQUFPO0lBRXZFLElBQU0sS0FBSyxHQUFHLHlCQUFXLENBQVMsSUFBSSxDQUFDLENBQUM7SUFDeEMsSUFBTSxrQkFBa0IsR0FBRyxxQkFBcUIsQ0FBQyxJQUFJLEVBQUUsYUFBYSxDQUFDLENBQUM7SUFFdEUsSUFBSSxVQUFVLElBQUksQ0FBQyxJQUFJLFVBQVUsR0FBRyxrQkFBa0IsRUFBRTtRQUN0RCxNQUFNLElBQUksS0FBSyxDQUNiLGdEQUE4QyxrQkFBb0IsQ0FDbkUsQ0FBQztLQUNIO0lBRUQsaUJBQWlCLENBQUMsS0FBSyxFQUFFLE1BQU0sRUFBRSxhQUFhLENBQUMsQ0FBQztJQUNoRCxJQUFNLGFBQWEsR0FBRyxLQUFLLENBQUMsUUFBUSxFQUFFLENBQUM7SUFDdkMsSUFBSSxlQUFlLEdBQUcsQ0FBQyxDQUFDO0lBRXhCLE9BQU8sZUFBZSxHQUFHLFVBQVUsRUFBRTtRQUNuQyxJQUFNLGNBQWMsR0FBRztZQUNyQixPQUFPLDhCQUFzQixDQUFDLENBQUMsRUFBRSxhQUFhLENBQUMsTUFBTSxDQUFDLENBQUM7UUFDekQsQ0FBQyxDQUFDO1FBQ0YsSUFBTSxnQkFBZ0IsR0FBRyxhQUFhLENBQUMsY0FBYyxFQUFFLENBQUMsQ0FBQztRQUN6RCxJQUFNLGNBQWMsR0FBRyxhQUFhLENBQUMsY0FBYyxFQUFFLENBQUMsQ0FBQztRQUV2RCxJQUFNLG1CQUFtQixHQUFHLEtBQUssQ0FBQyxPQUFPLENBQUMsZ0JBQWdCLEVBQUUsY0FBYyxDQUFDLENBQUM7UUFDNUUsSUFBTSxlQUFlLEdBQUcsZ0JBQWdCLEtBQUssY0FBYyxDQUFDO1FBRTVELElBQUksQ0FBQyxlQUFlLElBQUksQ0FBQyxtQkFBbUIsRUFBRTtZQUM1QyxLQUFLLENBQUMsT0FBTyxDQUFDLGdCQUFnQixFQUFFLGNBQWMsQ0FBQyxDQUFDO1lBQ2hELGVBQWUsRUFBRSxDQUFDO1NBQ25CO0tBQ0Y7SUFFRCxPQUFPLEtBQUssQ0FBQztBQUNmLENBQUMsQ0FBQyJ9

package/lib/data-structures/Graph/iterator/AbstractGraphIterator.js

@@ -1,90 +0,0 @@
-"use strict";
-var __spreadArrays = (this && this.__spreadArrays) || function () {
-    for (var s = 0, i = 0, il = arguments.length; i < il; i++) s += arguments[i].length;
-    for (var r = Array(s), k = 0, i = 0; i < il; i++)
-        for (var a = arguments[i], j = 0, jl = a.length; j < jl; j++, k++)
-            r[k] = a[j];
-    return r;
-};
-Object.defineProperty(exports, "__esModule", { value: true });
-var AbstractGraphIterator = /** @class */ (function () {
-    /**
-     * Creates empty instance
-     */
-    function AbstractGraphIterator(graph) {
-        this.graph = graph;
-        this.visited = new Map();
-        this.parents = new Map();
-    }
-    /**
-     * @inheritDoc
-     */
-    AbstractGraphIterator.prototype.initIterator = function (from) {
-        if (!this.graph.hasVertex(from)) {
-            throw new Error("Start vertex does not exist");
-        }
-        this.initIteratorImpl(from);
-    };
-    /**
-     * @inheritDoc
-     */
-    AbstractGraphIterator.prototype.hasNext = function () {
-        return this.hasNextImpl();
-    };
-    /**
-     * @inheritDoc
-     */
-    AbstractGraphIterator.prototype.next = function () {
-        try {
-            if (!this.hasNext()) {
-                throw new Error();
-            }
-            return this.nextImpl();
-        }
-        catch (e) {
-            throw new Error("Next element does not exist");
-        }
-    };
-    /**
-     * @inheritDoc
-     */
-    AbstractGraphIterator.prototype.current = function () {
-        try {
-            var current = this.currentImpl();
-            if (current === null) {
-                throw new Error();
-            }
-            return current;
-        }
-        catch (e) {
-            throw new Error("Current element does not exist");
-        }
-    };
-    /**
-     * @inheritDoc
-     */
-    AbstractGraphIterator.prototype.getPath = function (from, to) {
-        var path = new Array();
-        var isLinkedDirectly = this.graph.hasEdge(from, to);
-        var currentVertex = this.parents.get(to);
-        if (isLinkedDirectly) {
-            return [from, to];
-        }
-        else {
-            while (currentVertex) {
-                if (currentVertex === from) {
-                    break;
-                }
-                path.push(currentVertex);
-                currentVertex = this.parents.get(currentVertex);
-            }
-            if (path.length === 0) {
-                throw new Error("There is no path found");
-            }
-            return __spreadArrays([from], path.reverse(), [to]);
-        }
-    };
-    return AbstractGraphIterator;
-}());
-exports.default = AbstractGraphIterator;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiQWJzdHJhY3RHcmFwaEl0ZXJhdG9yLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vc3JjL2RhdGEtc3RydWN0dXJlcy9HcmFwaC9pdGVyYXRvci9BYnN0cmFjdEdyYXBoSXRlcmF0b3IudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7Ozs7Ozs7O0FBR0E7SUFNRTs7T0FFRztJQUNILCtCQUFzQixLQUFnQjtRQUNwQyxJQUFJLENBQUMsS0FBSyxHQUFHLEtBQUssQ0FBQztRQUNuQixJQUFJLENBQUMsT0FBTyxHQUFHLElBQUksR0FBRyxFQUFFLENBQUM7UUFDekIsSUFBSSxDQUFDLE9BQU8sR0FBRyxJQUFJLEdBQUcsRUFBRSxDQUFDO0lBQzNCLENBQUM7SUFPRDs7T0FFRztJQUNJLDRDQUFZLEdBQW5CLFVBQW9CLElBQU87UUFDekIsSUFBSSxDQUFDLElBQUksQ0FBQyxLQUFLLENBQUMsU0FBUyxDQUFDLElBQUksQ0FBQyxFQUFFO1lBQy9CLE1BQU0sSUFBSSxLQUFLLENBQUMsNkJBQTZCLENBQUMsQ0FBQztTQUNoRDtRQUNELElBQUksQ0FBQyxnQkFBZ0IsQ0FBQyxJQUFJLENBQUMsQ0FBQztJQUM5QixDQUFDO0lBRUQ7O09BRUc7SUFDSSx1Q0FBTyxHQUFkO1FBQ0UsT0FBTyxJQUFJLENBQUMsV0FBVyxFQUFFLENBQUM7SUFDNUIsQ0FBQztJQUVEOztPQUVHO0lBQ0ksb0NBQUksR0FBWDtRQUNFLElBQUk7WUFDRixJQUFJLENBQUMsSUFBSSxDQUFDLE9BQU8sRUFBRSxFQUFFO2dCQUNuQixNQUFNLElBQUksS0FBSyxFQUFFLENBQUM7YUFDbkI7WUFFRCxPQUFPLElBQUksQ0FBQyxRQUFRLEVBQUUsQ0FBQztTQUN4QjtRQUFDLE9BQU8sQ0FBQyxFQUFFO1lBQ1YsTUFBTSxJQUFJLEtBQUssQ0FBQyw2QkFBNkIsQ0FBQyxDQUFDO1NBQ2hEO0lBQ0gsQ0FBQztJQUVEOztPQUVHO0lBQ0ksdUNBQU8sR0FBZDtRQUNFLElBQUk7WUFDRixJQUFNLE9BQU8sR0FBRyxJQUFJLENBQUMsV0FBVyxFQUFFLENBQUM7WUFFbkMsSUFBSSxPQUFPLEtBQUssSUFBSSxFQUFFO2dCQUNwQixNQUFNLElBQUksS0FBSyxFQUFFLENBQUM7YUFDbkI7WUFDRCxPQUFPLE9BQU8sQ0FBQztTQUNoQjtRQUFDLE9BQU8sQ0FBQyxFQUFFO1lBQ1YsTUFBTSxJQUFJLEtBQUssQ0FBQyxnQ0FBZ0MsQ0FBQyxDQUFDO1NBQ25EO0lBQ0gsQ0FBQztJQUVEOztPQUVHO0lBQ0ksdUNBQU8sR0FBZCxVQUFlLElBQU8sRUFBRSxFQUFLO1FBQzNCLElBQU0sSUFBSSxHQUFhLElBQUksS0FBSyxFQUFLLENBQUM7UUFDdEMsSUFBTSxnQkFBZ0IsR0FBRyxJQUFJLENBQUMsS0FBSyxDQUFDLE9BQU8sQ0FBQyxJQUFJLEVBQUUsRUFBRSxDQUFDLENBQUM7UUFDdEQsSUFBSSxhQUFhLEdBQUcsSUFBSSxDQUFDLE9BQU8sQ0FBQyxHQUFHLENBQUMsRUFBRSxDQUFDLENBQUM7UUFFekMsSUFBSSxnQkFBZ0IsRUFBRTtZQUNwQixPQUFPLENBQUMsSUFBSSxFQUFFLEVBQUUsQ0FBQyxDQUFDO1NBQ25CO2FBQU07WUFDTCxPQUFPLGFBQWEsRUFBRTtnQkFDcEIsSUFBSSxhQUFhLEtBQUssSUFBSSxFQUFFO29CQUMxQixNQUFNO2lCQUNQO2dCQUVELElBQUksQ0FBQyxJQUFJLENBQUMsYUFBYSxDQUFDLENBQUM7Z0JBQ3pCLGFBQWEsR0FBRyxJQUFJLENBQUMsT0FBTyxDQUFDLEdBQUcsQ0FBQyxhQUFhLENBQUMsQ0FBQzthQUNqRDtZQUVELElBQUksSUFBSSxDQUFDLE1BQU0sS0FBSyxDQUFDLEVBQUU7Z0JBQ3JCLE1BQU0sSUFBSSxLQUFLLENBQUMsd0JBQXdCLENBQUMsQ0FBQzthQUMzQztZQUVELHVCQUFRLElBQUksR0FBSyxJQUFJLENBQUMsT0FBTyxFQUFFLEdBQUUsRUFBRSxHQUFFO1NBQ3RDO0lBQ0gsQ0FBQztJQUNILDRCQUFDO0FBQUQsQ0FBQyxBQS9GRCxJQStGQyJ9

package/lib/data-structures/Graph/searching/hasPath.js

@@ -1,30 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.hasPath = void 0;
-var IsNotFoundException_1 = require("../../../exceptions/IsNotFoundException");
-/**
- * Check if graph has a path between two vertices
- * @throws when start vertex was not found
- * @throws when end vertex was not found
- * @throws when there is no path between two vertices
- */
-exports.hasPath = function (graph, from, to, strategy) {
-    /* Validate */
-    if (!graph.hasVertex(from)) {
-        throw new IsNotFoundException_1.default("Start vertex was not found");
-    }
-    if (!graph.hasVertex(to)) {
-        throw new IsNotFoundException_1.default("End vertex was not found");
-    }
-    var iterator = strategy.createIterator(graph);
-    iterator.initIterator(from);
-    /* Find target element */
-    while (iterator.hasNext()) {
-        var next = iterator.next();
-        if (next === to) {
-            return true;
-        }
-    }
-    return false;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaGFzUGF0aC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uL3NyYy9kYXRhLXN0cnVjdHVyZXMvR3JhcGgvc2VhcmNoaW5nL2hhc1BhdGgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBR0EsK0VBQTBFO0FBRTFFOzs7OztHQUtHO0FBQ1UsUUFBQSxPQUFPLEdBQUcsVUFDckIsS0FBZ0IsRUFDaEIsSUFBTyxFQUNQLEVBQUssRUFDTCxRQUFvQztJQUVwQyxjQUFjO0lBQ2QsSUFBSSxDQUFDLEtBQUssQ0FBQyxTQUFTLENBQUMsSUFBSSxDQUFDLEVBQUU7UUFDMUIsTUFBTSxJQUFJLDZCQUFtQixDQUFDLDRCQUE0QixDQUFDLENBQUM7S0FDN0Q7SUFDRCxJQUFJLENBQUMsS0FBSyxDQUFDLFNBQVMsQ0FBQyxFQUFFLENBQUMsRUFBRTtRQUN4QixNQUFNLElBQUksNkJBQW1CLENBQUMsMEJBQTBCLENBQUMsQ0FBQztLQUMzRDtJQUVELElBQU0sUUFBUSxHQUFzQixRQUFRLENBQUMsY0FBYyxDQUFDLEtBQUssQ0FBQyxDQUFDO0lBQ25FLFFBQVEsQ0FBQyxZQUFZLENBQUMsSUFBSSxDQUFDLENBQUM7SUFFNUIseUJBQXlCO0lBQ3pCLE9BQU8sUUFBUSxDQUFDLE9BQU8sRUFBRSxFQUFFO1FBQ3pCLElBQU0sSUFBSSxHQUFHLFFBQVEsQ0FBQyxJQUFJLEVBQUUsQ0FBQztRQUU3QixJQUFJLElBQUksS0FBSyxFQUFFLEVBQUU7WUFDZixPQUFPLElBQUksQ0FBQztTQUNiO0tBQ0Y7SUFFRCxPQUFPLEtBQUssQ0FBQztBQUNmLENBQUMsQ0FBQyJ9

package/lib/data-structures/Graph/searching/shortestPath.js

@@ -1,30 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.shortestPath = void 0;
-var IsNotFoundException_1 = require("../../../exceptions/IsNotFoundException");
-/**
- * Find the shortest path between two vertices
- * @throws when start vertex was not found
- * @throws when end vertex was not found
- * @throws when there is no path between two vertices
- */
-exports.shortestPath = function (graph, from, to, strategy) {
-    /* Validate */
-    if (!graph.hasVertex(from)) {
-        throw new IsNotFoundException_1.default("Start vertex was not found");
-    }
-    if (!graph.hasVertex(to)) {
-        throw new IsNotFoundException_1.default("End vertex was not found");
-    }
-    var iterator = strategy.createIterator(graph);
-    iterator.initIterator(from);
-    /* Find target element */
-    while (iterator.hasNext()) {
-        var next = iterator.next();
-        if (next === to) {
-            break;
-        }
-    }
-    return iterator.getPath(from, to);
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoic2hvcnRlc3RQYXRoLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vc3JjL2RhdGEtc3RydWN0dXJlcy9HcmFwaC9zZWFyY2hpbmcvc2hvcnRlc3RQYXRoLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUdBLCtFQUEwRTtBQUUxRTs7Ozs7R0FLRztBQUNVLFFBQUEsWUFBWSxHQUFHLFVBQzFCLEtBQWdCLEVBQ2hCLElBQU8sRUFDUCxFQUFLLEVBQ0wsUUFBb0M7SUFFcEMsY0FBYztJQUNkLElBQUksQ0FBQyxLQUFLLENBQUMsU0FBUyxDQUFDLElBQUksQ0FBQyxFQUFFO1FBQzFCLE1BQU0sSUFBSSw2QkFBbUIsQ0FBQyw0QkFBNEIsQ0FBQyxDQUFDO0tBQzdEO0lBQ0QsSUFBSSxDQUFDLEtBQUssQ0FBQyxTQUFTLENBQUMsRUFBRSxDQUFDLEVBQUU7UUFDeEIsTUFBTSxJQUFJLDZCQUFtQixDQUFDLDBCQUEwQixDQUFDLENBQUM7S0FDM0Q7SUFFRCxJQUFNLFFBQVEsR0FBc0IsUUFBUSxDQUFDLGNBQWMsQ0FBQyxLQUFLLENBQUMsQ0FBQztJQUNuRSxRQUFRLENBQUMsWUFBWSxDQUFDLElBQUksQ0FBQyxDQUFDO0lBRTVCLHlCQUF5QjtJQUN6QixPQUFPLFFBQVEsQ0FBQyxPQUFPLEVBQUUsRUFBRTtRQUN6QixJQUFNLElBQUksR0FBRyxRQUFRLENBQUMsSUFBSSxFQUFFLENBQUM7UUFFN0IsSUFBSSxJQUFJLEtBQUssRUFBRSxFQUFFO1lBQ2YsTUFBTTtTQUNQO0tBQ0Y7SUFFRCxPQUFPLFFBQVEsQ0FBQyxPQUFPLENBQUMsSUFBSSxFQUFFLEVBQUUsQ0FBQyxDQUFDO0FBQ3BDLENBQUMsQ0FBQyJ9

package/lib/data-structures/Graph/transposing/transposeDirectedGraph.js

@@ -1,14 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.transposeDirectedGraph = void 0;
-var createGraphFromMatrix_1 = require("../../../helpers/createGraphFromMatrix");
-var EnumGraphType_1 = require("../../../types/EnumGraphType");
-var presenterAdjacencyMatrix_1 = require("../presenter/presenterAdjacencyMatrix");
-var transpose_matrix_1 = require("../../../algorithms/transpose-matrix");
-exports.transposeDirectedGraph = function (sourceGraph) {
-    var verticesList = sourceGraph.vertices();
-    var matrix = presenterAdjacencyMatrix_1.presenterAdjacencyMatrix(sourceGraph);
-    var transposedMatrix = transpose_matrix_1.transposeMatrix(matrix);
-    return createGraphFromMatrix_1.createGraphFromMatrix(transposedMatrix, verticesList, EnumGraphType_1.EnumGraphType.Directed);
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidHJhbnNwb3NlRGlyZWN0ZWRHcmFwaC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uL3NyYy9kYXRhLXN0cnVjdHVyZXMvR3JhcGgvdHJhbnNwb3NpbmcvdHJhbnNwb3NlRGlyZWN0ZWRHcmFwaC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7QUFDQSxnRkFBK0U7QUFDL0UsOERBQTZEO0FBQzdELGtGQUFpRjtBQUNqRix5RUFBdUU7QUFFMUQsUUFBQSxzQkFBc0IsR0FBRyxVQUNwQyxXQUFzQjtJQUV0QixJQUFNLFlBQVksR0FBRyxXQUFXLENBQUMsUUFBUSxFQUFFLENBQUM7SUFDNUMsSUFBTSxNQUFNLEdBQUcsbURBQXdCLENBQUMsV0FBVyxDQUFDLENBQUM7SUFDckQsSUFBTSxnQkFBZ0IsR0FBRyxrQ0FBZSxDQUFDLE1BQU0sQ0FBQyxDQUFDO0lBRWpELE9BQU8sNkNBQXFCLENBQzFCLGdCQUFnQixFQUNoQixZQUFZLEVBQ1osNkJBQWEsQ0FBQyxRQUFRLENBQ3ZCLENBQUM7QUFDSixDQUFDLENBQUMifQ==