data-structure-typed 2.0.5 → 2.1.1

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

@@ -1,609 +0,0 @@
-import { AbstractEdge, AbstractGraph, AbstractVertex } from './abstract-graph';
-import { arrayRemove } from '../../utils';
-export class DirectedVertex extends AbstractVertex {
-    /**
-     * The constructor function initializes a vertex with an optional value.
-     * @param {VertexKey} key - The `key` parameter is of type `VertexKey` and represents the identifier of the vertex. It is
-     * used to uniquely identify the vertex within a graph or data structure.
-     * @param {V} [value] - The "value" parameter is an optional parameter of type V. 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(key, value) {
-        super(key, value);
-    }
-}
-export class DirectedEdge extends AbstractEdge {
-    src;
-    dest;
-    /**
-     * The constructor function initializes the source and destination vertexMap of an edge, along with an optional weight
-     * and value.
-     * @param {VertexKey} src - The `src` parameter is the source vertex ID. It represents the starting point of an edge in
-     * a graph.
-     * @param {VertexKey} dest - The `dest` parameter represents the destination vertex of an edge. It is of type
-     * `VertexKey`, which is likely a unique identifier for a vertex in a graph.
-     * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge.
-     * @param {E} [value] - The `value` parameter is an optional parameter of type `E`. It represents the value associated with
-     * the edge.
-     */
-    constructor(src, dest, weight, value) {
-        super(weight, value);
-        this.src = src;
-        this.dest = dest;
-    }
-}
-/**
- *
- */
-export class DirectedGraph extends AbstractGraph {
-    /**
-     * The constructor function initializes an instance of a class.
-     */
-    constructor() {
-        super();
-    }
-    _outEdgeMap = new Map();
-    get outEdgeMap() {
-        return this._outEdgeMap;
-    }
-    set outEdgeMap(v) {
-        this._outEdgeMap = v;
-    }
-    _inEdgeMap = new Map();
-    get inEdgeMap() {
-        return this._inEdgeMap;
-    }
-    set inEdgeMap(v) {
-        this._inEdgeMap = v;
-    }
-    /**
-     * The function creates a new vertex with an optional value and returns it.
-     * @param {VertexKey} key - The `key` parameter is the unique identifier for the vertex. It is of type `VertexKey`, which
-     * could be a number or a string depending on how you want to identify your vertexMap.
-     * @param [value] - The 'value' parameter is an optional value that can be assigned to the vertex. If a value is provided,
-     * it will be assigned to the 'value' property of the vertex. If no value is provided, the 'value' property will be
-     * assigned the same value as the 'key' parameter
-     * @returns a new instance of a DirectedVertex object, casted as type VO.
-     */
-    createVertex(key, value) {
-        return new DirectedVertex(key, value);
-    }
-    /**
-     * The function creates a directed edge between two vertexMap with an optional weight and value.
-     * @param {VertexKey} src - The source vertex ID of the edge. It represents the starting point of the edge.
-     * @param {VertexKey} dest - The `dest` parameter is the identifier of the destination vertex for the edge.
-     * @param {number} [weight] - The weight parameter is an optional number that represents the weight of the edge. If no
-     * weight is provided, it defaults to 1.
-     * @param [value] - The 'value' parameter is an optional value that can be assigned to the edge. It can be of any type and
-     * is used to store additional information or data associated with the edge.
-     * @returns a new instance of a DirectedEdge object, casted as type EO.
-     */
-    createEdge(src, dest, weight, value) {
-        return new DirectedEdge(src, dest, weight ?? 1, value);
-    }
-    /**
-     * Time Complexity: O(|V|) where |V| is the number of vertexMap
-     * Space Complexity: O(1)
-     *
-     * The `getEdge` function retrieves an edge between two vertexMap based on their source and destination IDs.
-     * @param {VO | VertexKey | undefined} srcOrKey - The source vertex or its ID. It can be either a vertex object or a vertex ID.
-     * @param {VO | VertexKey | undefined} destOrKey - The `destOrKey` parameter in the `getEdge` function represents the
-     * destination vertex of the edge. It can be either a vertex object (`VO`), a vertex ID (`VertexKey`), or `undefined` if the
-     * destination is not specified.
-     * @returns the first edge found between the source and destination vertexMap, or undefined if no such edge is found.
-     */
-    getEdge(srcOrKey, destOrKey) {
-        let edgeMap = [];
-        if (srcOrKey !== undefined && destOrKey !== undefined) {
-            const src = this._getVertex(srcOrKey);
-            const dest = this._getVertex(destOrKey);
-            if (src && dest) {
-                const srcOutEdges = this._outEdgeMap.get(src);
-                if (srcOutEdges) {
-                    edgeMap = srcOutEdges.filter(edge => edge.dest === dest.key);
-                }
-            }
-        }
-        return edgeMap[0] || undefined;
-    }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     *
-     * The function removes an edge between two vertexMap in a graph and returns the removed edge.
-     * @param {VO | VertexKey} srcOrKey - The source vertex or its ID.
-     * @param {VO | VertexKey} destOrKey - The `destOrKey` parameter represents the destination vertex or its ID.
-     * @returns the removed edge (EO) if it exists, or undefined if either the source or destination vertex does not exist.
-     */
-    deleteEdgeSrcToDest(srcOrKey, destOrKey) {
-        const src = this._getVertex(srcOrKey);
-        const dest = this._getVertex(destOrKey);
-        let removed = undefined;
-        if (!src || !dest) {
-            return undefined;
-        }
-        const srcOutEdges = this._outEdgeMap.get(src);
-        if (srcOutEdges) {
-            arrayRemove(srcOutEdges, (edge) => edge.dest === dest.key);
-        }
-        const destInEdges = this._inEdgeMap.get(dest);
-        if (destInEdges) {
-            removed = arrayRemove(destInEdges, (edge) => edge.src === src.key)[0] || undefined;
-        }
-        return removed;
-    }
-    /**
-     * Time Complexity: O(E) where E is the number of edgeMap
-     * Space Complexity: O(1)
-     *
-     * The `deleteEdge` function removes an edge from a graph and returns the removed edge.
-     * @param {EO | VertexKey} edgeOrSrcVertexKey - The `edge` parameter can be either an `EO` object (edge object) or
-     * a `VertexKey` (key of a vertex).
-     * @param {VertexKey} [destVertexKey] - The `destVertexKey` parameter is an optional parameter that
-     * represents the key of the destination vertex of the edge. It is used to specify the destination
-     * vertex when the `edge` parameter is a vertex key. If `destVertexKey` is not provided, the function
-     * assumes that the `edge`
-     * @returns the removed edge (EO) or undefined if no edge was removed.
-     */
-    deleteEdge(edgeOrSrcVertexKey, destVertexKey) {
-        let removed = undefined;
-        let src, dest;
-        if (this.isVertexKey(edgeOrSrcVertexKey)) {
-            if (this.isVertexKey(destVertexKey)) {
-                src = this._getVertex(edgeOrSrcVertexKey);
-                dest = this._getVertex(destVertexKey);
-            }
-            else {
-                return;
-            }
-        }
-        else {
-            src = this._getVertex(edgeOrSrcVertexKey.src);
-            dest = this._getVertex(edgeOrSrcVertexKey.dest);
-        }
-        if (src && dest) {
-            const srcOutEdges = this._outEdgeMap.get(src);
-            if (srcOutEdges && srcOutEdges.length > 0) {
-                arrayRemove(srcOutEdges, (edge) => edge.src === src.key && edge.dest === dest?.key);
-            }
-            const destInEdges = this._inEdgeMap.get(dest);
-            if (destInEdges && destInEdges.length > 0) {
-                removed = arrayRemove(destInEdges, (edge) => edge.src === src.key && edge.dest === dest.key)[0];
-            }
-        }
-        return removed;
-    }
-    /**
-     * Time Complexity: O(1) - Constant time for Map operations.
-     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
-     *
-     * The `deleteVertex` function removes a vertex from a graph by its ID or by the vertex object itself.
-     * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
-     * (`VertexKey`).
-     * @returns The method is returning a boolean value.
-     */
-    deleteVertex(vertexOrKey) {
-        let vertexKey;
-        let vertex;
-        if (this.isVertexKey(vertexOrKey)) {
-            vertex = this.getVertex(vertexOrKey);
-            vertexKey = vertexOrKey;
-        }
-        else {
-            vertex = vertexOrKey;
-            vertexKey = this._getVertexKey(vertexOrKey);
-        }
-        if (vertex) {
-            const neighbors = this.getNeighbors(vertex);
-            for (const neighbor of neighbors) {
-                // this._inEdgeMap.delete(neighbor);
-                this.deleteEdgeSrcToDest(vertex, neighbor);
-            }
-            this._outEdgeMap.delete(vertex);
-            this._inEdgeMap.delete(vertex);
-        }
-        return this._vertexMap.delete(vertexKey);
-    }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     *
-     * The function removes edgeMap between two vertexMap and returns the removed edgeMap.
-     * @param {VertexKey | VO} v1 - The parameter `v1` can be either a `VertexKey` or a `VO`. A `VertexKey` represents the
-     * unique identifier of a vertex in a graph, while `VO` represents the actual vertex object.
-     * @param {VertexKey | VO} v2 - The parameter `v2` represents either a `VertexKey` or a `VO` object. It is used to specify
-     * the second vertex in the edge that needs to be removed.
-     * @returns an array of removed edgeMap (EO[]).
-     */
-    deleteEdgesBetween(v1, v2) {
-        const removed = [];
-        if (v1 && v2) {
-            const v1ToV2 = this.deleteEdgeSrcToDest(v1, v2);
-            const v2ToV1 = this.deleteEdgeSrcToDest(v2, v1);
-            if (v1ToV2)
-                removed.push(v1ToV2);
-            if (v2ToV1)
-                removed.push(v2ToV1);
-        }
-        return removed;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function `incomingEdgesOf` returns an array of incoming edgeMap for a given vertex or vertex ID.
-     * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
-     * (`VertexKey`).
-     * @returns The method `incomingEdgesOf` returns an array of edgeMap (`EO[]`).
-     */
-    incomingEdgesOf(vertexOrKey) {
-        const target = this._getVertex(vertexOrKey);
-        if (target) {
-            return this.inEdgeMap.get(target) || [];
-        }
-        return [];
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function `outgoingEdgesOf` returns an array of outgoing edgeMap from a given vertex or vertex ID.
-     * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can accept either a vertex object (`VO`) or a vertex ID
-     * (`VertexKey`).
-     * @returns The method `outgoingEdgesOf` returns an array of edgeMap (`EO[]`).
-     */
-    outgoingEdgesOf(vertexOrKey) {
-        const target = this._getVertex(vertexOrKey);
-        if (target) {
-            return this._outEdgeMap.get(target) || [];
-        }
-        return [];
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function "degreeOf" returns the total degree of a vertex, which is the sum of its out-degree and in-degree.
-     * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`.
-     * @returns The sum of the out-degree and in-degree of the specified vertex or vertex ID.
-     */
-    degreeOf(vertexOrKey) {
-        return this.outDegreeOf(vertexOrKey) + this.inDegreeOf(vertexOrKey);
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function "inDegreeOf" returns the number of incoming edgeMap for a given vertex.
-     * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`.
-     * @returns The number of incoming edgeMap of the specified vertex or vertex ID.
-     */
-    inDegreeOf(vertexOrKey) {
-        return this.incomingEdgesOf(vertexOrKey).length;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function `outDegreeOf` returns the number of outgoing edgeMap from a given vertex.
-     * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`.
-     * @returns The number of outgoing edgeMap from the specified vertex or vertex ID.
-     */
-    outDegreeOf(vertexOrKey) {
-        return this.outgoingEdgesOf(vertexOrKey).length;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function "edgesOf" returns an array of both outgoing and incoming edgeMap of a given vertex or vertex ID.
-     * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`.
-     * @returns The function `edgesOf` returns an array of edgeMap.
-     */
-    edgesOf(vertexOrKey) {
-        return [...this.outgoingEdgesOf(vertexOrKey), ...this.incomingEdgesOf(vertexOrKey)];
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function "getEdgeSrc" returns the source vertex of an edge, or undefined if the edge does not exist.
-     * @param {EO} e - The parameter "e" is of type EO, which represents an edge in a graph.
-     * @returns either a vertex object (VO) or undefined.
-     */
-    getEdgeSrc(e) {
-        return this._getVertex(e.src);
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function "getEdgeDest" returns the destination vertex of an edge.
-     * @param {EO} e - The parameter "e" is of type "EO", which represents an edge in a graph.
-     * @returns either a vertex object of type VO or undefined.
-     */
-    getEdgeDest(e) {
-        return this._getVertex(e.dest);
-    }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     *
-     * The function `getDestinations` returns an array of destination vertexMap connected to a given vertex.
-     * @param {VO | VertexKey | undefined} vertex - The `vertex` parameter represents the starting vertex from which we want to
-     * find the destinations. It can be either a `VO` object, a `VertexKey` value, or `undefined`.
-     * @returns an array of vertexMap (VO[]).
-     */
-    getDestinations(vertex) {
-        if (vertex === undefined) {
-            return [];
-        }
-        const destinations = [];
-        const outgoingEdges = this.outgoingEdgesOf(vertex);
-        for (const outEdge of outgoingEdges) {
-            const child = this.getEdgeDest(outEdge);
-            if (child) {
-                destinations.push(child);
-            }
-        }
-        return destinations;
-    }
-    /**
-     * Time Complexity: O(|V| + |E|) where |V| is the number of vertexMap and |E| is the number of edgeMap
-     * Space Complexity: O(|V|)
-     *
-     * The `topologicalSort` function performs a topological sort on a graph and returns an array of vertexMap or vertex IDs
-     * in the sorted order, or undefined if the graph contains a cycle.
-     * @param {'vertex' | 'key'} [propertyName] - The `propertyName` parameter is an optional parameter that specifies the
-     * property to use for sorting the vertexMap. It can have two possible values: 'vertex' or 'key'. If 'vertex' is
-     * specified, the vertexMap themselves will be used for sorting. If 'key' is specified, the ids of
-     * @returns an array of vertexMap or vertex IDs in topological order. If there is a cycle in the graph, it returns undefined.
-     */
-    topologicalSort(propertyName) {
-        propertyName = propertyName ?? 'key';
-        // When judging whether there is a cycle in the undirected graph, all nodes with degree of **<= 1** are enqueued
-        // When judging whether there is a cycle in the directed graph, all nodes with **in degree = 0** are enqueued
-        const statusMap = new Map();
-        for (const entry of this.vertexMap) {
-            statusMap.set(entry[1], 0);
-        }
-        let sorted = [];
-        let hasCycle = false;
-        const dfs = (cur) => {
-            statusMap.set(cur, 1);
-            const children = this.getDestinations(cur);
-            for (const child of children) {
-                const childStatus = statusMap.get(child);
-                if (childStatus === 0) {
-                    dfs(child);
-                }
-                else if (childStatus === 1) {
-                    hasCycle = true;
-                }
-            }
-            statusMap.set(cur, 2);
-            sorted.push(cur);
-        };
-        for (const entry of this.vertexMap) {
-            if (statusMap.get(entry[1]) === 0) {
-                dfs(entry[1]);
-            }
-        }
-        if (hasCycle)
-            return undefined;
-        if (propertyName === 'key')
-            sorted = sorted.map(vertex => (vertex instanceof DirectedVertex ? vertex.key : vertex));
-        return sorted.reverse();
-    }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(|E|)
-     *
-     * The `edgeSet` function returns an array of all the edgeMap in the graph.
-     * @returns The `edgeSet()` method returns an array of edgeMap (`EO[]`).
-     */
-    edgeSet() {
-        let edgeMap = [];
-        this._outEdgeMap.forEach(outEdges => {
-            edgeMap = [...edgeMap, ...outEdges];
-        });
-        return edgeMap;
-    }
-    /**
-     * Time Complexity: O(|E|) where |E| is the number of edgeMap
-     * Space Complexity: O(1)
-     *
-     * The function `getNeighbors` returns an array of neighboring vertexMap of a given vertex or vertex ID in a graph.
-     * @param {VO | VertexKey} vertexOrKey - The parameter `vertexOrKey` can be either a vertex object (`VO`) or a vertex ID
-     * (`VertexKey`).
-     * @returns an array of vertexMap (VO[]).
-     */
-    getNeighbors(vertexOrKey) {
-        const neighbors = [];
-        const vertex = this._getVertex(vertexOrKey);
-        if (vertex) {
-            const outEdges = this.outgoingEdgesOf(vertex);
-            for (const outEdge of outEdges) {
-                const neighbor = this._getVertex(outEdge.dest);
-                // TODO after no-non-undefined-assertion not ensure the logic
-                if (neighbor) {
-                    neighbors.push(neighbor);
-                }
-            }
-        }
-        return neighbors;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function "getEndsOfEdge" returns the source and destination vertexMap of an edge if it exists in the graph,
-     * otherwise it returns undefined.
-     * @param {EO} edge - The parameter `edge` is of type `EO`, which represents an edge in a graph.
-     * @returns The function `getEndsOfEdge` returns an array containing two vertexMap `[VO, VO]` if the edge exists in the
-     * graph. If the edge does not exist, it returns `undefined`.
-     */
-    getEndsOfEdge(edge) {
-        if (!this.hasEdge(edge.src, edge.dest)) {
-            return undefined;
-        }
-        const v1 = this._getVertex(edge.src);
-        const v2 = this._getVertex(edge.dest);
-        if (v1 && v2) {
-            return [v1, v2];
-        }
-        else {
-            return undefined;
-        }
-    }
-    /**
-     * The isEmpty function checks if the graph is empty.
-     *
-     * @return A boolean value
-     */
-    isEmpty() {
-        return this.vertexMap.size === 0 && this.inEdgeMap.size === 0 && this.outEdgeMap.size === 0;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The clear function resets the vertex map, in-edge map, and out-edge map.
-     */
-    clear() {
-        this._vertexMap = new Map();
-        this._inEdgeMap = new Map();
-        this._outEdgeMap = new Map();
-    }
-    /**
-     * The clone function creates a new DirectedGraph object with the same vertices and edges as the original.
-     *
-     * @return A new instance of the directedgraph class
-     */
-    clone() {
-        const cloned = new DirectedGraph();
-        cloned.vertexMap = new Map(this.vertexMap);
-        cloned.inEdgeMap = new Map(this.inEdgeMap);
-        cloned.outEdgeMap = new Map(this.outEdgeMap);
-        return cloned;
-    }
-    /**
-     *  Time Complexity: O(V + E)
-     *  Space Complexity: O(V)
-     *  Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
-     *  Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs.
-     *
-     * The function `tarjan` implements the Tarjan's algorithm to find strongly connected components in a
-     * graph.
-     * @returns The function `tarjan()` returns an object with three properties: `dfnMap`, `lowMap`, and
-     * `SCCs`.
-     */
-    tarjan() {
-        const dfnMap = new Map();
-        const lowMap = new Map();
-        const SCCs = new Map();
-        let time = 0;
-        const stack = [];
-        const inStack = new Set();
-        const dfs = (vertex) => {
-            dfnMap.set(vertex, time);
-            lowMap.set(vertex, time);
-            time++;
-            stack.push(vertex);
-            inStack.add(vertex);
-            const neighbors = this.getNeighbors(vertex);
-            for (const neighbor of neighbors) {
-                if (!dfnMap.has(neighbor)) {
-                    dfs(neighbor);
-                    lowMap.set(vertex, Math.min(lowMap.get(vertex), lowMap.get(neighbor)));
-                }
-                else if (inStack.has(neighbor)) {
-                    lowMap.set(vertex, Math.min(lowMap.get(vertex), dfnMap.get(neighbor)));
-                }
-            }
-            if (dfnMap.get(vertex) === lowMap.get(vertex)) {
-                const SCC = [];
-                let poppedVertex;
-                do {
-                    poppedVertex = stack.pop();
-                    inStack.delete(poppedVertex);
-                    SCC.push(poppedVertex);
-                } while (poppedVertex !== vertex);
-                SCCs.set(SCCs.size, SCC);
-            }
-        };
-        for (const vertex of this.vertexMap.values()) {
-            if (!dfnMap.has(vertex)) {
-                dfs(vertex);
-            }
-        }
-        return { dfnMap, lowMap, SCCs };
-    }
-    /**
-     * Time Complexity: O(V + E) - Depends on the implementation (Tarjan's algorithm).
-     * Space Complexity: O(V) - Depends on the implementation (Tarjan's algorithm).
-     *
-     * The function returns a map that associates each vertex object with its corresponding depth-first
-     * number.
-     * @returns A Map object with keys of type VO and values of type number.
-     */
-    getDFNMap() {
-        return this.tarjan().dfnMap;
-    }
-    /**
-     * The function returns a Map object that contains the low values of each vertex in a Tarjan
-     * algorithm.
-     * @returns The method `getLowMap()` is returning a `Map` object with keys of type `VO` and values of
-     * type `number`.
-     */
-    getLowMap() {
-        return this.tarjan().lowMap;
-    }
-    /**
-     * The function "getSCCs" returns a map of strongly connected components (SCCs) using the Tarjan
-     * algorithm.
-     * @returns a map where the keys are numbers and the values are arrays of VO objects.
-     */
-    getSCCs() {
-        return this.tarjan().SCCs;
-    }
-    /**
-     * Time Complexity: O(1)
-     * Space Complexity: O(1)
-     *
-     * The function `_addEdge` adds an edge to a graph if the source and destination vertexMap exist.
-     * @param {EO} edge - The parameter `edge` is of type `EO`, which represents an edge in a graph. It is the edge that
-     * needs to be added to the graph.
-     * @returns a boolean value. It returns true if the edge was successfully added to the graph, and false if either the
-     * source or destination vertex does not exist in the graph.
-     */
-    _addEdge(edge) {
-        if (!(this.hasVertex(edge.src) && this.hasVertex(edge.dest))) {
-            return false;
-        }
-        const srcVertex = this._getVertex(edge.src);
-        const destVertex = this._getVertex(edge.dest);
-        // TODO after no-non-undefined-assertion not ensure the logic
-        if (srcVertex && destVertex) {
-            const srcOutEdges = this._outEdgeMap.get(srcVertex);
-            if (srcOutEdges) {
-                srcOutEdges.push(edge);
-            }
-            else {
-                this._outEdgeMap.set(srcVertex, [edge]);
-            }
-            const destInEdges = this._inEdgeMap.get(destVertex);
-            if (destInEdges) {
-                destInEdges.push(edge);
-            }
-            else {
-                this._inEdgeMap.set(destVertex, [edge]);
-            }
-            return true;
-        }
-        else {
-            return false;
-        }
-    }
-}
-//# sourceMappingURL=directed-graph.js.map

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

@@ -1 +0,0 @@
-{"version":3,"file":"directed-graph.js","sourceRoot":"","sources":["../../../../src/data-structures/graph/directed-graph.ts"],"names":[],"mappings":"AAQA,OAAO,EAAE,YAAY,EAAE,aAAa,EAAE,cAAc,EAAE,MAAM,kBAAkB,CAAC;AAE/E,OAAO,EAAE,WAAW,EAAE,MAAM,aAAa,CAAC;AAE1C,MAAM,OAAO,cAAwB,SAAQ,cAAiB;IAC5D;;;;;;OAMG;IACH,YAAY,GAAc,EAAE,KAAS;QACnC,KAAK,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACpB,CAAC;CACF;AAED,MAAM,OAAO,YAAsB,SAAQ,YAAe;IACxD,GAAG,CAAY;IACf,IAAI,CAAY;IAEhB;;;;;;;;;;OAUG;IACH,YAAY,GAAc,EAAE,IAAe,EAAE,MAAe,EAAE,KAAS;QACrE,KAAK,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QACrB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC;IACnB,CAAC;CACF;AAED;;GAEG;AACH,MAAM,OAAO,aAMX,SAAQ,aAA2B;IAGnC;;OAEG;IACH;QACE,KAAK,EAAE,CAAC;IACV,CAAC;IAES,WAAW,GAAkB,IAAI,GAAG,EAAY,CAAC;IAE3D,IAAI,UAAU;QACZ,OAAO,IAAI,CAAC,WAAW,CAAC;IAC1B,CAAC;IAED,IAAI,UAAU,CAAC,CAAgB;QAC7B,IAAI,CAAC,WAAW,GAAG,CAAC,CAAC;IACvB,CAAC;IAES,UAAU,GAAkB,IAAI,GAAG,EAAY,CAAC;IAE1D,IAAI,SAAS;QACX,OAAO,IAAI,CAAC,UAAU,CAAC;IACzB,CAAC;IAED,IAAI,SAAS,CAAC,CAAgB;QAC5B,IAAI,CAAC,UAAU,GAAG,CAAC,CAAC;IACtB,CAAC;IAED;;;;;;;;OAQG;IACH,YAAY,CAAC,GAAc,EAAE,KAAS;QACpC,OAAO,IAAI,cAAc,CAAC,GAAG,EAAE,KAAK,CAAO,CAAC;IAC9C,CAAC;IAED;;;;;;;;;OASG;IACH,UAAU,CAAC,GAAc,EAAE,IAAe,EAAE,MAAe,EAAE,KAAS;QACpE,OAAO,IAAI,YAAY,CAAC,GAAG,EAAE,IAAI,EAAE,MAAM,IAAI,CAAC,EAAE,KAAK,CAAO,CAAC;IAC/D,CAAC;IAED;;;;;;;;;;OAUG;IACH,OAAO,CAAC,QAAoC,EAAE,SAAqC;QACjF,IAAI,OAAO,GAAS,EAAE,CAAC;QAEvB,IAAI,QAAQ,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,EAAE,CAAC;YACtD,MAAM,GAAG,GAAmB,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;YACtD,MAAM,IAAI,GAAmB,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;YAExD,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;gBAChB,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;gBAC9C,IAAI,WAAW,EAAE,CAAC;oBAChB,OAAO,GAAG,WAAW,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;gBAC/D,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;IACjC,CAAC;IAED;;;;;;;;OAQG;IACH,mBAAmB,CAAC,QAAwB,EAAE,SAAyB;QACrE,MAAM,GAAG,GAAmB,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;QACtD,MAAM,IAAI,GAAmB,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QACxD,IAAI,OAAO,GAAmB,SAAS,CAAC;QACxC,IAAI,CAAC,GAAG,IAAI,CAAC,IAAI,EAAE,CAAC;YAClB,OAAO,SAAS,CAAC;QACnB,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAC9C,IAAI,WAAW,EAAE,CAAC;YAChB,WAAW,CAAK,WAAW,EAAE,CAAC,IAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,IAAI,KAAK,IAAI,CAAC,GAAG,CAAC,CAAC;QACrE,CAAC;QAED,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAC9C,IAAI,WAAW,EAAE,CAAC;YAChB,OAAO,GAAG,WAAW,CAAK,WAAW,EAAE,CAAC,IAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,GAAG,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,SAAS,CAAC;QAC7F,CAAC;QACD,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;;;;;OAYG;IACH,UAAU,CAAC,kBAAkC,EAAE,aAAyB;QACtE,IAAI,OAAO,GAAmB,SAAS,CAAC;QACxC,IAAI,GAAmB,EAAE,IAAoB,CAAC;QAC9C,IAAI,IAAI,CAAC,WAAW,CAAC,kBAAkB,CAAC,EAAE,CAAC;YACzC,IAAI,IAAI,CAAC,WAAW,CAAC,aAAa,CAAC,EAAE,CAAC;gBACpC,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,kBAAkB,CAAC,CAAC;gBAC1C,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,aAAa,CAAC,CAAC;YACxC,CAAC;iBAAM,CAAC;gBACN,OAAO;YACT,CAAC;QACH,CAAC;aAAM,CAAC;YACN,GAAG,GAAG,IAAI,CAAC,UAAU,CAAC,kBAAkB,CAAC,GAAG,CAAC,CAAC;YAC9C,IAAI,GAAG,IAAI,CAAC,UAAU,CAAC,kBAAkB,CAAC,IAAI,CAAC,CAAC;QAClD,CAAC;QAED,IAAI,GAAG,IAAI,IAAI,EAAE,CAAC;YAChB,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;YAC9C,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1C,WAAW,CAAC,WAAW,EAAE,CAAC,IAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,GAAI,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,KAAK,IAAI,EAAE,GAAG,CAAC,CAAC;YAC3F,CAAC;YAED,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAC9C,IAAI,WAAW,IAAI,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBAC1C,OAAO,GAAG,WAAW,CAAC,WAAW,EAAE,CAAC,IAAQ,EAAE,EAAE,CAAC,IAAI,CAAC,GAAG,KAAK,GAAI,CAAC,GAAG,IAAI,IAAI,CAAC,IAAI,KAAK,IAAK,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;YACxG,CAAC;QACH,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;OAQG;IACH,YAAY,CAAC,WAA2B;QACtC,IAAI,SAAoB,CAAC;QACzB,IAAI,MAAsB,CAAC;QAC3B,IAAI,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,EAAE,CAAC;YAClC,MAAM,GAAG,IAAI,CAAC,SAAS,CAAC,WAAW,CAAC,CAAC;YACrC,SAAS,GAAG,WAAW,CAAC;QAC1B,CAAC;aAAM,CAAC;YACN,MAAM,GAAG,WAAW,CAAC;YACrB,SAAS,GAAG,IAAI,CAAC,aAAa,CAAC,WAAW,CAAC,CAAC;QAC9C,CAAC;QAED,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC5C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,oCAAoC;gBACpC,IAAI,CAAC,mBAAmB,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAC7C,CAAC;YACD,IAAI,CAAC,WAAW,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;YAChC,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;QACjC,CAAC;QAED,OAAO,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,SAAS,CAAC,CAAC;IAC3C,CAAC;IAED;;;;;;;;;;OAUG;IACH,kBAAkB,CAAC,EAAkB,EAAE,EAAkB;QACvD,MAAM,OAAO,GAAS,EAAE,CAAC;QAEzB,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;YACb,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAChD,MAAM,MAAM,GAAG,IAAI,CAAC,mBAAmB,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;YAEhD,IAAI,MAAM;gBAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACjC,IAAI,MAAM;gBAAE,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnC,CAAC;QAED,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;OAQG;IACH,eAAe,CAAC,WAA2B;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAC5C,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC1C,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;;;;;;OAQG;IACH,eAAe,CAAC,WAA2B;QACzC,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAC5C,IAAI,MAAM,EAAE,CAAC;YACX,OAAO,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QAC5C,CAAC;QACD,OAAO,EAAE,CAAC;IACZ,CAAC;IAED;;;;;;;OAOG;IACH,QAAQ,CAAC,WAA2B;QAClC,OAAO,IAAI,CAAC,WAAW,CAAC,WAAW,CAAC,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;IACtE,CAAC;IAED;;;;;;;OAOG;IACH,UAAU,CAAC,WAA2B;QACpC,OAAO,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC;IAClD,CAAC;IAED;;;;;;;OAOG;IACH,WAAW,CAAC,WAA2B;QACrC,OAAO,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC,MAAM,CAAC;IAClD,CAAC;IAED;;;;;;;OAOG;IACH,OAAO,CAAC,WAA2B;QACjC,OAAO,CAAC,GAAG,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC,EAAE,GAAG,IAAI,CAAC,eAAe,CAAC,WAAW,CAAC,CAAC,CAAC;IACtF,CAAC;IAED;;;;;;;OAOG;IACH,UAAU,CAAC,CAAK;QACd,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED;;;;;;;OAOG;IACH,WAAW,CAAC,CAAK;QACf,OAAO,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC;IAED;;;;;;;;OAQG;IACH,eAAe,CAAC,MAAkC;QAChD,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;YACzB,OAAO,EAAE,CAAC;QACZ,CAAC;QACD,MAAM,YAAY,GAAS,EAAE,CAAC;QAC9B,MAAM,aAAa,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;QACnD,KAAK,MAAM,OAAO,IAAI,aAAa,EAAE,CAAC;YACpC,MAAM,KAAK,GAAG,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,CAAC;YACxC,IAAI,KAAK,EAAE,CAAC;gBACV,YAAY,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC;QACD,OAAO,YAAY,CAAC;IACtB,CAAC;IAED;;;;;;;;;;OAUG;IACH,eAAe,CAAC,YAA+B;QAC7C,YAAY,GAAG,YAAY,IAAI,KAAK,CAAC;QACrC,gHAAgH;QAChH,6GAA6G;QAC7G,MAAM,SAAS,GAA2C,IAAI,GAAG,EAAqC,CAAC;QACvG,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;QAC7B,CAAC;QAED,IAAI,MAAM,GAAuB,EAAE,CAAC;QACpC,IAAI,QAAQ,GAAG,KAAK,CAAC;QACrB,MAAM,GAAG,GAAG,CAAC,GAAmB,EAAE,EAAE;YAClC,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACtB,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,CAAC;YAC3C,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;gBAC7B,MAAM,WAAW,GAAG,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;gBACzC,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;oBACtB,GAAG,CAAC,KAAK,CAAC,CAAC;gBACb,CAAC;qBAAM,IAAI,WAAW,KAAK,CAAC,EAAE,CAAC;oBAC7B,QAAQ,GAAG,IAAI,CAAC;gBAClB,CAAC;YACH,CAAC;YACD,SAAS,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACnB,CAAC,CAAC;QAEF,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,SAAS,EAAE,CAAC;YACnC,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;gBAClC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,IAAI,QAAQ;YAAE,OAAO,SAAS,CAAC;QAE/B,IAAI,YAAY,KAAK,KAAK;YAAE,MAAM,GAAG,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC,MAAM,YAAY,cAAc,CAAC,CAAC,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;QACpH,OAAO,MAAM,CAAC,OAAO,EAAE,CAAC;IAC1B,CAAC;IAED;;;;;;OAMG;IACH,OAAO;QACL,IAAI,OAAO,GAAS,EAAE,CAAC;QACvB,IAAI,CAAC,WAAW,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE;YAClC,OAAO,GAAG,CAAC,GAAG,OAAO,EAAE,GAAG,QAAQ,CAAC,CAAC;QACtC,CAAC,CAAC,CAAC;QACH,OAAO,OAAO,CAAC;IACjB,CAAC;IAED;;;;;;;;OAQG;IACH,YAAY,CAAC,WAA2B;QACtC,MAAM,SAAS,GAAS,EAAE,CAAC;QAC3B,MAAM,MAAM,GAAG,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;QAC5C,IAAI,MAAM,EAAE,CAAC;YACX,MAAM,QAAQ,GAAG,IAAI,CAAC,eAAe,CAAC,MAAM,CAAC,CAAC;YAC9C,KAAK,MAAM,OAAO,IAAI,QAAQ,EAAE,CAAC;gBAC/B,MAAM,QAAQ,GAAG,IAAI,CAAC,UAAU,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;gBAC/C,6DAA6D;gBAC7D,IAAI,QAAQ,EAAE,CAAC;oBACb,SAAS,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;gBAC3B,CAAC;YACH,CAAC;QACH,CAAC;QACD,OAAO,SAAS,CAAC;IACnB,CAAC;IAED;;;;;;;;;OASG;IACH,aAAa,CAAC,IAAQ;QACpB,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;YACvC,OAAO,SAAS,CAAC;QACnB,CAAC;QACD,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACtC,IAAI,EAAE,IAAI,EAAE,EAAE,CAAC;YACb,OAAO,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QAClB,CAAC;aAAM,CAAC;YACN,OAAO,SAAS,CAAC;QACnB,CAAC;IACH,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,KAAK,CAAC,IAAI,IAAI,CAAC,UAAU,CAAC,IAAI,KAAK,CAAC,CAAC;IAC9F,CAAC;IAED;;;;;OAKG;IACH,KAAK;QACH,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,EAAiB,CAAC;QAC3C,IAAI,CAAC,UAAU,GAAG,IAAI,GAAG,EAAY,CAAC;QACtC,IAAI,CAAC,WAAW,GAAG,IAAI,GAAG,EAAY,CAAC;IACzC,CAAC;IAED;;;;OAIG;IACH,KAAK;QACH,MAAM,MAAM,GAAG,IAAI,aAAa,EAAgB,CAAC;QACjD,MAAM,CAAC,SAAS,GAAG,IAAI,GAAG,CAAgB,IAAI,CAAC,SAAS,CAAC,CAAC;QAC1D,MAAM,CAAC,SAAS,GAAG,IAAI,GAAG,CAAW,IAAI,CAAC,SAAS,CAAC,CAAC;QACrD,MAAM,CAAC,UAAU,GAAG,IAAI,GAAG,CAAW,IAAI,CAAC,UAAU,CAAC,CAAC;QACvD,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;;;;;;;;;OAUG;IACH,MAAM;QACJ,MAAM,MAAM,GAAG,IAAI,GAAG,EAAc,CAAC;QACrC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAc,CAAC;QACrC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAgB,CAAC;QAErC,IAAI,IAAI,GAAG,CAAC,CAAC;QAEb,MAAM,KAAK,GAAS,EAAE,CAAC;QACvB,MAAM,OAAO,GAAY,IAAI,GAAG,EAAE,CAAC;QAEnC,MAAM,GAAG,GAAG,CAAC,MAAU,EAAE,EAAE;YACzB,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACzB,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;YACzB,IAAI,EAAE,CAAC;YAEP,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACnB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;YAEpB,MAAM,SAAS,GAAG,IAAI,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC;YAC5C,KAAK,MAAM,QAAQ,IAAI,SAAS,EAAE,CAAC;gBACjC,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC1B,GAAG,CAAC,QAAQ,CAAC,CAAC;oBACd,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAC;gBAC3E,CAAC;qBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACjC,MAAM,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAE,EAAE,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAE,CAAC,CAAC,CAAC;gBAC3E,CAAC;YACH,CAAC;YAED,IAAI,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC9C,MAAM,GAAG,GAAS,EAAE,CAAC;gBACrB,IAAI,YAA4B,CAAC;gBAEjC,GAAG,CAAC;oBACF,YAAY,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;oBAC3B,OAAO,CAAC,MAAM,CAAC,YAAa,CAAC,CAAC;oBAC9B,GAAG,CAAC,IAAI,CAAC,YAAa,CAAC,CAAC;gBAC1B,CAAC,QAAQ,YAAY,KAAK,MAAM,EAAE;gBAElC,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,GAAG,CAAC,CAAC;YAC3B,CAAC;QACH,CAAC,CAAC;QAEF,KAAK,MAAM,MAAM,IAAI,IAAI,CAAC,SAAS,CAAC,MAAM,EAAE,EAAE,CAAC;YAC7C,IAAI,CAAC,MAAM,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBACxB,GAAG,CAAC,MAAM,CAAC,CAAC;YACd,CAAC;QACH,CAAC;QAED,OAAO,EAAE,MAAM,EAAE,MAAM,EAAE,IAAI,EAAE,CAAC;IAClC,CAAC;IAED;;;;;;;OAOG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;;;;OAKG;IACH,SAAS;QACP,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,MAAM,CAAC;IAC9B,CAAC;IAED;;;;OAIG;IACH,OAAO;QACL,OAAO,IAAI,CAAC,MAAM,EAAE,CAAC,IAAI,CAAC;IAC5B,CAAC;IAED;;;;;;;;;OASG;IACO,QAAQ,CAAC,IAAQ;QACzB,IAAI,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;YAC7D,OAAO,KAAK,CAAC;QACf,CAAC;QAED,MAAM,SAAS,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC5C,MAAM,UAAU,GAAG,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAE9C,6DAA6D;QAC7D,IAAI,SAAS,IAAI,UAAU,EAAE,CAAC;YAC5B,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;YACpD,IAAI,WAAW,EAAE,CAAC;gBAChB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,SAAS,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1C,CAAC;YAED,MAAM,WAAW,GAAG,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,CAAC,CAAC;YACpD,IAAI,WAAW,EAAE,CAAC;gBAChB,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACzB,CAAC;iBAAM,CAAC;gBACN,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,UAAU,EAAE,CAAC,IAAI,CAAC,CAAC,CAAC;YAC1C,CAAC;YACD,OAAO,IAAI,CAAC;QACd,CAAC;aAAM,CAAC;YACN,OAAO,KAAK,CAAC;QACf,CAAC;IACH,CAAC;CACF"}

package/dist/esm/data-structures/graph/index.d.ts

@@ -1,4 +0,0 @@
-export * from './abstract-graph';
-export * from './directed-graph';
-export * from './undirected-graph';
-export * from './map-graph';

package/dist/esm/data-structures/graph/index.js

@@ -1,5 +0,0 @@
-export * from './abstract-graph';
-export * from './directed-graph';
-export * from './undirected-graph';
-export * from './map-graph';
-//# sourceMappingURL=index.js.map

package/dist/esm/data-structures/graph/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/data-structures/graph/index.ts"],"names":[],"mappings":"AAAA,cAAc,kBAAkB,CAAC;AACjC,cAAc,kBAAkB,CAAC;AACjC,cAAc,oBAAoB,CAAC;AACnC,cAAc,aAAa,CAAC"}