heap-typed 1.48.3 → 1.48.5

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

@@ -25,7 +25,7 @@ class DirectedVertex extends abstract_graph_1.AbstractVertex {
 exports.DirectedVertex = DirectedVertex;
 class DirectedEdge extends abstract_graph_1.AbstractEdge {
     /**
-     * The constructor function initializes the source and destination vertices of an edge, along with an optional weight
+     * 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.
@@ -64,7 +64,7 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
     /**
      * 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 vertices.
+     * 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
@@ -78,7 +78,7 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * This means that using abstract methods in the parent class cannot constrain the grandchild classes. Defining methods within an interface also cannot constrain the descendant classes. When inheriting from this class, developers need to be aware that this method needs to be overridden.
      */
     /**
-     * The function creates a directed edge between two vertices with an optional weight and 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
@@ -91,43 +91,43 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         return new DirectedEdge(src, dest, weight !== null && weight !== void 0 ? weight : 1, value);
     }
     /**
-     * Time Complexity: O(|V|) where |V| is the number of vertices
+     * Time Complexity: O(|V|) where |V| is the number of vertexMap
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(|V|) where |V| is the number of vertices
+     * Time Complexity: O(|V|) where |V| is the number of vertexMap
      * Space Complexity: O(1)
      *
-     * The `getEdge` function retrieves an edge between two vertices based on their source and destination IDs.
+     * 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 vertices, or undefined if no such edge is found.
+     * @returns the first edge found between the source and destination vertexMap, or undefined if no such edge is found.
      */
     getEdge(srcOrKey, destOrKey) {
-        let edges = [];
+        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) {
-                    edges = srcOutEdges.filter(edge => edge.dest === dest.key);
+                    edgeMap = srcOutEdges.filter(edge => edge.dest === dest.key);
                 }
             }
         }
-        return edges[0] || undefined;
+        return edgeMap[0] || undefined;
     }
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
      *
-     * The function removes an edge between two vertices in a graph and returns the removed edge.
+     * 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.
@@ -150,48 +150,94 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         return removed;
     }
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(E) where E is the number of edgeMap
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(E) where E is the number of edgeMap
      * Space Complexity: O(1)
      *
-     * The function removes an edge from a graph and returns the removed edge, or undefined if the edge was not found.
-     * @param {EO} edge - The `edge` parameter is an object that represents an edge in a graph. It has two properties: `src`
-     * and `dest`, which represent the source and destination vertices of the edge, respectively.
-     * @returns The method `deleteEdge` returns the removed edge (`EO`) if it exists, or `undefined` if the edge does not exist.
-     */
-    deleteEdge(edge) {
+     * 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;
-        const src = this._getVertex(edge.src);
-        const dest = this._getVertex(edge.dest);
+        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) {
-                (0, utils_1.arrayRemove)(srcOutEdges, (edge) => edge.src === src.key);
+                (0, utils_1.arrayRemove)(srcOutEdges, (edge) => edge.src === src.key && edge.dest === (dest === null || dest === void 0 ? void 0 : dest.key));
             }
             const destInEdges = this._inEdgeMap.get(dest);
             if (destInEdges && destInEdges.length > 0) {
-                removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.dest === dest.key)[0];
+                removed = (0, utils_1.arrayRemove)(destInEdges, (edge) => edge.src === src.key && edge.dest === dest.key)[0];
             }
         }
         return removed;
     }
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(1) - Constant time for Map operations.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     */
+    /**
+     * 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) {
+            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)
      */
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
      *
-     * The function removes edges between two vertices and returns the removed edges.
+     * 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 edges (EO[]).
+     * @returns an array of removed edgeMap (EO[]).
      */
     deleteEdgesBetween(v1, v2) {
         const removed = [];
@@ -211,10 +257,10 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function `incomingEdgesOf` returns an array of incoming edges for a given vertex or vertex ID.
+     * 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 edges (`EO[]`).
+     * @returns The method `incomingEdgesOf` returns an array of edgeMap (`EO[]`).
      */
     incomingEdgesOf(vertexOrKey) {
         const target = this._getVertex(vertexOrKey);
@@ -231,10 +277,10 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function `outgoingEdgesOf` returns an array of outgoing edges from a given vertex or vertex ID.
+     * 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 edges (`EO[]`).
+     * @returns The method `outgoingEdgesOf` returns an array of edgeMap (`EO[]`).
      */
     outgoingEdgesOf(vertexOrKey) {
         const target = this._getVertex(vertexOrKey);
@@ -266,9 +312,9 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function "inDegreeOf" returns the number of incoming edges for a given vertex.
+     * 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 edges of the specified vertex or vertex ID.
+     * @returns The number of incoming edgeMap of the specified vertex or vertex ID.
      */
     inDegreeOf(vertexOrKey) {
         return this.incomingEdgesOf(vertexOrKey).length;
@@ -281,9 +327,9 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function `outDegreeOf` returns the number of outgoing edges from a given vertex.
+     * 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 edges from the specified vertex or vertex ID.
+     * @returns The number of outgoing edgeMap from the specified vertex or vertex ID.
      */
     outDegreeOf(vertexOrKey) {
         return this.outgoingEdgesOf(vertexOrKey).length;
@@ -296,9 +342,9 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function "edgesOf" returns an array of both outgoing and incoming edges of a given vertex or vertex ID.
+     * 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 edges.
+     * @returns The function `edgesOf` returns an array of edgeMap.
      */
     edgesOf(vertexOrKey) {
         return [...this.outgoingEdgesOf(vertexOrKey), ...this.incomingEdgesOf(vertexOrKey)];
@@ -334,17 +380,17 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         return this._getVertex(e.dest);
     }
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
      *
-     * The function `getDestinations` returns an array of destination vertices connected to a given vertex.
+     * 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 vertices (VO[]).
+     * @returns an array of vertexMap (VO[]).
      */
     getDestinations(vertex) {
         if (vertex === undefined) {
@@ -361,26 +407,26 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         return destinations;
     }
     /**
-     * Time Complexity: O(|V| + |E|) where |V| is the number of vertices and |E| is the number of edges
+     * Time Complexity: O(|V| + |E|) where |V| is the number of vertexMap and |E| is the number of edgeMap
      * Space Complexity: O(|V|)
      */
     /**
-     * Time Complexity: O(|V| + |E|) where |V| is the number of vertices and |E| is the number of edges
+     * 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 vertices or vertex IDs
+     * 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 vertices. It can have two possible values: 'vertex' or 'key'. If 'vertex' is
-     * specified, the vertices themselves will be used for sorting. If 'key' is specified, the ids of
-     * @returns an array of vertices or vertex IDs in topological order. If there is a cycle in the graph, it returns undefined.
+     * 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 !== null && propertyName !== void 0 ? 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.vertices) {
+        for (const entry of this.vertexMap) {
             statusMap.set(entry[1], 0);
         }
         let sorted = [];
@@ -400,7 +446,7 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
             statusMap.set(cur, 2);
             sorted.push(cur);
         };
-        for (const entry of this.vertices) {
+        for (const entry of this.vertexMap) {
             if (statusMap.get(entry[1]) === 0) {
                 dfs(entry[1]);
             }
@@ -412,35 +458,35 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
         return sorted.reverse();
     }
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(|E|)
      */
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(|E|)
      *
-     * The `edgeSet` function returns an array of all the edges in the graph.
-     * @returns The `edgeSet()` method returns an array of edges (`EO[]`).
+     * 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 edges = [];
+        let edgeMap = [];
         this._outEdgeMap.forEach(outEdges => {
-            edges = [...edges, ...outEdges];
+            edgeMap = [...edgeMap, ...outEdges];
         });
-        return edges;
+        return edgeMap;
     }
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(|E|) where |E| is the number of edges
+     * Time Complexity: O(|E|) where |E| is the number of edgeMap
      * Space Complexity: O(1)
      *
-     * The function `getNeighbors` returns an array of neighboring vertices of a given vertex or vertex ID in a graph.
+     * 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 vertices (VO[]).
+     * @returns an array of vertexMap (VO[]).
      */
     getNeighbors(vertexOrKey) {
         const neighbors = [];
@@ -465,10 +511,10 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function "getEndsOfEdge" returns the source and destination vertices of an edge if it exists in the graph,
+     * 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 vertices `[VO, VO]` if the edge exists in the
+     * @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) {
@@ -492,7 +538,7 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function `_addEdgeOnly` adds an edge to a graph if the source and destination vertices exist.
+     * The function `_addEdgeOnly` 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

package/dist/data-structures/graph/map-graph.d.ts

@@ -32,17 +32,17 @@ export declare class MapEdge<E = any> extends DirectedEdge<E> {
 }
 export declare class MapGraph<V = any, E = any, VO extends MapVertex<V> = MapVertex<V>, EO extends MapEdge<E> = MapEdge<E>> extends DirectedGraph<V, E, VO, EO> {
     /**
-     * The constructor function initializes the origin and bottomRight properties of a MapGraphCoordinate object.
-     * @param {MapGraphCoordinate} origin - The `origin` parameter is a `MapGraphCoordinate` object that represents the
+     * The constructor function initializes the originCoord and bottomRight properties of a MapGraphCoordinate object.
+     * @param {MapGraphCoordinate} originCoord - The `originCoord` parameter is a `MapGraphCoordinate` object that represents the
      * starting point or reference point of the map graph. It defines the coordinates of the top-left corner of the map
      * graph.
      * @param {MapGraphCoordinate} [bottomRight] - The `bottomRight` parameter is an optional parameter of type
      * `MapGraphCoordinate`. It represents the bottom right coordinate of a map graph. If this parameter is not provided,
      * it will default to `undefined`.
      */
-    constructor(origin: MapGraphCoordinate, bottomRight?: MapGraphCoordinate);
-    protected _origin: MapGraphCoordinate;
-    get origin(): MapGraphCoordinate;
+    constructor(originCoord: MapGraphCoordinate, bottomRight?: MapGraphCoordinate);
+    protected _originCoord: MapGraphCoordinate;
+    get originCoord(): MapGraphCoordinate;
     protected _bottomRight: MapGraphCoordinate | undefined;
     get bottomRight(): MapGraphCoordinate | undefined;
     /**

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

@@ -40,22 +40,22 @@ class MapEdge extends directed_graph_1.DirectedEdge {
 exports.MapEdge = MapEdge;
 class MapGraph extends directed_graph_1.DirectedGraph {
     /**
-     * The constructor function initializes the origin and bottomRight properties of a MapGraphCoordinate object.
-     * @param {MapGraphCoordinate} origin - The `origin` parameter is a `MapGraphCoordinate` object that represents the
+     * The constructor function initializes the originCoord and bottomRight properties of a MapGraphCoordinate object.
+     * @param {MapGraphCoordinate} originCoord - The `originCoord` parameter is a `MapGraphCoordinate` object that represents the
      * starting point or reference point of the map graph. It defines the coordinates of the top-left corner of the map
      * graph.
      * @param {MapGraphCoordinate} [bottomRight] - The `bottomRight` parameter is an optional parameter of type
      * `MapGraphCoordinate`. It represents the bottom right coordinate of a map graph. If this parameter is not provided,
      * it will default to `undefined`.
      */
-    constructor(origin, bottomRight) {
+    constructor(originCoord, bottomRight) {
         super();
-        this._origin = [0, 0];
-        this._origin = origin;
+        this._originCoord = [0, 0];
+        this._originCoord = originCoord;
         this._bottomRight = bottomRight;
     }
-    get origin() {
-        return this._origin;
+    get originCoord() {
+        return this._originCoord;
     }
     get bottomRight() {
         return this._bottomRight;
@@ -71,7 +71,7 @@ class MapGraph extends directed_graph_1.DirectedGraph {
      * @param {number} long - The `long` parameter represents the longitude coordinate of the vertex.
      * @returns The method is returning a new instance of the `MapVertex` class, casted as type `VO`.
      */
-    createVertex(key, value, lat = this.origin[0], long = this.origin[1]) {
+    createVertex(key, value, lat = this.originCoord[0], long = this.originCoord[1]) {
         return new MapVertex(key, value, lat, long);
     }
     /**

package/dist/data-structures/graph/undirected-graph.d.ts

@@ -12,7 +12,7 @@ export declare class UndirectedVertex<V = any> extends AbstractVertex<V> {
     constructor(key: VertexKey, value?: V);
 }
 export declare class UndirectedEdge<E = number> extends AbstractEdge<E> {
-    vertices: [VertexKey, VertexKey];
+    vertexMap: [VertexKey, VertexKey];
     /**
      * The constructor function creates an instance of a class with two vertex IDs, an optional weight, and an optional
      * value.
@@ -27,11 +27,11 @@ export declare class UndirectedEdge<E = number> extends AbstractEdge<E> {
 }
 export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVertex<V> = UndirectedVertex<V>, EO extends UndirectedEdge<E> = UndirectedEdge<E>> extends AbstractGraph<V, E, VO, EO> implements IGraph<V, E, VO, EO> {
     /**
-     * The constructor initializes a new Map object to store edges.
+     * The constructor initializes a new Map object to store edgeMap.
      */
     constructor();
-    protected _edges: Map<VO, EO[]>;
-    get edges(): Map<VO, EO[]>;
+    protected _edgeMap: Map<VO, EO[]>;
+    get edgeMap(): Map<VO, EO[]>;
     /**
      * 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 used to distinguish one
@@ -43,7 +43,7 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      */
     createVertex(key: VertexKey, value?: VO['value']): VO;
     /**
-     * The function creates an undirected edge between two vertices with an optional weight and value.
+     * The function creates an undirected edge between two vertexMap with an optional weight and value.
      * @param {VertexKey} v1 - The parameter `v1` represents the first vertex of the edge.
      * @param {VertexKey} 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
@@ -54,14 +54,14 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      */
     createEdge(v1: VertexKey, v2: VertexKey, weight?: number, value?: EO['value']): EO;
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      *
-     * The function `getEdge` returns the first edge that connects two vertices, or undefined if no such edge exists.
+     * The function `getEdge` returns the first edge that connects two vertexMap, or undefined if no such edge exists.
      * @param {VO | VertexKey | undefined} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `VO` (vertex
      * object), `undefined`, or `VertexKey` (a string or number representing the ID of a vertex).
      * @param {VO | VertexKey | undefined} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `VO` (vertex
@@ -70,33 +70,52 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      */
     getEdge(v1: VO | VertexKey | undefined, v2: VO | VertexKey | undefined): EO | undefined;
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(|E|), where |E| is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      *
-     * The function removes an edge between two vertices in a graph and returns the removed edge.
+     * The function removes an edge between two vertexMap in a graph and returns the removed edge.
      * @param {VO | VertexKey} v1 - The parameter `v1` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
      * @param {VO | VertexKey} v2 - VO | VertexKey - This parameter can be either a vertex object (VO) or a vertex ID
      * (VertexKey). It represents the second vertex of the edge that needs to be removed.
-     * @returns the removed edge (EO) if it exists, or undefined if either of the vertices (VO) does not exist.
+     * @returns the removed edge (EO) if it exists, or undefined if either of the vertexMap (VO) does not exist.
      */
     deleteEdgeBetween(v1: VO | VertexKey, v2: VO | VertexKey): EO | undefined;
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      */
     /**
-     * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
+     * Time Complexity: O(E), where E is the number of edgeMap incident to the given vertex.
      * Space Complexity: O(1)
      *
-     * The deleteEdge function removes an edge between two vertices in a graph.
-     * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
-     * @returns The method is returning either the removed edge (of type EO) or undefined if the edge was not found.
+     * The function `deleteEdge` deletes an edge between two vertexMap in a graph.
+     * @param {EO | VertexKey} edgeOrOneSideVertexKey - The parameter `edgeOrOneSideVertexKey` can be
+     * either an edge object or a vertex key.
+     * @param {VertexKey} [otherSideVertexKey] - The parameter `otherSideVertexKey` is an optional
+     * parameter that represents the key of the vertex on the other side of the edge. It is used when the
+     * `edgeOrOneSideVertexKey` parameter is a vertex key, and it specifies the key of the vertex on the
+     * other side of the
+     * @returns The `deleteEdge` function returns either the deleted edge object (EO) or `undefined`.
+     */
+    deleteEdge(edgeOrOneSideVertexKey: EO | VertexKey, otherSideVertexKey?: VertexKey): EO | undefined;
+    /**
+     * Time Complexity: O(1) - Constant time for Map operations.
+     * Space Complexity: O(1) - Constant space, as it creates only a few variables.
+     */
+    /**
+     * 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.
      */
-    deleteEdge(edge: EO): EO | undefined;
+    deleteVertex(vertexOrKey: VO | VertexKey): boolean;
     /**
      * Time Complexity: O(1)
      * Space Complexity: O(1)
@@ -105,11 +124,11 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function `degreeOf` returns the degree of a vertex in a graph, which is the number of edges connected to that
+     * The function `degreeOf` returns the degree of a vertex in a graph, which is the number of edgeMap connected to that
      * vertex.
      * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`.
      * @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.
+     * edgeMap connected to that vertex.
      */
     degreeOf(vertexOrKey: VertexKey | VO): number;
     /**
@@ -120,36 +139,36 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function returns the edges of a given vertex or vertex ID.
+     * The function returns the edgeMap of a given vertex or vertex ID.
      * @param {VertexKey | VO} vertexOrKey - The parameter `vertexOrKey` can be either a `VertexKey` or a `VO`. A `VertexKey` is a
      * unique identifier for a vertex in a graph, while `VO` represents the type of the vertex.
-     * @returns an array of edges.
+     * @returns an array of edgeMap.
      */
     edgesOf(vertexOrKey: VertexKey | VO): EO[];
     /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertices and |E| is the number of edges.
+     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
      */
     /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertices and |E| is the number of edges.
+     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
      *
-     * The function "edgeSet" returns an array of unique edges from a set of edges.
+     * The function "edgeSet" returns an array of unique edgeMap from a set of edgeMap.
      * @returns The method `edgeSet()` returns an array of type `EO[]`.
      */
     edgeSet(): EO[];
     /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertices and |E| is the number of edges.
+     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
      */
     /**
-     * Time Complexity: O(|V| + |E|), where |V| is the number of vertices and |E| is the number of edges.
+     * Time Complexity: O(|V| + |E|), where |V| is the number of vertexMap and |E| is the number of edgeMap.
      * Space Complexity: O(|E|)
      *
-     * The function "getNeighbors" returns an array of neighboring vertices for a given vertex or vertex ID.
+     * The function "getNeighbors" returns an array of neighboring vertexMap 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 an array of vertices (VO[]).
+     * @returns an array of vertexMap (VO[]).
      */
     getNeighbors(vertexOrKey: VO | VertexKey): VO[];
     /**
@@ -160,10 +179,10 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function "getEndsOfEdge" returns the vertices at the ends of an edge if the edge exists in the graph, otherwise
+     * The function "getEndsOfEdge" returns the vertexMap at the ends of an edge if the edge 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 vertices `[VO, VO]` if the edge exists in the
+     * @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: EO): [VO, VO] | undefined;
@@ -175,7 +194,7 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function adds an edge to the graph by updating the adjacency list with the vertices of the edge.
+     * The function adds an edge to the graph by updating the adjacency list with the vertexMap of the edge.
      * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
      * @returns a boolean value.
      */