@raikuxq/alg-ds 1.2.5 → 2.0.0

package/lib/app/algorithms/graph/iterator/GraphIteratorDijkstra.d.ts

@@ -1,32 +0,0 @@
-import IGraph from "../../../types/IGraph";
-import AbstractGraphIterator from "./AbstractGraphIterator";
-/**
- * Dijkstra method graph traversal
- */
-export default class GraphIteratorDijkstra<T> extends AbstractGraphIterator<T> {
-    private readonly costs;
-    /**
-     * @inheritDoc
-     */
-    constructor(graph: IGraph<T>);
-    /**
-     * Get not visited vertex with minimal cost
-     */
-    private getClosestNotVisited;
-    /**
-     * @inheritDoc
-     */
-    initIteratorImpl(startVertex: T): void;
-    /**
-     * @inheritDoc
-     */
-    hasNextImpl(): boolean;
-    /**
-     * @inheritDoc
-     */
-    currentImpl(): T;
-    /**
-     * @inheritDoc
-     */
-    nextImpl(): T;
-}

package/lib/app/algorithms/graph/iterator/GraphIteratorDijkstra.js

@@ -1,97 +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 AbstractGraphIterator_1 = require("./AbstractGraphIterator");
-var IllegalStateException_1 = require("../../../exceptions/base/IllegalStateException");
-/**
- * Dijkstra method graph traversal
- */
-var GraphIteratorDijkstra = /** @class */ (function (_super) {
-    __extends(GraphIteratorDijkstra, _super);
-    /**
-     * @inheritDoc
-     */
-    function GraphIteratorDijkstra(graph) {
-        var _this = _super.call(this, graph) || this;
-        _this.costs = new Map();
-        return _this;
-    }
-    /**
-     * Get not visited vertex with minimal cost
-     */
-    GraphIteratorDijkstra.prototype.getClosestNotVisited = function () {
-        var _this = this;
-        var keys = Array.from(this.costs.keys());
-        var priorityList = keys
-            .filter(function (key) { return !_this.visited.get(key); })
-            .sort(function (aKey, bKey) {
-            var aCost = _this.costs.get(aKey) || 0;
-            var bCost = _this.costs.get(bKey) || 0;
-            return aCost - bCost;
-        });
-        if (priorityList[0] === undefined) {
-            throw new IllegalStateException_1.default("No more vertices found");
-        }
-        return priorityList[0];
-    };
-    /**
-     * @inheritDoc
-     */
-    GraphIteratorDijkstra.prototype.initIteratorImpl = function (startVertex) {
-        var _this = this;
-        this.visited.set(startVertex, true);
-        this.costs.set(startVertex, 0);
-        this.graph.getVertexNeighbors(startVertex).forEach(function (neighbor) {
-            var edgeWeight = _this.graph.getEdgeWeight(startVertex, neighbor);
-            _this.costs.set(neighbor, edgeWeight);
-            _this.parents.set(neighbor, startVertex);
-        });
-    };
-    /**
-     * @inheritDoc
-     */
-    GraphIteratorDijkstra.prototype.hasNextImpl = function () {
-        return !(this.getClosestNotVisited() === null);
-    };
-    /**
-     * @inheritDoc
-     */
-    GraphIteratorDijkstra.prototype.currentImpl = function () {
-        return this.getClosestNotVisited();
-    };
-    /**
-     * @inheritDoc
-     */
-    GraphIteratorDijkstra.prototype.nextImpl = function () {
-        var _this = this;
-        var next = this.getClosestNotVisited();
-        this.visited.set(next, true);
-        var nextNeighbors = this.graph.getVertexNeighbors(next);
-        var nextCost = this.costs.get(next);
-        nextNeighbors.forEach(function (neighbor) {
-            var edgeWeight = _this.graph.getEdgeWeight(next, neighbor);
-            var currentNeighborCost = _this.costs.get(neighbor) || Infinity;
-            var newNeighborCost = (nextCost || 0) + edgeWeight;
-            if (newNeighborCost < currentNeighborCost) {
-                _this.costs.set(neighbor, newNeighborCost);
-                _this.parents.set(neighbor, next);
-            }
-        });
-        return next;
-    };
-    return GraphIteratorDijkstra;
-}(AbstractGraphIterator_1.default));
-exports.default = GraphIteratorDijkstra;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiR3JhcGhJdGVyYXRvckRpamtzdHJhLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vLi4vc3JjL2FwcC9hbGdvcml0aG1zL2dyYXBoL2l0ZXJhdG9yL0dyYXBoSXRlcmF0b3JEaWprc3RyYS50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7Ozs7Ozs7Ozs7Ozs7QUFDQSxpRUFBNEQ7QUFDNUQsd0ZBQW1GO0FBRW5GOztHQUVHO0FBQ0g7SUFBc0QseUNBQXdCO0lBRzVFOztPQUVHO0lBQ0gsK0JBQW1CLEtBQWdCO1FBQW5DLFlBQ0Usa0JBQU0sS0FBSyxDQUFDLFNBRWI7UUFEQyxLQUFJLENBQUMsS0FBSyxHQUFHLElBQUksR0FBRyxFQUFFLENBQUM7O0lBQ3pCLENBQUM7SUFFRDs7T0FFRztJQUNLLG9EQUFvQixHQUE1QjtRQUFBLGlCQWdCQztRQWZDLElBQU0sSUFBSSxHQUFHLEtBQUssQ0FBQyxJQUFJLENBQUMsSUFBSSxDQUFDLEtBQUssQ0FBQyxJQUFJLEVBQUUsQ0FBQyxDQUFDO1FBQzNDLElBQU0sWUFBWSxHQUFHLElBQUk7YUFDdEIsTUFBTSxDQUFDLFVBQUMsR0FBTSxJQUFLLE9BQUEsQ0FBQyxLQUFJLENBQUMsT0FBTyxDQUFDLEdBQUcsQ0FBQyxHQUFHLENBQUMsRUFBdEIsQ0FBc0IsQ0FBQzthQUMxQyxJQUFJLENBQUMsVUFBQyxJQUFPLEVBQUUsSUFBTztZQUNyQixJQUFNLEtBQUssR0FBRyxLQUFJLENBQUMsS0FBSyxDQUFDLEdBQUcsQ0FBQyxJQUFJLENBQUMsSUFBSSxDQUFDLENBQUM7WUFDeEMsSUFBTSxLQUFLLEdBQUcsS0FBSSxDQUFDLEtBQUssQ0FBQyxHQUFHLENBQUMsSUFBSSxDQUFDLElBQUksQ0FBQyxDQUFDO1lBRXhDLE9BQU8sS0FBSyxHQUFHLEtBQUssQ0FBQztRQUN2QixDQUFDLENBQUMsQ0FBQztRQUVMLElBQUksWUFBWSxDQUFDLENBQUMsQ0FBQyxLQUFLLFNBQVMsRUFBRTtZQUNqQyxNQUFNLElBQUksK0JBQXFCLENBQUMsd0JBQXdCLENBQUMsQ0FBQztTQUMzRDtRQUVELE9BQU8sWUFBWSxDQUFDLENBQUMsQ0FBQyxDQUFDO0lBQ3pCLENBQUM7SUFFRDs7T0FFRztJQUNJLGdEQUFnQixHQUF2QixVQUF3QixXQUFjO1FBQXRDLGlCQVNDO1FBUkMsSUFBSSxDQUFDLE9BQU8sQ0FBQyxHQUFHLENBQUMsV0FBVyxFQUFFLElBQUksQ0FBQyxDQUFDO1FBQ3BDLElBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxDQUFDLFdBQVcsRUFBRSxDQUFDLENBQUMsQ0FBQztRQUUvQixJQUFJLENBQUMsS0FBSyxDQUFDLGtCQUFrQixDQUFDLFdBQVcsQ0FBQyxDQUFDLE9BQU8sQ0FBQyxVQUFDLFFBQVc7WUFDN0QsSUFBTSxVQUFVLEdBQUcsS0FBSSxDQUFDLEtBQUssQ0FBQyxhQUFhLENBQUMsV0FBVyxFQUFFLFFBQVEsQ0FBQyxDQUFDO1lBQ25FLEtBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxDQUFDLFFBQVEsRUFBRSxVQUFVLENBQUMsQ0FBQztZQUNyQyxLQUFJLENBQUMsT0FBTyxDQUFDLEdBQUcsQ0FBQyxRQUFRLEVBQUUsV0FBVyxDQUFDLENBQUM7UUFDMUMsQ0FBQyxDQUFDLENBQUM7SUFDTCxDQUFDO0lBRUQ7O09BRUc7SUFDSSwyQ0FBVyxHQUFsQjtRQUNFLE9BQU8sQ0FBQyxDQUFDLElBQUksQ0FBQyxvQkFBb0IsRUFBRSxLQUFLLElBQUksQ0FBQyxDQUFDO0lBQ2pELENBQUM7SUFFRDs7T0FFRztJQUNJLDJDQUFXLEdBQWxCO1FBQ0UsT0FBTyxJQUFJLENBQUMsb0JBQW9CLEVBQUUsQ0FBQztJQUNyQyxDQUFDO0lBRUQ7O09BRUc7SUFDSSx3Q0FBUSxHQUFmO1FBQUEsaUJBbUJDO1FBbEJDLElBQU0sSUFBSSxHQUFHLElBQUksQ0FBQyxvQkFBb0IsRUFBRSxDQUFDO1FBRXpDLElBQUksQ0FBQyxPQUFPLENBQUMsR0FBRyxDQUFDLElBQUksRUFBRSxJQUFJLENBQUMsQ0FBQztRQUM3QixJQUFNLGFBQWEsR0FBRyxJQUFJLENBQUMsS0FBSyxDQUFDLGtCQUFrQixDQUFDLElBQUksQ0FBQyxDQUFDO1FBQzFELElBQU0sUUFBUSxHQUFHLElBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxDQUFDLElBQUksQ0FBQyxDQUFDO1FBRXRDLGFBQWEsQ0FBQyxPQUFPLENBQUMsVUFBQyxRQUFXO1lBQ2hDLElBQU0sVUFBVSxHQUFHLEtBQUksQ0FBQyxLQUFLLENBQUMsYUFBYSxDQUFDLElBQUksRUFBRSxRQUFRLENBQUMsQ0FBQztZQUM1RCxJQUFNLG1CQUFtQixHQUFHLEtBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxDQUFDLFFBQVEsQ0FBQyxJQUFJLFFBQVEsQ0FBQztZQUNqRSxJQUFNLGVBQWUsR0FBRyxDQUFDLFFBQVEsSUFBSSxDQUFDLENBQUMsR0FBRyxVQUFVLENBQUM7WUFFckQsSUFBSSxlQUFlLEdBQUcsbUJBQW1CLEVBQUU7Z0JBQ3pDLEtBQUksQ0FBQyxLQUFLLENBQUMsR0FBRyxDQUFDLFFBQVEsRUFBRSxlQUFlLENBQUMsQ0FBQztnQkFDMUMsS0FBSSxDQUFDLE9BQU8sQ0FBQyxHQUFHLENBQUMsUUFBUSxFQUFFLElBQUksQ0FBQyxDQUFDO2FBQ2xDO1FBQ0gsQ0FBQyxDQUFDLENBQUM7UUFFSCxPQUFPLElBQUksQ0FBQztJQUNkLENBQUM7SUFDSCw0QkFBQztBQUFELENBQUMsQUFuRkQsQ0FBc0QsK0JBQXFCLEdBbUYxRSJ9

package/lib/app/algorithms/graph/iterator-strategy/BFSIterationStrategy.d.ts

@@ -1,6 +0,0 @@
-import IGraphIterationStrategy from "../../../types/IGraphIterationStrategy";
-import IGraphIterator from "../../../types/IGraphIterator";
-import IGraph from "../../../types/IGraph";
-export default class BFSIterationStrategy<T> implements IGraphIterationStrategy<T> {
-    createIterator(graph: IGraph<T>): IGraphIterator<T>;
-}

package/lib/app/algorithms/graph/iterator-strategy/BFSIterationStrategy.js

@@ -1,13 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var GraphIteratorBFS_1 = require("../iterator/GraphIteratorBFS");
-var BFSIterationStrategy = /** @class */ (function () {
-    function BFSIterationStrategy() {
-    }
-    BFSIterationStrategy.prototype.createIterator = function (graph) {
-        return new GraphIteratorBFS_1.default(graph);
-    };
-    return BFSIterationStrategy;
-}());
-exports.default = BFSIterationStrategy;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiQkZTSXRlcmF0aW9uU3RyYXRlZ3kuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi8uLi8uLi9zcmMvYXBwL2FsZ29yaXRobXMvZ3JhcGgvaXRlcmF0b3Itc3RyYXRlZ3kvQkZTSXRlcmF0aW9uU3RyYXRlZ3kudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7QUFHQSxpRUFBNEQ7QUFFNUQ7SUFBQTtJQUtBLENBQUM7SUFIUSw2Q0FBYyxHQUFyQixVQUFzQixLQUFnQjtRQUNwQyxPQUFPLElBQUksMEJBQWdCLENBQUksS0FBSyxDQUFDLENBQUM7SUFDeEMsQ0FBQztJQUNILDJCQUFDO0FBQUQsQ0FBQyxBQUxELElBS0MifQ==

package/lib/app/algorithms/graph/iterator-strategy/DFSIterationStrategy.d.ts

@@ -1,6 +0,0 @@
-import IGraph from "../../../types/IGraph";
-import IGraphIterationStrategy from "../../../types/IGraphIterationStrategy";
-import IGraphIterator from "../../../types/IGraphIterator";
-export default class DFSIterationStrategy<T> implements IGraphIterationStrategy<T> {
-    createIterator(graph: IGraph<T>): IGraphIterator<T>;
-}

package/lib/app/algorithms/graph/iterator-strategy/DFSIterationStrategy.js

@@ -1,13 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var GraphIteratorDFS_1 = require("../iterator/GraphIteratorDFS");
-var DFSIterationStrategy = /** @class */ (function () {
-    function DFSIterationStrategy() {
-    }
-    DFSIterationStrategy.prototype.createIterator = function (graph) {
-        return new GraphIteratorDFS_1.default(graph);
-    };
-    return DFSIterationStrategy;
-}());
-exports.default = DFSIterationStrategy;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiREZTSXRlcmF0aW9uU3RyYXRlZ3kuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi8uLi8uLi9zcmMvYXBwL2FsZ29yaXRobXMvZ3JhcGgvaXRlcmF0b3Itc3RyYXRlZ3kvREZTSXRlcmF0aW9uU3RyYXRlZ3kudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7QUFHQSxpRUFBNEQ7QUFFNUQ7SUFBQTtJQUtBLENBQUM7SUFIUSw2Q0FBYyxHQUFyQixVQUFzQixLQUFnQjtRQUNwQyxPQUFPLElBQUksMEJBQWdCLENBQUMsS0FBSyxDQUFDLENBQUM7SUFDckMsQ0FBQztJQUNILDJCQUFDO0FBQUQsQ0FBQyxBQUxELElBS0MifQ==

package/lib/app/algorithms/graph/iterator-strategy/DijkstraIterationStrategy.d.ts

@@ -1,6 +0,0 @@
-import IGraph from "../../../types/IGraph";
-import IGraphIterationStrategy from "../../../types/IGraphIterationStrategy";
-import IGraphIterator from "../../../types/IGraphIterator";
-export default class DijkstraIterationStrategy<T> implements IGraphIterationStrategy<T> {
-    createIterator(graph: IGraph<T>): IGraphIterator<T>;
-}

package/lib/app/algorithms/graph/iterator-strategy/DijkstraIterationStrategy.js

@@ -1,13 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-var GraphIteratorDijkstra_1 = require("../iterator/GraphIteratorDijkstra");
-var DijkstraIterationStrategy = /** @class */ (function () {
-    function DijkstraIterationStrategy() {
-    }
-    DijkstraIterationStrategy.prototype.createIterator = function (graph) {
-        return new GraphIteratorDijkstra_1.default(graph);
-    };
-    return DijkstraIterationStrategy;
-}());
-exports.default = DijkstraIterationStrategy;
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiRGlqa3N0cmFJdGVyYXRpb25TdHJhdGVneS5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uLy4uL3NyYy9hcHAvYWxnb3JpdGhtcy9ncmFwaC9pdGVyYXRvci1zdHJhdGVneS9EaWprc3RyYUl0ZXJhdGlvblN0cmF0ZWd5LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7O0FBR0EsMkVBQXNFO0FBRXRFO0lBQUE7SUFLQSxDQUFDO0lBSFEsa0RBQWMsR0FBckIsVUFBc0IsS0FBZ0I7UUFDcEMsT0FBTyxJQUFJLCtCQUFxQixDQUFDLEtBQUssQ0FBQyxDQUFDO0lBQzFDLENBQUM7SUFDSCxnQ0FBQztBQUFELENBQUMsQUFMRCxJQUtDIn0=

package/lib/app/algorithms/graph/presenter/presenterAdjacencyLists.d.ts

@@ -1,19 +0,0 @@
-import IGraph from "../../../types/IGraph";
-/**
- * Get graph adjacency list
- *
- * @example
- *
- * Directed graph:
- * - Bob [Maria]
- * - Maria [Bob, John]
- * - John []
- *
- * @example
- *
- * Undirected graph:
- * - Bob [Maria]
- * - Maria [Bob, John]
- * - John [Maria]
- **/
-export declare const presenterAdjacencyLists: <T>(graph: IGraph<T>) => Map<T, T[]>;

package/lib/app/algorithms/graph/presenter/presenterAdjacencyLists.js

@@ -1,28 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.presenterAdjacencyLists = void 0;
-/**
- * Get graph adjacency list
- *
- * @example
- *
- * Directed graph:
- * - Bob [Maria]
- * - Maria [Bob, John]
- * - John []
- *
- * @example
- *
- * Undirected graph:
- * - Bob [Maria]
- * - Maria [Bob, John]
- * - John [Maria]
- **/
-exports.presenterAdjacencyLists = function (graph) {
-    return graph.vertices().reduce(function (map, vertex) {
-        var neighbors = graph.getVertexNeighbors(vertex);
-        map.set(vertex, neighbors);
-        return map;
-    }, new Map());
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJlc2VudGVyQWRqYWNlbmN5TGlzdHMuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi8uLi8uLi9zcmMvYXBwL2FsZ29yaXRobXMvZ3JhcGgvcHJlc2VudGVyL3ByZXNlbnRlckFkamFjZW5jeUxpc3RzLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUVBOzs7Ozs7Ozs7Ozs7Ozs7O0lBZ0JJO0FBQ1MsUUFBQSx1QkFBdUIsR0FBRyxVQUNyQyxLQUFnQjtJQUVoQixPQUFPLEtBQUssQ0FBQyxRQUFRLEVBQUUsQ0FBQyxNQUFNLENBQUMsVUFBQyxHQUFxQixFQUFFLE1BQVM7UUFDOUQsSUFBTSxTQUFTLEdBQUcsS0FBSyxDQUFDLGtCQUFrQixDQUFDLE1BQU0sQ0FBQyxDQUFDO1FBQ25ELEdBQUcsQ0FBQyxHQUFHLENBQUMsTUFBTSxFQUFFLFNBQVMsQ0FBQyxDQUFDO1FBRTNCLE9BQU8sR0FBRyxDQUFDO0lBQ2IsQ0FBQyxFQUFFLElBQUksR0FBRyxFQUFFLENBQUMsQ0FBQztBQUNoQixDQUFDLENBQUMifQ==

package/lib/app/algorithms/graph/presenter/presenterAdjacencyMatrix.d.ts

@@ -1,32 +0,0 @@
-import IGraph from "../../../types/IGraph";
-import { TypeArrayMatrix } from "../../../types/TypeArrayMatrix";
-/**
- * Get graph adjacency matrix N x N
- *
- * @example
- *
- * Directed graph:
- * - Bob [Maria]
- * - Maria [Bob, John]
- * - John []
- *
- * Its matrix:
- *       |  Bob  | Maria |  John |
- * Bob   |   0   |   1   |   0   |
- * Maria |   1   |   0   |   1   |
- * John  |   0   |   0   |   0   |
- *
- * @example
- *
- * Undirected graph:
- * - Bob [Maria]
- * - Maria [Bob, John]
- * - John [Maria]
- *
- * Its matrix:
- *       |  Bob  | Maria |  John |
- * Bob   |   0   |   1   |   0   |
- * Maria |   1   |   0   |   1   |
- * John  |   0   |   1   |   0   |
- */
-export declare const presenterAdjacencyMatrix: <T>(graph: IGraph<T>) => TypeArrayMatrix;

package/lib/app/algorithms/graph/presenter/presenterAdjacencyMatrix.js

@@ -1,48 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.presenterAdjacencyMatrix = void 0;
-var constants_1 = require("../../../constants");
-/**
- * Get graph adjacency matrix N x N
- *
- * @example
- *
- * Directed graph:
- * - Bob [Maria]
- * - Maria [Bob, John]
- * - John []
- *
- * Its matrix:
- *       |  Bob  | Maria |  John |
- * Bob   |   0   |   1   |   0   |
- * Maria |   1   |   0   |   1   |
- * John  |   0   |   0   |   0   |
- *
- * @example
- *
- * Undirected graph:
- * - Bob [Maria]
- * - Maria [Bob, John]
- * - John [Maria]
- *
- * Its matrix:
- *       |  Bob  | Maria |  John |
- * Bob   |   0   |   1   |   0   |
- * Maria |   1   |   0   |   1   |
- * John  |   0   |   1   |   0   |
- */
-exports.presenterAdjacencyMatrix = function (graph) {
-    var vertices = graph.vertices();
-    var matrix = new Array(graph.verticesCount());
-    vertices.forEach(function (graphVertexRow, rowIndex) {
-        matrix[rowIndex] = new Array(graph.verticesCount());
-        vertices.forEach(function (graphVertexColumn, columnIndex) {
-            var isElementLinked = graph.hasEdge(graphVertexRow, graphVertexColumn);
-            matrix[rowIndex][columnIndex] = isElementLinked
-                ? constants_1.EDGE_EXISTS_STATE
-                : constants_1.EDGE_NOT_EXISTS_STATE;
-        });
-    });
-    return matrix;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoicHJlc2VudGVyQWRqYWNlbmN5TWF0cml4LmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vLi4vc3JjL2FwcC9hbGdvcml0aG1zL2dyYXBoL3ByZXNlbnRlci9wcmVzZW50ZXJBZGphY2VuY3lNYXRyaXgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBQ0EsZ0RBQThFO0FBRzlFOzs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7Ozs7O0dBNEJHO0FBQ1UsUUFBQSx3QkFBd0IsR0FBRyxVQUN0QyxLQUFnQjtJQUVoQixJQUFNLFFBQVEsR0FBRyxLQUFLLENBQUMsUUFBUSxFQUFFLENBQUM7SUFDbEMsSUFBTSxNQUFNLEdBQUcsSUFBSSxLQUFLLENBQUMsS0FBSyxDQUFDLGFBQWEsRUFBRSxDQUFDLENBQUM7SUFFaEQsUUFBUSxDQUFDLE9BQU8sQ0FBQyxVQUFDLGNBQWMsRUFBRSxRQUFRO1FBQ3hDLE1BQU0sQ0FBQyxRQUFRLENBQUMsR0FBRyxJQUFJLEtBQUssQ0FBQyxLQUFLLENBQUMsYUFBYSxFQUFFLENBQUMsQ0FBQztRQUVwRCxRQUFRLENBQUMsT0FBTyxDQUFDLFVBQUMsaUJBQWlCLEVBQUUsV0FBVztZQUM5QyxJQUFNLGVBQWUsR0FBRyxLQUFLLENBQUMsT0FBTyxDQUFDLGNBQWMsRUFBRSxpQkFBaUIsQ0FBQyxDQUFDO1lBRXpFLE1BQU0sQ0FBQyxRQUFRLENBQUMsQ0FBQyxXQUFXLENBQUMsR0FBRyxlQUFlO2dCQUM3QyxDQUFDLENBQUMsNkJBQWlCO2dCQUNuQixDQUFDLENBQUMsaUNBQXFCLENBQUM7UUFDNUIsQ0FBQyxDQUFDLENBQUM7SUFDTCxDQUFDLENBQUMsQ0FBQztJQUVILE9BQU8sTUFBTSxDQUFDO0FBQ2hCLENBQUMsQ0FBQyJ9

package/lib/app/algorithms/graph/searching/hasPath.d.ts

@@ -1,9 +0,0 @@
-import IGraph from "../../../types/IGraph";
-import IGraphIterationStrategy from "../../../types/IGraphIterationStrategy";
-/**
- * Check if graph has a path between two vertices
- * @throws {IsNotFoundException} when start vertex was not found
- * @throws {IsNotFoundException} when end vertex was not found
- * @throws {IllegalStateException} when there is no path between two vertices
- */
-export declare const hasPath: <T>(graph: IGraph<T>, from: T, to: T, strategy: IGraphIterationStrategy<T>) => boolean;

package/lib/app/algorithms/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 {IsNotFoundException} when start vertex was not found
- * @throws {IsNotFoundException} when end vertex was not found
- * @throws {IllegalStateException} 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,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaGFzUGF0aC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uLy4uL3NyYy9hcHAvYWxnb3JpdGhtcy9ncmFwaC9zZWFyY2hpbmcvaGFzUGF0aC50cyJdLCJuYW1lcyI6W10sIm1hcHBpbmdzIjoiOzs7QUFHQSwrRUFBMEU7QUFFMUU7Ozs7O0dBS0c7QUFDVSxRQUFBLE9BQU8sR0FBRyxVQUNyQixLQUFnQixFQUNoQixJQUFPLEVBQ1AsRUFBSyxFQUNMLFFBQW9DO0lBRXBDLGNBQWM7SUFDZCxJQUFJLENBQUMsS0FBSyxDQUFDLFNBQVMsQ0FBQyxJQUFJLENBQUMsRUFBRTtRQUMxQixNQUFNLElBQUksNkJBQW1CLENBQUMsNEJBQTRCLENBQUMsQ0FBQztLQUM3RDtJQUNELElBQUksQ0FBQyxLQUFLLENBQUMsU0FBUyxDQUFDLEVBQUUsQ0FBQyxFQUFFO1FBQ3hCLE1BQU0sSUFBSSw2QkFBbUIsQ0FBQywwQkFBMEIsQ0FBQyxDQUFDO0tBQzNEO0lBRUQsSUFBTSxRQUFRLEdBQXNCLFFBQVEsQ0FBQyxjQUFjLENBQUMsS0FBSyxDQUFDLENBQUM7SUFDbkUsUUFBUSxDQUFDLFlBQVksQ0FBQyxJQUFJLENBQUMsQ0FBQztJQUU1Qix5QkFBeUI7SUFDekIsT0FBTyxRQUFRLENBQUMsT0FBTyxFQUFFLEVBQUU7UUFDekIsSUFBTSxJQUFJLEdBQUcsUUFBUSxDQUFDLElBQUksRUFBRSxDQUFDO1FBRTdCLElBQUksSUFBSSxLQUFLLEVBQUUsRUFBRTtZQUNmLE9BQU8sSUFBSSxDQUFDO1NBQ2I7S0FDRjtJQUVELE9BQU8sS0FBSyxDQUFDO0FBQ2YsQ0FBQyxDQUFDIn0=

package/lib/app/algorithms/graph/searching/shortestPath.d.ts

@@ -1,9 +0,0 @@
-import IGraph from "../../../types/IGraph";
-import IGraphIterationStrategy from "../../../types/IGraphIterationStrategy";
-/**
- * Find the shortest path between two vertices
- * @throws {IsNotFoundException} when start vertex was not found
- * @throws {IsNotFoundException} when end vertex was not found
- * @throws {IllegalStateException} when there is no path between two vertices
- */
-export declare const shortestPath: <T>(graph: IGraph<T>, from: T, to: T, strategy: IGraphIterationStrategy<T>) => T[];

package/lib/app/algorithms/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 {IsNotFoundException} when start vertex was not found
- * @throws {IsNotFoundException} when end vertex was not found
- * @throws {IllegalStateException} 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,eyJ2ZXJzaW9uIjozLCJmaWxlIjoic2hvcnRlc3RQYXRoLmpzIiwic291cmNlUm9vdCI6IiIsInNvdXJjZXMiOlsiLi4vLi4vLi4vLi4vLi4vc3JjL2FwcC9hbGdvcml0aG1zL2dyYXBoL3NlYXJjaGluZy9zaG9ydGVzdFBhdGgudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBR0EsK0VBQTBFO0FBRTFFOzs7OztHQUtHO0FBQ1UsUUFBQSxZQUFZLEdBQUcsVUFDMUIsS0FBZ0IsRUFDaEIsSUFBTyxFQUNQLEVBQUssRUFDTCxRQUFvQztJQUVwQyxjQUFjO0lBQ2QsSUFBSSxDQUFDLEtBQUssQ0FBQyxTQUFTLENBQUMsSUFBSSxDQUFDLEVBQUU7UUFDMUIsTUFBTSxJQUFJLDZCQUFtQixDQUFDLDRCQUE0QixDQUFDLENBQUM7S0FDN0Q7SUFDRCxJQUFJLENBQUMsS0FBSyxDQUFDLFNBQVMsQ0FBQyxFQUFFLENBQUMsRUFBRTtRQUN4QixNQUFNLElBQUksNkJBQW1CLENBQUMsMEJBQTBCLENBQUMsQ0FBQztLQUMzRDtJQUVELElBQU0sUUFBUSxHQUFzQixRQUFRLENBQUMsY0FBYyxDQUFDLEtBQUssQ0FBQyxDQUFDO0lBQ25FLFFBQVEsQ0FBQyxZQUFZLENBQUMsSUFBSSxDQUFDLENBQUM7SUFFNUIseUJBQXlCO0lBQ3pCLE9BQU8sUUFBUSxDQUFDLE9BQU8sRUFBRSxFQUFFO1FBQ3pCLElBQU0sSUFBSSxHQUFHLFFBQVEsQ0FBQyxJQUFJLEVBQUUsQ0FBQztRQUU3QixJQUFJLElBQUksS0FBSyxFQUFFLEVBQUU7WUFDZixNQUFNO1NBQ1A7S0FDRjtJQUVELE9BQU8sUUFBUSxDQUFDLE9BQU8sQ0FBQyxJQUFJLEVBQUUsRUFBRSxDQUFDLENBQUM7QUFDcEMsQ0FBQyxDQUFDIn0=

package/lib/app/algorithms/graph/transposing/transposeDirectedGraph.d.ts

@@ -1,2 +0,0 @@
-import IGraph from "../../../types/IGraph";
-export declare const transposeDirectedGraph: <T>(sourceGraph: IGraph<T>) => IGraph<T>;

package/lib/app/algorithms/graph/transposing/transposeDirectedGraph.js

@@ -1,14 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.transposeDirectedGraph = void 0;
-var createGraphFromMatrix_1 = require("../../../data-structures/Graph/_helpers/createGraphFromMatrix");
-var EnumGraphType_1 = require("../../../types/EnumGraphType");
-var presenterAdjacencyMatrix_1 = require("../presenter/presenterAdjacencyMatrix");
-var transpose_matrix_1 = require("../../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,eyJ2ZXJzaW9uIjozLCJmaWxlIjoidHJhbnNwb3NlRGlyZWN0ZWRHcmFwaC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uLy4uL3NyYy9hcHAvYWxnb3JpdGhtcy9ncmFwaC90cmFuc3Bvc2luZy90cmFuc3Bvc2VEaXJlY3RlZEdyYXBoLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUNBLHVHQUFzRztBQUN0Ryw4REFBNkQ7QUFDN0Qsa0ZBQWlGO0FBQ2pGLDJEQUF5RDtBQUU1QyxRQUFBLHNCQUFzQixHQUFHLFVBQ3BDLFdBQXNCO0lBRXRCLElBQU0sWUFBWSxHQUFHLFdBQVcsQ0FBQyxRQUFRLEVBQUUsQ0FBQztJQUM1QyxJQUFNLE1BQU0sR0FBRyxtREFBd0IsQ0FBQyxXQUFXLENBQUMsQ0FBQztJQUNyRCxJQUFNLGdCQUFnQixHQUFHLGtDQUFlLENBQUMsTUFBTSxDQUFDLENBQUM7SUFFakQsT0FBTyw2Q0FBcUIsQ0FDMUIsZ0JBQWdCLEVBQ2hCLFlBQVksRUFDWiw2QkFBYSxDQUFDLFFBQVEsQ0FDdkIsQ0FBQztBQUNKLENBQUMsQ0FBQyJ9

package/lib/app/algorithms/memoize.d.ts

@@ -1,5 +0,0 @@
-import { FnToMemoize } from "../types/FnToMemoize";
-/**
- * Wrapper function that storing the results of calls and returning the cached result when the same inputs occur again
- */
-export declare const memoize: <Key, Value>(fn: FnToMemoize<Key, Value>) => FnToMemoize<Key, Value>;

package/lib/app/algorithms/memoize.js

@@ -1,22 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.memoize = void 0;
-/**
- * Wrapper function that storing the results of calls and returning the cached result when the same inputs occur again
- */
-exports.memoize = function (fn) {
-    var cache = new Map();
-    return function () {
-        var args = [];
-        for (var _i = 0; _i < arguments.length; _i++) {
-            args[_i] = arguments[_i];
-        }
-        var jsonArgs = JSON.stringify(args);
-        if (!cache.has(jsonArgs)) {
-            var result = fn.apply(void 0, args);
-            cache.set(jsonArgs, result);
-        }
-        return cache.get(jsonArgs);
-    };
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibWVtb2l6ZS5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uL3NyYy9hcHAvYWxnb3JpdGhtcy9tZW1vaXplLnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUVBOztHQUVHO0FBQ1UsUUFBQSxPQUFPLEdBQUcsVUFDckIsRUFBMkI7SUFFM0IsSUFBTSxLQUFLLEdBQUcsSUFBSSxHQUFHLEVBQWlCLENBQUM7SUFFdkMsT0FBTztRQUFDLGNBQW1CO2FBQW5CLFVBQW1CLEVBQW5CLHFCQUFtQixFQUFuQixJQUFtQjtZQUFuQix5QkFBbUI7O1FBQ3pCLElBQU0sUUFBUSxHQUFHLElBQUksQ0FBQyxTQUFTLENBQUMsSUFBSSxDQUFDLENBQUM7UUFFdEMsSUFBSSxDQUFDLEtBQUssQ0FBQyxHQUFHLENBQUMsUUFBUSxDQUFDLEVBQUU7WUFDeEIsSUFBTSxNQUFNLEdBQUcsRUFBRSxlQUFJLElBQUksQ0FBQyxDQUFDO1lBQzNCLEtBQUssQ0FBQyxHQUFHLENBQUMsUUFBUSxFQUFFLE1BQU0sQ0FBQyxDQUFDO1NBQzdCO1FBRUQsT0FBYyxLQUFLLENBQUMsR0FBRyxDQUFDLFFBQVEsQ0FBQyxDQUFDO0lBQ3BDLENBQUMsQ0FBQztBQUNKLENBQUMsQ0FBQyJ9

package/lib/app/algorithms/sorts/bubble-sort.d.ts

@@ -1,9 +0,0 @@
-/**
- * Bubble sorting algorithm
- *
- * @description
- * Time complexity: Best O(n); Avg O(n \^ 2); Worst O(n \^ 2)
- * @description
- * Memory complexity: Worst case: O(1)
- */
-export declare const bubbleSort: (arr: Array<number>) => Array<number>;

package/lib/app/algorithms/sorts/bubble-sort.js

@@ -1,23 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.bubbleSort = void 0;
-var utils_1 = require("../../utils");
-/**
- * Bubble sorting algorithm
- *
- * @description
- * Time complexity: Best O(n); Avg O(n \^ 2); Worst O(n \^ 2)
- * @description
- * Memory complexity: Worst case: O(1)
- */
-exports.bubbleSort = function (arr) {
-    for (var i = 0; i < arr.length - 1; i++) {
-        for (var j = 0; j < arr.length - 1; j++) {
-            if (arr[j] > arr[j + 1]) {
-                utils_1.swapArrayItems(arr, j, j + 1);
-            }
-        }
-    }
-    return arr;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiYnViYmxlLXNvcnQuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi8uLi9zcmMvYXBwL2FsZ29yaXRobXMvc29ydHMvYnViYmxlLXNvcnQudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBQUEscUNBQTZDO0FBRTdDOzs7Ozs7O0dBT0c7QUFDVSxRQUFBLFVBQVUsR0FBRyxVQUFDLEdBQWtCO0lBQzNDLEtBQUssSUFBSSxDQUFDLEdBQUcsQ0FBQyxFQUFFLENBQUMsR0FBRyxHQUFHLENBQUMsTUFBTSxHQUFHLENBQUMsRUFBRSxDQUFDLEVBQUUsRUFBRTtRQUN2QyxLQUFLLElBQUksQ0FBQyxHQUFHLENBQUMsRUFBRSxDQUFDLEdBQUcsR0FBRyxDQUFDLE1BQU0sR0FBRyxDQUFDLEVBQUUsQ0FBQyxFQUFFLEVBQUU7WUFDdkMsSUFBSSxHQUFHLENBQUMsQ0FBQyxDQUFDLEdBQUcsR0FBRyxDQUFDLENBQUMsR0FBRyxDQUFDLENBQUMsRUFBRTtnQkFDdkIsc0JBQWMsQ0FBQyxHQUFHLEVBQUUsQ0FBQyxFQUFFLENBQUMsR0FBRyxDQUFDLENBQUMsQ0FBQzthQUMvQjtTQUNGO0tBQ0Y7SUFFRCxPQUFPLEdBQUcsQ0FBQztBQUNiLENBQUMsQ0FBQyJ9

package/lib/app/algorithms/sorts/insertion-sort.d.ts

@@ -1,9 +0,0 @@
-/**
- * Insertion sorting algorithm
- *
- * @description
- * Time complexity: Best O(n); Avg O(n \^ 2); Worst O(n \^ 2);
- * @description
- * Memory complexity: Worst case: O(1)
- */
-export declare const insertionSort: (arr: Array<number>) => Array<number>;

package/lib/app/algorithms/sorts/insertion-sort.js

@@ -1,25 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.insertionSort = void 0;
-var utils_1 = require("../../utils");
-/**
- * Insertion sorting algorithm
- *
- * @description
- * Time complexity: Best O(n); Avg O(n \^ 2); Worst O(n \^ 2);
- * @description
- * Memory complexity: Worst case: O(1)
- */
-exports.insertionSort = function (arr) {
-    for (var i = 1; i < arr.length; i++) {
-        var current = arr[i];
-        var j = i - 1;
-        while (j >= 0 && arr[j] > current) {
-            utils_1.swapArrayItems(arr, j + 1, j);
-            j--;
-        }
-        arr[j + 1] = current;
-    }
-    return arr;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoiaW5zZXJ0aW9uLXNvcnQuanMiLCJzb3VyY2VSb290IjoiIiwic291cmNlcyI6WyIuLi8uLi8uLi8uLi9zcmMvYXBwL2FsZ29yaXRobXMvc29ydHMvaW5zZXJ0aW9uLXNvcnQudHMiXSwibmFtZXMiOltdLCJtYXBwaW5ncyI6Ijs7O0FBQUEscUNBQTZDO0FBRTdDOzs7Ozs7O0dBT0c7QUFDVSxRQUFBLGFBQWEsR0FBRyxVQUFDLEdBQWtCO0lBQzlDLEtBQUssSUFBSSxDQUFDLEdBQUcsQ0FBQyxFQUFFLENBQUMsR0FBRyxHQUFHLENBQUMsTUFBTSxFQUFFLENBQUMsRUFBRSxFQUFFO1FBQ25DLElBQU0sT0FBTyxHQUFHLEdBQUcsQ0FBQyxDQUFDLENBQUMsQ0FBQztRQUN2QixJQUFJLENBQUMsR0FBRyxDQUFDLEdBQUcsQ0FBQyxDQUFDO1FBRWQsT0FBTyxDQUFDLElBQUksQ0FBQyxJQUFJLEdBQUcsQ0FBQyxDQUFDLENBQUMsR0FBRyxPQUFPLEVBQUU7WUFDakMsc0JBQWMsQ0FBQyxHQUFHLEVBQUUsQ0FBQyxHQUFHLENBQUMsRUFBRSxDQUFDLENBQUMsQ0FBQztZQUM5QixDQUFDLEVBQUUsQ0FBQztTQUNMO1FBRUQsR0FBRyxDQUFDLENBQUMsR0FBRyxDQUFDLENBQUMsR0FBRyxPQUFPLENBQUM7S0FDdEI7SUFFRCxPQUFPLEdBQUcsQ0FBQztBQUNiLENBQUMsQ0FBQyJ9

package/lib/app/algorithms/sorts/merge-sort.d.ts

@@ -1,9 +0,0 @@
-/**
- * Merge sorting algorithm
- *
- * @description
- * Time complexity: Best O(n * log(n)); Avg O(n * log(n)); Worst O(n * log(n))
- * @description
- * Memory complexity: Worst case: O(n)
- */
-export declare const mergeSort: (arr: Array<number>) => Array<number>;

package/lib/app/algorithms/sorts/merge-sort.js

@@ -1,61 +0,0 @@
-"use strict";
-Object.defineProperty(exports, "__esModule", { value: true });
-exports.mergeSort = void 0;
-/**
- * Merge two sorted arrays into one array
- */
-var merge = function (arr, leftIndex, midIndex, rightIndex) {
-    var container = arr.slice(leftIndex, rightIndex + 1);
-    var resultArrIndex = leftIndex;
-    var leftHalfIndex = leftIndex;
-    var rightHalfIndex = midIndex + 1;
-    /** While both halves of array are not ended */
-    while (leftHalfIndex <= midIndex && rightHalfIndex <= rightIndex) {
-        var leftHalfElement = container[leftHalfIndex - leftIndex];
-        var rightHalfElement = container[rightHalfIndex - leftIndex];
-        if (leftHalfElement < rightHalfElement) {
-            arr[resultArrIndex] = leftHalfElement;
-            leftHalfIndex++;
-        }
-        else {
-            arr[resultArrIndex] = rightHalfElement;
-            rightHalfIndex++;
-        }
-        resultArrIndex++;
-    }
-    /** If one of halves is ended, the remaining one will just be pushed to result */
-    while (leftHalfIndex <= midIndex) {
-        arr[resultArrIndex] = container[leftHalfIndex - leftIndex];
-        resultArrIndex++;
-        leftHalfIndex++;
-    }
-    while (rightHalfIndex <= rightIndex) {
-        arr[resultArrIndex] = container[rightHalfIndex - leftIndex];
-        resultArrIndex++;
-        rightHalfIndex++;
-    }
-};
-/**
- * Divide array into 2 halves and merge them
- */
-var sortRange = function (arr, leftIndex, rightIndex) {
-    if (rightIndex > leftIndex) {
-        var midIndex = Math.floor(leftIndex + (rightIndex - leftIndex) / 2);
-        sortRange(arr, leftIndex, midIndex);
-        sortRange(arr, midIndex + 1, rightIndex);
-        merge(arr, leftIndex, midIndex, rightIndex);
-    }
-};
-/**
- * Merge sorting algorithm
- *
- * @description
- * Time complexity: Best O(n * log(n)); Avg O(n * log(n)); Worst O(n * log(n))
- * @description
- * Memory complexity: Worst case: O(n)
- */
-exports.mergeSort = function (arr) {
-    sortRange(arr, 0, arr.length - 1);
-    return arr;
-};
-//# sourceMappingURL=data:application/json;base64,eyJ2ZXJzaW9uIjozLCJmaWxlIjoibWVyZ2Utc29ydC5qcyIsInNvdXJjZVJvb3QiOiIiLCJzb3VyY2VzIjpbIi4uLy4uLy4uLy4uL3NyYy9hcHAvYWxnb3JpdGhtcy9zb3J0cy9tZXJnZS1zb3J0LnRzIl0sIm5hbWVzIjpbXSwibWFwcGluZ3MiOiI7OztBQUFBOztHQUVHO0FBQ0gsSUFBTSxLQUFLLEdBQUcsVUFDWixHQUFrQixFQUNsQixTQUFpQixFQUNqQixRQUFnQixFQUNoQixVQUFrQjtJQUVsQixJQUFNLFNBQVMsR0FBRyxHQUFHLENBQUMsS0FBSyxDQUFDLFNBQVMsRUFBRSxVQUFVLEdBQUcsQ0FBQyxDQUFDLENBQUM7SUFFdkQsSUFBSSxjQUFjLEdBQUcsU0FBUyxDQUFDO0lBQy9CLElBQUksYUFBYSxHQUFHLFNBQVMsQ0FBQztJQUM5QixJQUFJLGNBQWMsR0FBRyxRQUFRLEdBQUcsQ0FBQyxDQUFDO0lBRWxDLCtDQUErQztJQUMvQyxPQUFPLGFBQWEsSUFBSSxRQUFRLElBQUksY0FBYyxJQUFJLFVBQVUsRUFBRTtRQUNoRSxJQUFNLGVBQWUsR0FBRyxTQUFTLENBQUMsYUFBYSxHQUFHLFNBQVMsQ0FBQyxDQUFDO1FBQzdELElBQU0sZ0JBQWdCLEdBQUcsU0FBUyxDQUFDLGNBQWMsR0FBRyxTQUFTLENBQUMsQ0FBQztRQUUvRCxJQUFJLGVBQWUsR0FBRyxnQkFBZ0IsRUFBRTtZQUN0QyxHQUFHLENBQUMsY0FBYyxDQUFDLEdBQUcsZUFBZSxDQUFDO1lBQ3RDLGFBQWEsRUFBRSxDQUFDO1NBQ2pCO2FBQU07WUFDTCxHQUFHLENBQUMsY0FBYyxDQUFDLEdBQUcsZ0JBQWdCLENBQUM7WUFDdkMsY0FBYyxFQUFFLENBQUM7U0FDbEI7UUFDRCxjQUFjLEVBQUUsQ0FBQztLQUNsQjtJQUVELGlGQUFpRjtJQUNqRixPQUFPLGFBQWEsSUFBSSxRQUFRLEVBQUU7UUFDaEMsR0FBRyxDQUFDLGNBQWMsQ0FBQyxHQUFHLFNBQVMsQ0FBQyxhQUFhLEdBQUcsU0FBUyxDQUFDLENBQUM7UUFDM0QsY0FBYyxFQUFFLENBQUM7UUFDakIsYUFBYSxFQUFFLENBQUM7S0FDakI7SUFDRCxPQUFPLGNBQWMsSUFBSSxVQUFVLEVBQUU7UUFDbkMsR0FBRyxDQUFDLGNBQWMsQ0FBQyxHQUFHLFNBQVMsQ0FBQyxjQUFjLEdBQUcsU0FBUyxDQUFDLENBQUM7UUFDNUQsY0FBYyxFQUFFLENBQUM7UUFDakIsY0FBYyxFQUFFLENBQUM7S0FDbEI7QUFDSCxDQUFDLENBQUM7QUFFRjs7R0FFRztBQUNILElBQU0sU0FBUyxHQUFHLFVBQ2hCLEdBQWtCLEVBQ2xCLFNBQWlCLEVBQ2pCLFVBQWtCO0lBRWxCLElBQUksVUFBVSxHQUFHLFNBQVMsRUFBRTtRQUMxQixJQUFNLFFBQVEsR0FBRyxJQUFJLENBQUMsS0FBSyxDQUFDLFNBQVMsR0FBRyxDQUFDLFVBQVUsR0FBRyxTQUFTLENBQUMsR0FBRyxDQUFDLENBQUMsQ0FBQztRQUV0RSxTQUFTLENBQUMsR0FBRyxFQUFFLFNBQVMsRUFBRSxRQUFRLENBQUMsQ0FBQztRQUNwQyxTQUFTLENBQUMsR0FBRyxFQUFFLFFBQVEsR0FBRyxDQUFDLEVBQUUsVUFBVSxDQUFDLENBQUM7UUFFekMsS0FBSyxDQUFDLEdBQUcsRUFBRSxTQUFTLEVBQUUsUUFBUSxFQUFFLFVBQVUsQ0FBQyxDQUFDO0tBQzdDO0FBQ0gsQ0FBQyxDQUFDO0FBRUY7Ozs7Ozs7R0FPRztBQUNVLFFBQUEsU0FBUyxHQUFHLFVBQUMsR0FBa0I7SUFDMUMsU0FBUyxDQUFDLEdBQUcsRUFBRSxDQUFDLEVBQUUsR0FBRyxDQUFDLE1BQU0sR0FBRyxDQUFDLENBQUMsQ0FBQztJQUVsQyxPQUFPLEdBQUcsQ0FBQztBQUNiLENBQUMsQ0FBQyJ9

package/lib/app/algorithms/sorts/quick-sort.d.ts

@@ -1,9 +0,0 @@
-/**
- * Quick sort algorithm
- *
- * @description
- * Time complexity: Best O(n * log(n)); Avg O(n * log(n)); Worst O(n  ^2)
- * @description
- * Memory complexity: Worst case: O(1)
- */
-export declare const quickSort: (arr: Array<number>) => Array<number>;