@appland/scanner 1.33.1

package/LICENSE.txt

@@ -0,0 +1,25 @@
+The Software is provided to you by the Licensor under the License, as defined below, subject to the following condition.
+
+Without limiting other conditions in the License, the grant of rights under the License will not include,
+and the License does not grant to you, the right to Sell the Software.
+
+For purposes of the foregoing, “Sell” means practicing any or all of the rights granted to you under the License to provide to third parties,
+for a fee or other consideration (including without limitation fees for hosting or consulting/ support services related to the Software),
+a product or service whose value derives, entirely or substantially, from the functionality of the Software.
+Any license notice or attribution required by the License must also include this Commons Clause License Condition notice.
+
+Software: @appland/scanner
+
+License: MIT License
+
+Copyright 2022, AppLand Inc
+
+Permission is hereby granted, free of charge, to any person obtaining a copy of this software and associated documentation files (the "Software"),
+to deal in the Software without restriction, including without limitation the rights to use, copy, modify, merge, publish, distribute, sublicense,
+and/or sell copies of the Software, and to permit persons to whom the Software is furnished to do so, subject to the following conditions:
+
+The above copyright notice and this permission notice shall be included in all copies or substantial portions of the Software.
+
+THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
+FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER LIABILITY,
+WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.

package/README.md

@@ -0,0 +1,122 @@
+# AppMap Scanner
+
+Code scanning, linting, assertions and alerts.
+
+Provides consistent ways to filter (include and exclude) the AppMap events and property values.
+
+# Rule configuration
+
+## Event filters
+
+Two standard event filters are provided that can be used with every rule: `include` and `exclude`.
+These filters are applied to an event, and make a determination about whether or not that event
+should be checked by the rule.
+
+An event filter can be applied in one of two ways:
+
+- `scope` the entire scope - for example, `http_server_request`, `command`.
+- `event` an individual event within a scope. When `enumerateScope` is true for a rule, the event
+  filters are applied automatically by the scanner framework. When `enumerateScope` is false, the
+  rule code must apply the filter itself.
+
+The event filter consists of a property name and a test. The framework fetches the property value
+from the event, and then applies the test. The test can be one of three types:
+
+- `equal` - value string matches the filter condition exactly.
+- `include` - value string includes the filter condition.
+- `match` - value string matches the filter condition regexp.
+
+Here's an example of a rule configured with a custom `include` event filter. The event filter
+prevents the rule from being applied to SQL queries that include the fragment
+`FROM "pg_class" INNER JOIN "pg_attribute"` (because these queries are fetching ORM metadata, not
+application code).
+
+```yaml
+- id: tooManyJoins
+  exclude:
+    - event:
+        property: query
+        test:
+          include: FROM "pg_class" INNER JOIN "pg_attribute"
+```
+
+## Pattern filters
+
+A second type of filter is pattern filter. Pattern filters are provided by rules that need, or
+benefit from, specific configuration.
+
+Like Event filters, a pattern filter uses `equal`, `include`, or `match`. The data to which the
+pattern filter is applied depends on the particulars of the rule. For example, this pattern filter
+finds slow function calls within a specific package:
+
+```yaml
+- id: slowFunctionCall
+  properties:
+    functions:
+      - match: ^app/models
+    timeAllowed: 0.25
+```
+
+## Schema validation
+
+The configuration YAML is validated against the rule schema before the scan is run. Any errors in
+the configuration are reported, and must be fixed before the scan can continue. Consult the
+documentation for each rule to see it's pattern filters and other configurable properties.
+
+## Development
+
+We use `yarn` for package management. Run `yarn` to install dependencies and `yarn build` to emit
+JavaScript. To run without first emitting JavaScript to the filesystem, use `yarn start`.
+
+## Installation
+
+Install like any other Node.js package, using `yarn` or `npm`:
+
+```bash
+yarn add --dev @appland/scanner
+```
+
+Then, you may find it convenient to add some scripts to your `package.json`:
+
+```
+  "scripts": {
+    "scan": "npx @appland/scanner scan --appmap-dir tmp/appmap",
+    "scan-ci": "npx @appland/scanner ci --appmap-dir tmp/appmap",
+  },
+```
+
+**Note** `tmp/appmap` is the standard AppMap location for some AppMap agents, but not all. Consult
+your agent documentation and settings to configure the `--appmap-dir`.
+
+## Scan locally
+
+```bash
+yarn run scan
+```
+
+Findings will be printed to the console, and saved to `appland-findings.json`.
+
+## CI integration
+
+When using Appmap Scanner in CI you can post findings summary as a commit status and/or a PR comment
+(currently only GitHub is supported). In order to allow access to your repo you need to create a
+[personal token](https://github.com/settings/tokens/new) with following privileges and add it as a
+`GH_TOKEN` env variable to your CI:
+
+- `repo` for posting PR comments
+- `repo:status` for posting commit statuses
+
+```bash
+yarn run scan-ci
+```
+
+## Development
+
+### Using a local branch of `@appland/models`
+
+Use `yarn link` to create a symlink to a local version of `@appland/models`. Make sure the models
+package is built according to the instructions in its own README.
+
+```sh
+$ yarn link ../appmap-js/packages/models
+```

package/built/algorithms/dataStructures/graph/Graph.js

@@ -0,0 +1,155 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var Graph = /** @class */ (function () {
+    /**
+     * @param {boolean} isDirected
+     */
+    function Graph(isDirected) {
+        if (isDirected === void 0) { isDirected = false; }
+        this.vertices = {};
+        this.edges = {};
+        this.vertices = {};
+        this.edges = {};
+        this.isDirected = isDirected;
+    }
+    Object.defineProperty(Graph.prototype, "vertexCount", {
+        get: function () {
+            return Object.keys(this.vertices).length;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    Graph.prototype.addVertex = function (newVertex) {
+        this.vertices[newVertex.getKey()] = newVertex;
+        return this;
+    };
+    Graph.prototype.getVertexByKey = function (vertexKey) {
+        return this.vertices[vertexKey];
+    };
+    Graph.prototype.getNeighbors = function (vertex) {
+        return vertex.getNeighbors();
+    };
+    Graph.prototype.getAllVertices = function () {
+        return Object.values(this.vertices);
+    };
+    Graph.prototype.getAllEdges = function () {
+        return Object.values(this.edges);
+    };
+    Graph.prototype.addEdge = function (edge) {
+        // Try to find and end start vertices.
+        var startVertex = this.getVertexByKey(edge.startVertex.getKey());
+        var endVertex = this.getVertexByKey(edge.endVertex.getKey());
+        // Insert start vertex if it wasn't inserted.
+        if (!startVertex) {
+            this.addVertex(edge.startVertex);
+            startVertex = this.getVertexByKey(edge.startVertex.getKey());
+        }
+        // Insert end vertex if it wasn't inserted.
+        if (!endVertex) {
+            this.addVertex(edge.endVertex);
+            endVertex = this.getVertexByKey(edge.endVertex.getKey());
+        }
+        // Check if edge has been already added.
+        if (this.edges[edge.getKey()]) {
+            throw new Error('Edge has already been added before');
+        }
+        else {
+            this.edges[edge.getKey()] = edge;
+        }
+        // Add edge to the vertices.
+        if (this.isDirected) {
+            // If graph IS directed then add the edge only to start vertex.
+            startVertex.addEdge(edge);
+        }
+        else {
+            // If graph ISN'T directed then add the edge to both vertices.
+            startVertex.addEdge(edge);
+            endVertex.addEdge(edge);
+        }
+        return this;
+    };
+    Graph.prototype.deleteEdge = function (edge) {
+        // Delete edge from the list of edges.
+        if (this.edges[edge.getKey()]) {
+            delete this.edges[edge.getKey()];
+        }
+        else {
+            throw new Error('Edge not found in graph');
+        }
+        // Try to find and end start vertices and delete edge from them.
+        var startVertex = this.getVertexByKey(edge.startVertex.getKey());
+        var endVertex = this.getVertexByKey(edge.endVertex.getKey());
+        if (startVertex) {
+            startVertex.deleteEdge(edge);
+        }
+        if (endVertex) {
+            endVertex.deleteEdge(edge);
+        }
+    };
+    Graph.prototype.findEdge = function (startVertex, endVertex) {
+        var vertex = this.getVertexByKey(startVertex.getKey());
+        if (!vertex) {
+            return null;
+        }
+        return vertex.findEdge(endVertex);
+    };
+    Graph.prototype.findVertexByKey = function (vertexKey) {
+        if (this.vertices[vertexKey]) {
+            return this.vertices[vertexKey];
+        }
+        return null;
+    };
+    Graph.prototype.getWeight = function () {
+        return this.getAllEdges().reduce(function (weight, graphEdge) {
+            return weight + graphEdge.weight;
+        }, 0);
+    };
+    /**
+     * Reverse all the edges in directed graph.
+     */
+    Graph.prototype.reverse = function () {
+        var _this = this;
+        this.getAllEdges().forEach(function (edge) {
+            // Delete straight edge from graph and from vertices.
+            _this.deleteEdge(edge);
+            // Reverse the edge.
+            edge.reverse();
+            // Add reversed edge back to the graph and its vertices.
+            _this.addEdge(edge);
+        });
+        return this;
+    };
+    Graph.prototype.getVerticesIndices = function () {
+        var verticesIndices = {};
+        this.getAllVertices().forEach(function (vertex, index) {
+            verticesIndices[vertex.getKey()] = index;
+        });
+        return verticesIndices;
+    };
+    Graph.prototype.getAdjacencyMatrix = function () {
+        var _this = this;
+        var vertices = this.getAllVertices();
+        var verticesIndices = this.getVerticesIndices();
+        // Init matrix with infinities meaning that there is no ways of
+        // getting from one vertex to another yet.
+        var adjacencyMatrix = Array(vertices.length)
+            .fill(null)
+            .map(function () {
+            return Array(vertices.length).fill(Infinity);
+        });
+        // Fill the columns.
+        vertices.forEach(function (vertex, vertexIndex) {
+            vertex.getNeighbors().forEach(function (neighbor) {
+                var neighborIndex = verticesIndices[neighbor.getKey()];
+                adjacencyMatrix[vertexIndex][neighborIndex] = _this.findEdge(vertex, neighbor).weight;
+            });
+        });
+        return adjacencyMatrix;
+    };
+    Graph.prototype.toString = function () {
+        return Object.keys(this.vertices).toString();
+    };
+    return Graph;
+}());
+exports.default = Graph;
+//# sourceMappingURL=Graph.js.map

package/built/algorithms/dataStructures/graph/Graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"Graph.js","sourceRoot":"","sources":["../../../../src/algorithms/dataStructures/graph/Graph.ts"],"names":[],"mappings":";;AAGA;IAKE;;OAEG;IACH,eAAY,UAAkB;QAAlB,2BAAA,EAAA,kBAAkB;QAP9B,aAAQ,GAAgC,EAAE,CAAC;QAC3C,UAAK,GAA8B,EAAE,CAAC;QAOpC,IAAI,CAAC,QAAQ,GAAG,EAAE,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,EAAE,CAAC;QAChB,IAAI,CAAC,UAAU,GAAG,UAAU,CAAC;IAC/B,CAAC;IAED,sBAAI,8BAAW;aAAf;YACE,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,MAAM,CAAC;QAC3C,CAAC;;;OAAA;IAED,yBAAS,GAAT,UAAU,SAAsB;QAC9B,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,GAAG,SAAS,CAAC;QAE9C,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8BAAc,GAAd,UAAe,SAAiB;QAC9B,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IAClC,CAAC;IAED,4BAAY,GAAZ,UAAa,MAAmB;QAC9B,OAAO,MAAM,CAAC,YAAY,EAAE,CAAC;IAC/B,CAAC;IAED,8BAAc,GAAd;QACE,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;IACtC,CAAC;IAED,2BAAW,GAAX;QACE,OAAO,MAAM,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACnC,CAAC;IAED,uBAAO,GAAP,UAAQ,IAAe;QACrB,sCAAsC;QACtC,IAAI,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QACjE,IAAI,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QAE7D,6CAA6C;QAC7C,IAAI,CAAC,WAAW,EAAE;YAChB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACjC,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;SAC9D;QAED,2CAA2C;QAC3C,IAAI,CAAC,SAAS,EAAE;YACd,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAC/B,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;SAC1D;QAED,wCAAwC;QACxC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAC7B,MAAM,IAAI,KAAK,CAAC,oCAAoC,CAAC,CAAC;SACvD;aAAM;YACL,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC;SAClC;QAED,4BAA4B;QAC5B,IAAI,IAAI,CAAC,UAAU,EAAE;YACnB,+DAA+D;YAC/D,WAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;SAC5B;aAAM;YACL,8DAA8D;YAC9D,WAAY,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC3B,SAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;SAC1B;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,0BAAU,GAAV,UAAW,IAAe;QACxB,sCAAsC;QACtC,IAAI,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,EAAE;YAC7B,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;SAClC;aAAM;YACL,MAAM,IAAI,KAAK,CAAC,yBAAyB,CAAC,CAAC;SAC5C;QAED,gEAAgE;QAChE,IAAM,WAAW,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QACnE,IAAM,SAAS,GAAG,IAAI,CAAC,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC,CAAC;QAE/D,IAAI,WAAW,EAAE;YACf,WAAW,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SAC9B;QACD,IAAI,SAAS,EAAE;YACb,SAAS,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;SAC5B;IACH,CAAC;IAED,wBAAQ,GAAR,UAAS,WAAwB,EAAE,SAAsB;QACvD,IAAM,MAAM,GAAG,IAAI,CAAC,cAAc,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC,CAAC;QACzD,IAAI,CAAC,MAAM,EAAE;YACX,OAAO,IAAI,CAAC;SACb;QACD,OAAO,MAAM,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;IACpC,CAAC;IAED,+BAAe,GAAf,UAAgB,SAAiB;QAC/B,IAAI,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE;YAC5B,OAAO,IAAI,CAAC,QAAQ,CAAC,SAAS,CAAC,CAAC;SACjC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,yBAAS,GAAT;QACE,OAAO,IAAI,CAAC,WAAW,EAAE,CAAC,MAAM,CAAC,UAAC,MAAM,EAAE,SAAS;YACjD,OAAO,MAAM,GAAG,SAAS,CAAC,MAAM,CAAC;QACnC,CAAC,EAAE,CAAC,CAAC,CAAC;IACR,CAAC;IAED;;OAEG;IACH,uBAAO,GAAP;QAAA,iBAaC;QAZC,IAAI,CAAC,WAAW,EAAE,CAAC,OAAO,CAAC,UAAC,IAAe;YACzC,qDAAqD;YACrD,KAAI,CAAC,UAAU,CAAC,IAAI,CAAC,CAAC;YAEtB,oBAAoB;YACpB,IAAI,CAAC,OAAO,EAAE,CAAC;YAEf,wDAAwD;YACxD,KAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QACrB,CAAC,CAAC,CAAC;QAEH,OAAO,IAAI,CAAC;IACd,CAAC;IAED,kCAAkB,GAAlB;QACE,IAAM,eAAe,GAA2B,EAAE,CAAC;QACnD,IAAI,CAAC,cAAc,EAAE,CAAC,OAAO,CAAC,UAAC,MAAM,EAAE,KAAK;YAC1C,eAAe,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,GAAG,KAAK,CAAC;QAC3C,CAAC,CAAC,CAAC;QAEH,OAAO,eAAe,CAAC;IACzB,CAAC;IAED,kCAAkB,GAAlB;QAAA,iBAqBC;QApBC,IAAM,QAAQ,GAAG,IAAI,CAAC,cAAc,EAAE,CAAC;QACvC,IAAM,eAAe,GAAG,IAAI,CAAC,kBAAkB,EAAE,CAAC;QAElD,+DAA+D;QAC/D,0CAA0C;QAC1C,IAAM,eAAe,GAAG,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC;aAC3C,IAAI,CAAC,IAAI,CAAC;aACV,GAAG,CAAC;YACH,OAAO,KAAK,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;QAC/C,CAAC,CAAC,CAAC;QAEL,oBAAoB;QACpB,QAAQ,CAAC,OAAO,CAAC,UAAC,MAAM,EAAE,WAAW;YACnC,MAAM,CAAC,YAAY,EAAE,CAAC,OAAO,CAAC,UAAC,QAAQ;gBACrC,IAAM,aAAa,GAAG,eAAe,CAAC,QAAQ,CAAC,MAAM,EAAE,CAAC,CAAC;gBACzD,eAAe,CAAC,WAAW,CAAC,CAAC,aAAa,CAAC,GAAG,KAAI,CAAC,QAAQ,CAAC,MAAM,EAAE,QAAQ,CAAE,CAAC,MAAM,CAAC;YACxF,CAAC,CAAC,CAAC;QACL,CAAC,CAAC,CAAC;QAEH,OAAO,eAAe,CAAC;IACzB,CAAC;IAED,wBAAQ,GAAR;QACE,OAAO,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC/C,CAAC;IACH,YAAC;AAAD,CAAC,AA5KD,IA4KC"}

package/built/algorithms/dataStructures/graph/GraphEdge.js

@@ -0,0 +1,27 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var GraphEdge = /** @class */ (function () {
+    function GraphEdge(startVertex, endVertex, weight) {
+        if (weight === void 0) { weight = 0; }
+        this.startVertex = startVertex;
+        this.endVertex = endVertex;
+        this.weight = weight;
+    }
+    GraphEdge.prototype.getKey = function () {
+        var startVertexKey = this.startVertex.getKey();
+        var endVertexKey = this.endVertex.getKey();
+        return startVertexKey + " - " + endVertexKey;
+    };
+    GraphEdge.prototype.reverse = function () {
+        var tmp = this.startVertex;
+        this.startVertex = this.endVertex;
+        this.endVertex = tmp;
+        return this;
+    };
+    GraphEdge.prototype.toString = function () {
+        return this.getKey();
+    };
+    return GraphEdge;
+}());
+exports.default = GraphEdge;
+//# sourceMappingURL=GraphEdge.js.map

package/built/algorithms/dataStructures/graph/GraphEdge.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphEdge.js","sourceRoot":"","sources":["../../../../src/algorithms/dataStructures/graph/GraphEdge.ts"],"names":[],"mappings":";;AAEA;IAKE,mBAAY,WAAwB,EAAE,SAAsB,EAAE,MAAU;QAAV,uBAAA,EAAA,UAAU;QACtE,IAAI,CAAC,WAAW,GAAG,WAAW,CAAC;QAC/B,IAAI,CAAC,SAAS,GAAG,SAAS,CAAC;QAC3B,IAAI,CAAC,MAAM,GAAG,MAAM,CAAC;IACvB,CAAC;IAED,0BAAM,GAAN;QACE,IAAM,cAAc,GAAG,IAAI,CAAC,WAAW,CAAC,MAAM,EAAE,CAAC;QACjD,IAAM,YAAY,GAAG,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,CAAC;QAE7C,OAAU,cAAc,WAAM,YAAc,CAAC;IAC/C,CAAC;IAED,2BAAO,GAAP;QACE,IAAM,GAAG,GAAG,IAAI,CAAC,WAAW,CAAC;QAC7B,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,SAAS,CAAC;QAClC,IAAI,CAAC,SAAS,GAAG,GAAG,CAAC;QAErB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,4BAAQ,GAAR;QACE,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC;IACvB,CAAC;IACH,gBAAC;AAAD,CAAC,AA7BD,IA6BC"}

package/built/algorithms/dataStructures/graph/GraphVertex.js

@@ -0,0 +1,79 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var LinkedList_1 = __importDefault(require("../linked-list/LinkedList"));
+var GraphVertex = /** @class */ (function () {
+    /**
+     * @param {*} value
+     */
+    function GraphVertex(value) {
+        if (value === '') {
+            throw new Error('Graph vertex must have a non-empty value');
+        }
+        var edgeComparator = function (edgeA, edgeB) {
+            if (edgeA.getKey() === edgeB.getKey()) {
+                return 0;
+            }
+            return edgeA.getKey() < edgeB.getKey() ? -1 : 1;
+        };
+        // Normally you would store string value like vertex name.
+        // But generally it may be any object as well
+        this.value = value;
+        this.edges = new LinkedList_1.default(edgeComparator);
+    }
+    GraphVertex.prototype.addEdge = function (edge) {
+        this.edges.append(edge);
+        return this;
+    };
+    GraphVertex.prototype.deleteEdge = function (edge) {
+        this.edges.delete(edge);
+    };
+    GraphVertex.prototype.getNeighbors = function () {
+        var _this = this;
+        var edges = this.edges.toArray();
+        var neighborsConverter = function (node) {
+            return node.value.startVertex === _this ? node.value.endVertex : node.value.startVertex;
+        };
+        // Return either start or end vertex.
+        // For undirected graphs it is possible that current vertex will be the end one.
+        return edges.map(neighborsConverter);
+    };
+    GraphVertex.prototype.getEdges = function () {
+        return this.edges.toArray().map(function (linkedListNode) { return linkedListNode.value; });
+    };
+    GraphVertex.prototype.getDegree = function () {
+        return this.edges.toArray().length;
+    };
+    GraphVertex.prototype.hasEdge = function (requiredEdge) {
+        var edgeNode = this.edges.find(undefined, function (edge) { return edge === requiredEdge; });
+        return !!edgeNode;
+    };
+    GraphVertex.prototype.hasNeighbor = function (vertex) {
+        var vertexNode = this.edges.find(undefined, function (edge) { return edge.startVertex === vertex || edge.endVertex === vertex; });
+        return !!vertexNode;
+    };
+    GraphVertex.prototype.findEdge = function (vertex) {
+        var edgeFinder = function (edge) {
+            return edge.startVertex === vertex || edge.endVertex === vertex;
+        };
+        var edge = this.edges.find(undefined, edgeFinder);
+        return edge ? edge.value : null;
+    };
+    GraphVertex.prototype.getKey = function () {
+        return this.value;
+    };
+    GraphVertex.prototype.deleteAllEdges = function () {
+        var _this = this;
+        this.getEdges().forEach(function (edge) { return _this.deleteEdge(edge); });
+        return this;
+    };
+    GraphVertex.prototype.toString = function (callback) {
+        if (callback === void 0) { callback = undefined; }
+        return callback ? callback(this.value) : "" + this.value;
+    };
+    return GraphVertex;
+}());
+exports.default = GraphVertex;
+//# sourceMappingURL=GraphVertex.js.map

package/built/algorithms/dataStructures/graph/GraphVertex.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"GraphVertex.js","sourceRoot":"","sources":["../../../../src/algorithms/dataStructures/graph/GraphVertex.ts"],"names":[],"mappings":";;;;;AACA,yEAAmD;AAGnD;IAIE;;OAEG;IACH,qBAAY,KAAa;QACvB,IAAI,KAAK,KAAK,EAAE,EAAE;YAChB,MAAM,IAAI,KAAK,CAAC,0CAA0C,CAAC,CAAC;SAC7D;QAED,IAAM,cAAc,GAAG,UAAC,KAAgB,EAAE,KAAgB;YACxD,IAAI,KAAK,CAAC,MAAM,EAAE,KAAK,KAAK,CAAC,MAAM,EAAE,EAAE;gBACrC,OAAO,CAAC,CAAC;aACV;YAED,OAAO,KAAK,CAAC,MAAM,EAAE,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;QAClD,CAAC,CAAC;QAEF,0DAA0D;QAC1D,6CAA6C;QAC7C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,KAAK,GAAG,IAAI,oBAAU,CAAY,cAAc,CAAC,CAAC;IACzD,CAAC;IAED,6BAAO,GAAP,UAAQ,IAAe;QACrB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAExB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,gCAAU,GAAV,UAAW,IAAe;QACxB,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,kCAAY,GAAZ;QAAA,iBAUC;QATC,IAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC;QAEnC,IAAM,kBAAkB,GAAG,UAAC,IAA+B;YACzD,OAAO,IAAI,CAAC,KAAK,CAAC,WAAW,KAAK,KAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,WAAW,CAAC;QACzF,CAAC,CAAC;QAEF,qCAAqC;QACrC,gFAAgF;QAChF,OAAO,KAAK,CAAC,GAAG,CAAC,kBAAkB,CAAC,CAAC;IACvC,CAAC;IAED,8BAAQ,GAAR;QACE,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,GAAG,CAAC,UAAC,cAAc,IAAK,OAAA,cAAc,CAAC,KAAK,EAApB,CAAoB,CAAC,CAAC;IAC5E,CAAC;IAED,+BAAS,GAAT;QACE,OAAO,IAAI,CAAC,KAAK,CAAC,OAAO,EAAE,CAAC,MAAM,CAAC;IACrC,CAAC;IAED,6BAAO,GAAP,UAAQ,YAAuB;QAC7B,IAAM,QAAQ,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,UAAC,IAAe,IAAK,OAAA,IAAI,KAAK,YAAY,EAArB,CAAqB,CAAC,CAAC;QAExF,OAAO,CAAC,CAAC,QAAQ,CAAC;IACpB,CAAC;IAED,iCAAW,GAAX,UAAY,MAAmB;QAC7B,IAAM,UAAU,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAChC,SAAS,EACT,UAAC,IAAe,IAAK,OAAA,IAAI,CAAC,WAAW,KAAK,MAAM,IAAI,IAAI,CAAC,SAAS,KAAK,MAAM,EAAxD,CAAwD,CAC9E,CAAC;QAEF,OAAO,CAAC,CAAC,UAAU,CAAC;IACtB,CAAC;IAED,8BAAQ,GAAR,UAAS,MAAmB;QAC1B,IAAM,UAAU,GAAG,UAAC,IAAe;YACjC,OAAO,IAAI,CAAC,WAAW,KAAK,MAAM,IAAI,IAAI,CAAC,SAAS,KAAK,MAAM,CAAC;QAClE,CAAC,CAAC;QAEF,IAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,SAAS,EAAE,UAAU,CAAC,CAAC;QAEpD,OAAO,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,CAAC;IAClC,CAAC;IAED,4BAAM,GAAN;QACE,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED,oCAAc,GAAd;QAAA,iBAIC;QAHC,IAAI,CAAC,QAAQ,EAAE,CAAC,OAAO,CAAC,UAAC,IAAI,IAAK,OAAA,KAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAArB,CAAqB,CAAC,CAAC;QAEzD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,8BAAQ,GAAR,UAAS,QAA6D;QAA7D,yBAAA,EAAA,oBAA6D;QACpE,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAS,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAG,IAAI,CAAC,KAAO,CAAC;IAC5D,CAAC;IACH,kBAAC;AAAD,CAAC,AA9FD,IA8FC"}

package/built/algorithms/dataStructures/linked-list/LinkedList.js

@@ -0,0 +1,134 @@
+"use strict";
+var __importDefault = (this && this.__importDefault) || function (mod) {
+    return (mod && mod.__esModule) ? mod : { "default": mod };
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+var LinkedListNode_1 = __importDefault(require("./LinkedListNode"));
+var Comparator_1 = __importDefault(require("../../utils/Comparator"));
+var LinkedList = /** @class */ (function () {
+    function LinkedList(comparatorFunction) {
+        this.head = null;
+        this.tail = null;
+        this.compare = new Comparator_1.default(comparatorFunction);
+    }
+    LinkedList.prototype.prepend = function (value) {
+        // Make new node to be a head.
+        this.head = new LinkedListNode_1.default(value, this.head);
+        return this;
+    };
+    LinkedList.prototype.append = function (value) {
+        var newNode = new LinkedListNode_1.default(value);
+        // If there is no head yet let's make new node a head.
+        if (!this.head) {
+            this.head = newNode;
+            this.tail = newNode;
+            return this;
+        }
+        // Attach new node to the end of linked list.
+        this.tail.next = newNode;
+        this.tail = newNode;
+        return this;
+    };
+    LinkedList.prototype.delete = function (value) {
+        if (!this.head) {
+            return null;
+        }
+        var deletedNode = null;
+        // If the head must be deleted then make 2nd node to be a head.
+        while (this.head && this.compare.equal(this.head.value, value)) {
+            deletedNode = this.head;
+            this.head = this.head.next;
+        }
+        var currentNode = this.head;
+        if (currentNode !== null) {
+            // If next node must be deleted then make next node to be a next next one.
+            while (currentNode.next) {
+                if (this.compare.equal(currentNode.next.value, value)) {
+                    deletedNode = currentNode.next;
+                    currentNode.next = currentNode.next.next;
+                }
+                else {
+                    currentNode = currentNode.next;
+                }
+            }
+        }
+        // Check if tail must be deleted.
+        if (this.compare.equal(this.tail.value, value)) {
+            this.tail = currentNode;
+        }
+        return deletedNode;
+    };
+    LinkedList.prototype.find = function (value, callback) {
+        if (value === void 0) { value = undefined; }
+        if (callback === void 0) { callback = undefined; }
+        if (!this.head) {
+            return null;
+        }
+        var currentNode = this.head;
+        while (currentNode) {
+            // If callback is specified then try to find node by callback.
+            if (callback && callback(currentNode.value)) {
+                return currentNode;
+            }
+            // If value is specified then try to compare by value..
+            if (value !== undefined && this.compare.equal(currentNode.value, value)) {
+                return currentNode;
+            }
+            currentNode = currentNode.next;
+        }
+        return null;
+    };
+    LinkedList.prototype.deleteTail = function () {
+        if (this.head === this.tail) {
+            var deletedTail_1 = this.tail;
+            this.head = null;
+            this.tail = null;
+            return deletedTail_1;
+        }
+        var deletedTail = this.tail;
+        // Rewind to the last node and delete "next" link for the node before the last one.
+        var currentNode = this.head;
+        while (currentNode.next) {
+            if (!currentNode.next.next) {
+                currentNode.next = null;
+            }
+            else {
+                currentNode = currentNode.next;
+            }
+        }
+        this.tail = currentNode;
+        return deletedTail;
+    };
+    LinkedList.prototype.deleteHead = function () {
+        if (!this.head) {
+            return null;
+        }
+        var deletedHead = this.head;
+        if (this.head.next) {
+            this.head = this.head.next;
+        }
+        else {
+            this.head = null;
+            this.tail = null;
+        }
+        return deletedHead;
+    };
+    LinkedList.prototype.toArray = function () {
+        var nodes = [];
+        var currentNode = this.head;
+        while (currentNode) {
+            nodes.push(currentNode);
+            currentNode = currentNode.next;
+        }
+        return nodes;
+    };
+    LinkedList.prototype.toString = function (callback) {
+        if (callback === void 0) { callback = undefined; }
+        return this.toArray()
+            .map(function (node) { return node.toString(callback); })
+            .toString();
+    };
+    return LinkedList;
+}());
+exports.default = LinkedList;
+//# sourceMappingURL=LinkedList.js.map

package/built/algorithms/dataStructures/linked-list/LinkedList.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinkedList.js","sourceRoot":"","sources":["../../../../src/algorithms/dataStructures/linked-list/LinkedList.ts"],"names":[],"mappings":";;;;;AAAA,oEAA8C;AAC9C,sEAAgD;AAEhD;IAKE,oBAAY,kBAA0C;QAJtD,SAAI,GAA6B,IAAI,CAAC;QACtC,SAAI,GAA6B,IAAI,CAAC;QAIpC,IAAI,CAAC,OAAO,GAAG,IAAI,oBAAU,CAAC,kBAAkB,CAAC,CAAC;IACpD,CAAC;IAED,4BAAO,GAAP,UAAQ,KAAQ;QACd,8BAA8B;QAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,wBAAc,CAAC,KAAK,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;QAEjD,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2BAAM,GAAN,UAAO,KAAQ;QACb,IAAM,OAAO,GAAG,IAAI,wBAAc,CAAI,KAAK,CAAC,CAAC;QAE7C,sDAAsD;QACtD,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YACd,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YACpB,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;YAEpB,OAAO,IAAI,CAAC;SACb;QAED,6CAA6C;QAC7C,IAAI,CAAC,IAAK,CAAC,IAAI,GAAG,OAAO,CAAC;QAC1B,IAAI,CAAC,IAAI,GAAG,OAAO,CAAC;QAEpB,OAAO,IAAI,CAAC;IACd,CAAC;IAED,2BAAM,GAAN,UAAO,KAAQ;QACb,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YACd,OAAO,IAAI,CAAC;SACb;QAED,IAAI,WAAW,GAAG,IAAI,CAAC;QAEvB,+DAA+D;QAC/D,OAAO,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;YAC9D,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;YACxB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;SAC5B;QAED,IAAI,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAE5B,IAAI,WAAW,KAAK,IAAI,EAAE;YACxB,0EAA0E;YAC1E,OAAO,WAAW,CAAC,IAAI,EAAE;gBACvB,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,IAAI,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;oBACrD,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;oBAC/B,WAAW,CAAC,IAAI,GAAG,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC;iBAC1C;qBAAM;oBACL,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;iBAChC;aACF;SACF;QAED,iCAAiC;QACjC,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,IAAI,CAAC,IAAK,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;YAC/C,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC;SACzB;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,yBAAI,GAAJ,UACE,KAAgC,EAChC,QAAyD;QADzD,sBAAA,EAAA,iBAAgC;QAChC,yBAAA,EAAA,oBAAyD;QAEzD,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YACd,OAAO,IAAI,CAAC;SACb;QAED,IAAI,WAAW,GAA6B,IAAI,CAAC,IAAI,CAAC;QAEtD,OAAO,WAAW,EAAE;YAClB,8DAA8D;YAC9D,IAAI,QAAQ,IAAI,QAAS,CAAC,WAAW,CAAC,KAAK,CAAC,EAAE;gBAC5C,OAAO,WAAW,CAAC;aACpB;YAED,uDAAuD;YACvD,IAAI,KAAK,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,KAAK,CAAC,EAAE;gBACvE,OAAO,WAAW,CAAC;aACpB;YAED,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;SAChC;QAED,OAAO,IAAI,CAAC;IACd,CAAC;IAED,+BAAU,GAAV;QACE,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,IAAI,EAAE;YAC3B,IAAM,aAAW,GAAG,IAAI,CAAC,IAAI,CAAC;YAC9B,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YAEjB,OAAO,aAAW,CAAC;SACpB;QAED,IAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAE9B,mFAAmF;QACnF,IAAI,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,OAAO,WAAY,CAAC,IAAI,EAAE;YACxB,IAAI,CAAC,WAAY,CAAC,IAAI,CAAC,IAAI,EAAE;gBAC3B,WAAY,CAAC,IAAI,GAAG,IAAI,CAAC;aAC1B;iBAAM;gBACL,WAAW,GAAG,WAAY,CAAC,IAAI,CAAC;aACjC;SACF;QAED,IAAI,CAAC,IAAI,GAAG,WAAW,CAAC;QACxB,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,+BAAU,GAAV;QACE,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YACd,OAAO,IAAI,CAAC;SACb;QAED,IAAM,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAE9B,IAAI,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE;YAClB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC;SAC5B;aAAM;YACL,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;YACjB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;SAClB;QAED,OAAO,WAAW,CAAC;IACrB,CAAC;IAED,4BAAO,GAAP;QACE,IAAM,KAAK,GAAG,EAAE,CAAC;QAEjB,IAAI,WAAW,GAAG,IAAI,CAAC,IAAI,CAAC;QAC5B,OAAO,WAAW,EAAE;YAClB,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACxB,WAAW,GAAG,WAAW,CAAC,IAAI,CAAC;SAChC;QAED,OAAO,KAAK,CAAC;IACf,CAAC;IAED,6BAAQ,GAAR,UAAS,QAAwD;QAAxD,yBAAA,EAAA,oBAAwD;QAC/D,OAAO,IAAI,CAAC,OAAO,EAAE;aAClB,GAAG,CAAC,UAAC,IAAI,IAAK,OAAA,IAAI,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAvB,CAAuB,CAAC;aACtC,QAAQ,EAAE,CAAC;IAChB,CAAC;IACH,iBAAC;AAAD,CAAC,AA3JD,IA2JC"}

package/built/algorithms/dataStructures/linked-list/LinkedListNode.js

@@ -0,0 +1,16 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+var LinkedListNode = /** @class */ (function () {
+    function LinkedListNode(value, next) {
+        if (next === void 0) { next = null; }
+        this.value = value;
+        this.next = next;
+    }
+    LinkedListNode.prototype.toString = function (callback) {
+        if (callback === void 0) { callback = undefined; }
+        return callback ? callback(this.value) : "" + this.value;
+    };
+    return LinkedListNode;
+}());
+exports.default = LinkedListNode;
+//# sourceMappingURL=LinkedListNode.js.map

package/built/algorithms/dataStructures/linked-list/LinkedListNode.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"LinkedListNode.js","sourceRoot":"","sources":["../../../../src/algorithms/dataStructures/linked-list/LinkedListNode.ts"],"names":[],"mappings":";;AAAA;IAIE,wBAAY,KAAQ,EAAE,IAAqC;QAArC,qBAAA,EAAA,WAAqC;QACzD,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;IAED,iCAAQ,GAAR,UAAS,QAAwD;QAAxD,yBAAA,EAAA,oBAAwD;QAC/D,OAAO,QAAQ,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAG,IAAI,CAAC,KAAO,CAAC;IAC3D,CAAC;IACH,qBAAC;AAAD,CAAC,AAZD,IAYC"}

package/built/algorithms/graph/depth-first-search/index.js

@@ -0,0 +1,49 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.depthFirstSearch = void 0;
+/**
+ * @param {Callbacks} [callbacks]
+ * @returns {Callbacks}
+ */
+function initCallbacks(callbacks) {
+    var initiatedCallback = Object.assign({}, callbacks);
+    // eslint-disable-next-line @typescript-eslint/no-empty-function
+    var stubCallback = function () { };
+    var allowTraversalCallback = (function () {
+        var seen = {};
+        return function (_previousVertex, _currentVertex, nextVertex) {
+            if (!seen[nextVertex.getKey()]) {
+                seen[nextVertex.getKey()] = true;
+                return true;
+            }
+            return false;
+        };
+    })();
+    initiatedCallback.allowTraversal = callbacks.allowTraversal || allowTraversalCallback;
+    initiatedCallback.enterVertex = callbacks.enterVertex || stubCallback;
+    initiatedCallback.leaveVertex = callbacks.leaveVertex || stubCallback;
+    return initiatedCallback;
+}
+/**
+ * @param {Graph} graph
+ * @param {GraphVertex} currentVertex
+ * @param {GraphVertex} previousVertex
+ * @param {Callbacks} callbacks
+ */
+function depthFirstSearchRecursive(graph, currentVertex, previousVertex, callbacks) {
+    if (!callbacks.enterVertex(currentVertex, previousVertex)) {
+        return;
+    }
+    graph.getNeighbors(currentVertex).forEach(function (nextVertex) {
+        if (callbacks.allowTraversal(previousVertex, currentVertex, nextVertex)) {
+            depthFirstSearchRecursive(graph, nextVertex, currentVertex, callbacks);
+        }
+    });
+    callbacks.leaveVertex(currentVertex, previousVertex);
+}
+function depthFirstSearch(graph, startVertex, callbacks) {
+    var previousVertex = null;
+    depthFirstSearchRecursive(graph, startVertex, previousVertex, initCallbacks(callbacks));
+}
+exports.depthFirstSearch = depthFirstSearch;
+//# sourceMappingURL=index.js.map

package/built/algorithms/graph/depth-first-search/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/algorithms/graph/depth-first-search/index.ts"],"names":[],"mappings":";;;AAGA;;;GAGG;AACH,SAAS,aAAa,CAAC,SAAoB;IACzC,IAAM,iBAAiB,GAAc,MAAM,CAAC,MAAM,CAAC,EAAE,EAAE,SAAS,CAAC,CAAC;IAElE,gEAAgE;IAChE,IAAM,YAAY,GAAG,cAAO,CAAC,CAAC;IAE9B,IAAM,sBAAsB,GAAG,CAAC;QAC9B,IAAM,IAAI,GAA4B,EAAE,CAAC;QACzC,OAAO,UAAC,eAA4B,EAAE,cAA2B,EAAE,UAAuB;YACxF,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE;gBAC9B,IAAI,CAAC,UAAU,CAAC,MAAM,EAAE,CAAC,GAAG,IAAI,CAAC;gBACjC,OAAO,IAAI,CAAC;aACb;YACD,OAAO,KAAK,CAAC;QACf,CAAC,CAAC;IACJ,CAAC,CAAC,EAAE,CAAC;IAEL,iBAAiB,CAAC,cAAc,GAAG,SAAS,CAAC,cAAc,IAAI,sBAAsB,CAAC;IACtF,iBAAiB,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,IAAI,YAAY,CAAC;IACtE,iBAAiB,CAAC,WAAW,GAAG,SAAS,CAAC,WAAW,IAAI,YAAY,CAAC;IAEtE,OAAO,iBAAiB,CAAC;AAC3B,CAAC;AAED;;;;;GAKG;AACH,SAAS,yBAAyB,CAChC,KAAY,EACZ,aAA0B,EAC1B,cAAkC,EAClC,SAAoB;IAEpB,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,aAAa,EAAE,cAAc,CAAC,EAAE;QACzD,OAAO;KACR;IAED,KAAK,CAAC,YAAY,CAAC,aAAa,CAAC,CAAC,OAAO,CAAC,UAAC,UAAuB;QAChE,IAAI,SAAS,CAAC,cAAc,CAAC,cAAc,EAAE,aAAa,EAAE,UAAU,CAAC,EAAE;YACvE,yBAAyB,CAAC,KAAK,EAAE,UAAU,EAAE,aAAa,EAAE,SAAS,CAAC,CAAC;SACxE;IACH,CAAC,CAAC,CAAC;IAEH,SAAS,CAAC,WAAW,CAAC,aAAa,EAAE,cAAc,CAAC,CAAC;AACvD,CAAC;AAgBD,SAAgB,gBAAgB,CAC9B,KAAY,EACZ,WAAwB,EACxB,SAAoB;IAEpB,IAAM,cAAc,GAAG,IAAI,CAAC;IAC5B,yBAAyB,CAAC,KAAK,EAAE,WAAW,EAAE,cAAc,EAAE,aAAa,CAAC,SAAS,CAAC,CAAC,CAAC;AAC1F,CAAC;AAPD,4CAOC"}