graph-typed 1.19.3

package/dist/undirected-graph.d.ts

@@ -0,0 +1,127 @@
+import { AbstractEdge, AbstractGraph, AbstractVertex } from 'data-structure-typed';
+import type { VertexId } from 'data-structure-typed';
+import { IUNDirectedGraph } from 'data-structure-typed';
+export declare class UndirectedVertex<T = number> extends AbstractVertex<T> {
+    /**
+     * The constructor function initializes a vertex with an optional value.
+     * @param {VertexId} id - The `id` parameter is of type `VertexId` and represents the identifier of the vertex. It is
+     * used to uniquely identify the vertex within a graph or network.
+     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to initialize the value of the
+     * vertex. If no value is provided, the vertex will be initialized with a default value.
+     */
+    constructor(id: VertexId, val?: T);
+}
+export declare class UndirectedEdge<T = number> extends AbstractEdge<T> {
+    /**
+     * The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional
+     * value.
+     * @param {VertexId} v1 - The first vertex ID of the edge.
+     * @param {VertexId} v2 - The parameter `v2` is a `VertexId`, which represents the identifier of the second vertex in a
+     * graph edge.
+     * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge.
+     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to store a value associated
+     * with the edge.
+     */
+    constructor(v1: VertexId, v2: VertexId, weight?: number, val?: T);
+    private _vertices;
+    get vertices(): [VertexId, VertexId];
+    set vertices(v: [VertexId, VertexId]);
+}
+export declare class UndirectedGraph<V extends UndirectedVertex<any> = UndirectedVertex, E extends UndirectedEdge<any> = UndirectedEdge> extends AbstractGraph<V, E> implements IUNDirectedGraph<V, E> {
+    /**
+     * The constructor initializes a new Map object to store edges.
+     */
+    constructor();
+    protected _edges: Map<V, E[]>;
+    get edges(): Map<V, E[]>;
+    /**
+     * The function creates a new vertex with an optional value and returns it.
+     * @param {VertexId} id - The `id` parameter is the unique identifier for the vertex. It is used to distinguish one
+     * vertex from another in the graph.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the vertex. If a value is provided,
+     * it will be used as the value of the vertex. If no value is provided, the `id` parameter will be used as the value of
+     * the vertex.
+     * @returns The method is returning a new instance of the `UndirectedVertex` class, casted as type `V`.
+     */
+    createVertex(id: VertexId, val?: V['val']): V;
+    /**
+     * The function creates an undirected edge between two vertices with an optional weight and value.
+     * @param {VertexId} v1 - The parameter `v1` represents the first vertex of the edge.
+     * @param {VertexId} v2 - The parameter `v2` represents the second vertex of the edge.
+     * @param {number} [weight] - The `weight` parameter is an optional number that represents the weight of the edge. If
+     * no weight is provided, it defaults to 1.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the edge. It can be of any type and
+     * is used to store additional information or data associated with the edge.
+     * @returns a new instance of the `UndirectedEdge` class, which is casted as type `E`.
+     */
+    createEdge(v1: VertexId, v2: VertexId, weight?: number, val?: E['val']): E;
+    /**
+     * The function `getEdge` returns the first edge that connects two vertices, or null if no such edge exists.
+     * @param {V | null | VertexId} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `V` (vertex
+     * object), `null`, or `VertexId` (a string or number representing the ID of a vertex).
+     * @param {V | null | VertexId} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `V` (vertex
+     * object), `null`, or `VertexId` (vertex ID).
+     * @returns an edge (E) or null.
+     */
+    getEdge(v1: V | null | VertexId, v2: V | null | VertexId): E | null;
+    /**
+     * The function removes an edge between two vertices in a graph and returns the removed edge.
+     * @param {V | VertexId} v1 - The parameter `v1` represents either a vertex object (`V`) or a vertex ID (`VertexId`).
+     * @param {V | VertexId} v2 - V | VertexId - This parameter can be either a vertex object (V) or a vertex ID
+     * (VertexId). It represents the second vertex of the edge that needs to be removed.
+     * @returns the removed edge (E) if it exists, or null if either of the vertices (V) does not exist.
+     */
+    removeEdgeBetween(v1: V | VertexId, v2: V | VertexId): E | null;
+    /**
+     * The removeEdge function removes an edge between two vertices in a graph.
+     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
+     * @returns The method is returning either the removed edge (of type E) or null if the edge was not found.
+     */
+    removeEdge(edge: E): E | null;
+    /**
+     * The function `degreeOf` returns the degree of a vertex in a graph, which is the number of edges connected to that
+     * vertex.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
+     * @returns The function `degreeOf` returns the degree of a vertex in a graph. The degree of a vertex is the number of
+     * edges connected to that vertex.
+     */
+    degreeOf(vertexOrId: VertexId | V): number;
+    /**
+     * The function returns the edges of a given vertex or vertex ID.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`. A `VertexId` is a
+     * unique identifier for a vertex in a graph, while `V` represents the type of the vertex.
+     * @returns an array of edges.
+     */
+    edgesOf(vertexOrId: VertexId | V): E[];
+    /**
+     * The function "edgeSet" returns an array of unique edges from a set of edges.
+     * @returns The method `edgeSet()` returns an array of type `E[]`.
+     */
+    edgeSet(): E[];
+    /**
+     * The function "getNeighbors" returns an array of neighboring vertices for a given vertex or vertex ID.
+     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a vertex object (`V`) or a vertex ID
+     * (`VertexId`).
+     * @returns an array of vertices (V[]).
+     */
+    getNeighbors(vertexOrId: V | VertexId): V[];
+    /**
+     * The function "getEndsOfEdge" returns the vertices at the ends of an edge if the edge exists in the graph, otherwise
+     * it returns null.
+     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
+     * @returns The function `getEndsOfEdge` returns an array containing two vertices `[V, V]` if the edge exists in the
+     * graph. If the edge does not exist, it returns `null`.
+     */
+    getEndsOfEdge(edge: E): [V, V] | null;
+    /**
+     * The function adds an edge to the graph by updating the adjacency list with the vertices of the edge.
+     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
+     * @returns a boolean value.
+     */
+    protected _addEdgeOnly(edge: E): boolean;
+    /**
+     * The function sets the edges of a graph.
+     * @param v - A map where the keys are of type V and the values are arrays of type E.
+     */
+    protected _setEdges(v: Map<V, E[]>): void;
+}

package/dist/undirected-graph.js

@@ -0,0 +1,341 @@
+"use strict";
+var __extends = (this && this.__extends) || (function () {
+    var extendStatics = function (d, b) {
+        extendStatics = Object.setPrototypeOf ||
+            ({ __proto__: [] } instanceof Array && function (d, b) { d.__proto__ = b; }) ||
+            function (d, b) { for (var p in b) if (Object.prototype.hasOwnProperty.call(b, p)) d[p] = b[p]; };
+        return extendStatics(d, b);
+    };
+    return function (d, b) {
+        if (typeof b !== "function" && b !== null)
+            throw new TypeError("Class extends value " + String(b) + " is not a constructor or null");
+        extendStatics(d, b);
+        function __() { this.constructor = d; }
+        d.prototype = b === null ? Object.create(b) : (__.prototype = b.prototype, new __());
+    };
+})();
+var __read = (this && this.__read) || function (o, n) {
+    var m = typeof Symbol === "function" && o[Symbol.iterator];
+    if (!m) return o;
+    var i = m.call(o), r, ar = [], e;
+    try {
+        while ((n === void 0 || n-- > 0) && !(r = i.next()).done) ar.push(r.value);
+    }
+    catch (error) { e = { error: error }; }
+    finally {
+        try {
+            if (r && !r.done && (m = i["return"])) m.call(i);
+        }
+        finally { if (e) throw e.error; }
+    }
+    return ar;
+};
+var __spreadArray = (this && this.__spreadArray) || function (to, from, pack) {
+    if (pack || arguments.length === 2) for (var i = 0, l = from.length, ar; i < l; i++) {
+        if (ar || !(i in from)) {
+            if (!ar) ar = Array.prototype.slice.call(from, 0, i);
+            ar[i] = from[i];
+        }
+    }
+    return to.concat(ar || Array.prototype.slice.call(from));
+};
+var __values = (this && this.__values) || function(o) {
+    var s = typeof Symbol === "function" && Symbol.iterator, m = s && o[s], i = 0;
+    if (m) return m.call(o);
+    if (o && typeof o.length === "number") return {
+        next: function () {
+            if (o && i >= o.length) o = void 0;
+            return { value: o && o[i++], done: !o };
+        }
+    };
+    throw new TypeError(s ? "Object is not iterable." : "Symbol.iterator is not defined.");
+};
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.UndirectedGraph = exports.UndirectedEdge = exports.UndirectedVertex = void 0;
+/**
+ * data-structure-typed
+ *
+ * @author Tyler Zeng
+ * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
+ * @license MIT License
+ */
+var data_structure_typed_1 = require("data-structure-typed");
+var data_structure_typed_2 = require("data-structure-typed");
+var UndirectedVertex = /** @class */ (function (_super) {
+    __extends(UndirectedVertex, _super);
+    /**
+     * The constructor function initializes a vertex with an optional value.
+     * @param {VertexId} id - The `id` parameter is of type `VertexId` and represents the identifier of the vertex. It is
+     * used to uniquely identify the vertex within a graph or network.
+     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to initialize the value of the
+     * vertex. If no value is provided, the vertex will be initialized with a default value.
+     */
+    function UndirectedVertex(id, val) {
+        return _super.call(this, id, val) || this;
+    }
+    return UndirectedVertex;
+}(data_structure_typed_2.AbstractVertex));
+exports.UndirectedVertex = UndirectedVertex;
+var UndirectedEdge = /** @class */ (function (_super) {
+    __extends(UndirectedEdge, _super);
+    /**
+     * The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional
+     * value.
+     * @param {VertexId} v1 - The first vertex ID of the edge.
+     * @param {VertexId} v2 - The parameter `v2` is a `VertexId`, which represents the identifier of the second vertex in a
+     * graph edge.
+     * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge.
+     * @param {T} [val] - The "val" parameter is an optional parameter of type T. It is used to store a value associated
+     * with the edge.
+     */
+    function UndirectedEdge(v1, v2, weight, val) {
+        var _this = _super.call(this, weight, val) || this;
+        _this._vertices = [v1, v2];
+        return _this;
+    }
+    Object.defineProperty(UndirectedEdge.prototype, "vertices", {
+        get: function () {
+            return this._vertices;
+        },
+        set: function (v) {
+            this._vertices = v;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    return UndirectedEdge;
+}(data_structure_typed_2.AbstractEdge));
+exports.UndirectedEdge = UndirectedEdge;
+var UndirectedGraph = /** @class */ (function (_super) {
+    __extends(UndirectedGraph, _super);
+    /**
+     * The constructor initializes a new Map object to store edges.
+     */
+    function UndirectedGraph() {
+        var _this = _super.call(this) || this;
+        _this._edges = new Map();
+        return _this;
+    }
+    Object.defineProperty(UndirectedGraph.prototype, "edges", {
+        get: function () {
+            return this._edges;
+        },
+        enumerable: false,
+        configurable: true
+    });
+    /**
+     * The function creates a new vertex with an optional value and returns it.
+     * @param {VertexId} id - The `id` parameter is the unique identifier for the vertex. It is used to distinguish one
+     * vertex from another in the graph.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the vertex. If a value is provided,
+     * it will be used as the value of the vertex. If no value is provided, the `id` parameter will be used as the value of
+     * the vertex.
+     * @returns The method is returning a new instance of the `UndirectedVertex` class, casted as type `V`.
+     */
+    UndirectedGraph.prototype.createVertex = function (id, val) {
+        return new UndirectedVertex(id, val !== null && val !== void 0 ? val : id);
+    };
+    /**
+     * The function creates an undirected edge between two vertices with an optional weight and value.
+     * @param {VertexId} v1 - The parameter `v1` represents the first vertex of the edge.
+     * @param {VertexId} v2 - The parameter `v2` represents the second vertex of the edge.
+     * @param {number} [weight] - The `weight` parameter is an optional number that represents the weight of the edge. If
+     * no weight is provided, it defaults to 1.
+     * @param [val] - The `val` parameter is an optional value that can be assigned to the edge. It can be of any type and
+     * is used to store additional information or data associated with the edge.
+     * @returns a new instance of the `UndirectedEdge` class, which is casted as type `E`.
+     */
+    UndirectedGraph.prototype.createEdge = function (v1, v2, weight, val) {
+        return new UndirectedEdge(v1, v2, weight !== null && weight !== void 0 ? weight : 1, val);
+    };
+    /**
+     * The function `getEdge` returns the first edge that connects two vertices, or null if no such edge exists.
+     * @param {V | null | VertexId} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `V` (vertex
+     * object), `null`, or `VertexId` (a string or number representing the ID of a vertex).
+     * @param {V | null | VertexId} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `V` (vertex
+     * object), `null`, or `VertexId` (vertex ID).
+     * @returns an edge (E) or null.
+     */
+    UndirectedGraph.prototype.getEdge = function (v1, v2) {
+        var _a;
+        var edges = [];
+        if (v1 !== null && v2 !== null) {
+            var vertex1 = this._getVertex(v1);
+            var vertex2_1 = this._getVertex(v2);
+            if (vertex1 && vertex2_1) {
+                edges = (_a = this._edges.get(vertex1)) === null || _a === void 0 ? void 0 : _a.filter(function (e) { return e.vertices.includes(vertex2_1.id); });
+            }
+        }
+        return edges ? edges[0] || null : null;
+    };
+    /**
+     * The function removes an edge between two vertices in a graph and returns the removed edge.
+     * @param {V | VertexId} v1 - The parameter `v1` represents either a vertex object (`V`) or a vertex ID (`VertexId`).
+     * @param {V | VertexId} v2 - V | VertexId - This parameter can be either a vertex object (V) or a vertex ID
+     * (VertexId). It represents the second vertex of the edge that needs to be removed.
+     * @returns the removed edge (E) if it exists, or null if either of the vertices (V) does not exist.
+     */
+    UndirectedGraph.prototype.removeEdgeBetween = function (v1, v2) {
+        var vertex1 = this._getVertex(v1);
+        var vertex2 = this._getVertex(v2);
+        if (!vertex1 || !vertex2) {
+            return null;
+        }
+        var v1Edges = this._edges.get(vertex1);
+        var removed = null;
+        if (v1Edges) {
+            removed = (0, data_structure_typed_1.arrayRemove)(v1Edges, function (e) { return e.vertices.includes(vertex2.id); })[0] || null;
+        }
+        var v2Edges = this._edges.get(vertex2);
+        if (v2Edges) {
+            (0, data_structure_typed_1.arrayRemove)(v2Edges, function (e) { return e.vertices.includes(vertex1.id); });
+        }
+        return removed;
+    };
+    /**
+     * The removeEdge function removes an edge between two vertices in a graph.
+     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
+     * @returns The method is returning either the removed edge (of type E) or null if the edge was not found.
+     */
+    UndirectedGraph.prototype.removeEdge = function (edge) {
+        return this.removeEdgeBetween(edge.vertices[0], edge.vertices[1]);
+    };
+    /**
+     * The function `degreeOf` returns the degree of a vertex in a graph, which is the number of edges connected to that
+     * vertex.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`.
+     * @returns The function `degreeOf` returns the degree of a vertex in a graph. The degree of a vertex is the number of
+     * edges connected to that vertex.
+     */
+    UndirectedGraph.prototype.degreeOf = function (vertexOrId) {
+        var _a;
+        var vertex = this._getVertex(vertexOrId);
+        if (vertex) {
+            return ((_a = this._edges.get(vertex)) === null || _a === void 0 ? void 0 : _a.length) || 0;
+        }
+        else {
+            return 0;
+        }
+    };
+    /**
+     * The function returns the edges of a given vertex or vertex ID.
+     * @param {VertexId | V} vertexOrId - The parameter `vertexOrId` can be either a `VertexId` or a `V`. A `VertexId` is a
+     * unique identifier for a vertex in a graph, while `V` represents the type of the vertex.
+     * @returns an array of edges.
+     */
+    UndirectedGraph.prototype.edgesOf = function (vertexOrId) {
+        var vertex = this._getVertex(vertexOrId);
+        if (vertex) {
+            return this._edges.get(vertex) || [];
+        }
+        else {
+            return [];
+        }
+    };
+    /**
+     * The function "edgeSet" returns an array of unique edges from a set of edges.
+     * @returns The method `edgeSet()` returns an array of type `E[]`.
+     */
+    UndirectedGraph.prototype.edgeSet = function () {
+        var edgeSet = new Set();
+        this._edges.forEach(function (edges) {
+            edges.forEach(function (edge) {
+                edgeSet.add(edge);
+            });
+        });
+        return __spreadArray([], __read(edgeSet), false);
+    };
+    /**
+     * The function "getNeighbors" returns an array of neighboring vertices for a given vertex or vertex ID.
+     * @param {V | VertexId} vertexOrId - The parameter `vertexOrId` can be either a vertex object (`V`) or a vertex ID
+     * (`VertexId`).
+     * @returns an array of vertices (V[]).
+     */
+    UndirectedGraph.prototype.getNeighbors = function (vertexOrId) {
+        var e_1, _a;
+        var neighbors = [];
+        var vertex = this._getVertex(vertexOrId);
+        if (vertex) {
+            var neighborEdges = this.edgesOf(vertex);
+            try {
+                for (var neighborEdges_1 = __values(neighborEdges), neighborEdges_1_1 = neighborEdges_1.next(); !neighborEdges_1_1.done; neighborEdges_1_1 = neighborEdges_1.next()) {
+                    var edge = neighborEdges_1_1.value;
+                    var neighbor = this._getVertex(edge.vertices.filter(function (e) { return e !== vertex.id; })[0]);
+                    if (neighbor) {
+                        neighbors.push(neighbor);
+                    }
+                }
+            }
+            catch (e_1_1) { e_1 = { error: e_1_1 }; }
+            finally {
+                try {
+                    if (neighborEdges_1_1 && !neighborEdges_1_1.done && (_a = neighborEdges_1.return)) _a.call(neighborEdges_1);
+                }
+                finally { if (e_1) throw e_1.error; }
+            }
+        }
+        return neighbors;
+    };
+    /**
+     * The function "getEndsOfEdge" returns the vertices at the ends of an edge if the edge exists in the graph, otherwise
+     * it returns null.
+     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
+     * @returns The function `getEndsOfEdge` returns an array containing two vertices `[V, V]` if the edge exists in the
+     * graph. If the edge does not exist, it returns `null`.
+     */
+    UndirectedGraph.prototype.getEndsOfEdge = function (edge) {
+        if (!this.hasEdge(edge.vertices[0], edge.vertices[1])) {
+            return null;
+        }
+        var v1 = this._getVertex(edge.vertices[0]);
+        var v2 = this._getVertex(edge.vertices[1]);
+        if (v1 && v2) {
+            return [v1, v2];
+        }
+        else {
+            return null;
+        }
+    };
+    /**
+     * The function adds an edge to the graph by updating the adjacency list with the vertices of the edge.
+     * @param {E} edge - The parameter "edge" is of type E, which represents an edge in a graph.
+     * @returns a boolean value.
+     */
+    UndirectedGraph.prototype._addEdgeOnly = function (edge) {
+        var e_2, _a;
+        try {
+            for (var _b = __values(edge.vertices), _c = _b.next(); !_c.done; _c = _b.next()) {
+                var end = _c.value;
+                var endVertex = this._getVertex(end);
+                if (endVertex === null)
+                    return false;
+                if (endVertex) {
+                    var edges = this._edges.get(endVertex);
+                    if (edges) {
+                        edges.push(edge);
+                    }
+                    else {
+                        this._edges.set(endVertex, [edge]);
+                    }
+                }
+            }
+        }
+        catch (e_2_1) { e_2 = { error: e_2_1 }; }
+        finally {
+            try {
+                if (_c && !_c.done && (_a = _b.return)) _a.call(_b);
+            }
+            finally { if (e_2) throw e_2.error; }
+        }
+        return true;
+    };
+    /**
+     * The function sets the edges of a graph.
+     * @param v - A map where the keys are of type V and the values are arrays of type E.
+     */
+    UndirectedGraph.prototype._setEdges = function (v) {
+        this._edges = v;
+    };
+    return UndirectedGraph;
+}(data_structure_typed_2.AbstractGraph));
+exports.UndirectedGraph = UndirectedGraph;

package/jest.config.js

@@ -0,0 +1,5 @@
+module.exports = {
+    preset: 'ts-jest',
+    testEnvironment: 'node',
+    testMatch: ['<rootDir>/tests/**/*.test.ts'],
+};

package/package.json

@@ -0,0 +1,68 @@
+{
+  "name": "graph-typed",
+  "version": "1.19.3",
+  "description": "Graph. Javascript & Typescript Data Structure.",
+  "main": "dist/index.js",
+  "scripts": {
+    "build": "rm -rf dist && npx tsc",
+    "test": "jest",
+    "build:docs": "typedoc --out docs ./src",
+    "deps:check": "dependency-cruiser src",
+    "build:publish": "npm run build && npm run build:docs && npm publish"
+  },
+  "repository": {
+    "type": "git",
+    "url": "git+https://github.com/zrwusa/data-structure-typed"
+  },
+  "keywords": [
+    "Graph",
+    "Vertex",
+    "Node",
+    "Edge",
+    "Graph theory",
+    "Graph structure",
+    "Undirected",
+    "Directed",
+    "Weighted",
+    "Unweighted",
+    "Adjacency",
+    "Connectivity",
+    "Path",
+    "Cycle",
+    "Traversal",
+    "Depth-first search (DFS)",
+    "Breadth-first search (BFS)",
+    "Graph algorithms",
+    "Graph representation",
+    "Connectivity matrix",
+    "Adjacency list",
+    "Adjacency matrix",
+    "Graph theory",
+    "Network",
+    "Node degree",
+    "Eulerian path",
+    "Hamiltonian cycle",
+    "Sparse graph",
+    "Dense graph"
+  ],
+  "author": "Tyler Zeng zrwusa@gmail.com",
+  "license": "MIT",
+  "bugs": {
+    "url": "https://github.com/zrwusa/data-structure-typed/issues"
+  },
+  "homepage": "https://github.com/zrwusa/data-structure-typed#readme",
+  "types": "dist/index.d.ts",
+  "devDependencies": {
+    "@types/jest": "^29.5.3",
+    "@types/node": "^20.4.9",
+    "dependency-cruiser": "^13.1.2",
+    "jest": "^29.6.2",
+    "ts-jest": "^29.1.1",
+    "typedoc": "^0.24.8",
+    "typescript": "^4.9.5"
+  },
+  "dependencies": {
+    "data-structure-typed": "^1.19.3",
+    "zod": "^3.22.2"
+  }
+}

package/tsconfig.json

@@ -0,0 +1,37 @@
+{
+  "compilerOptions": {
+    "declaration": true,
+    "outDir": "./dist",
+    "module": "commonjs",
+    "target": "es5",
+    "lib": [
+      "esnext",
+    ],
+    "strict": true,
+    "esModuleInterop": true,
+    "moduleResolution": "node",
+    "declarationDir": "./dist",
+    "skipLibCheck": true,
+    "downlevelIteration": true,
+    "experimentalDecorators": true,
+    //    "allowJs": true,
+    //    "allowSyntheticDefaultImports": true,
+    //    "forceConsistentCasingInFileNames": true,
+    //    "noFallthroughCasesInSwitch": true,
+    //    "resolveJsonModule": true,
+    //    "isolatedModules": true,
+    //    "noEmit": true,
+    "typeRoots": [
+      "node_modules/@types"
+    ]
+  },
+
+  "include": [
+    "src",
+  ],
+  "exclude": [
+//    "node_modules/data-structure-typed",
+    "node_modules",
+    "dist"
+  ]
+}