data-structure-typed 1.48.4 → 1.48.5

package/dist/umd/data-structure-typed.js

@@ -128,7 +128,7 @@ var dataStructureTyped = (() => {
     HashTableNode: () => HashTableNode,
     Heap: () => Heap,
     IterableElementBase: () => IterableElementBase,
-    IterablePairBase: () => IterablePairBase,
+    IterableEntryBase: () => IterableEntryBase,
     IterationType: () => IterationType,
     LinkedHashMap: () => LinkedHashMap,
     LinkedListQueue: () => LinkedListQueue,
@@ -520,7 +520,7 @@ var dataStructureTyped = (() => {
   var calcMinUnitsRequired = (totalQuantity, unitSize) => Math.floor((totalQuantity + unitSize - 1) / unitSize);
 
   // src/data-structures/base/iterable-base.ts
-  var IterablePairBase = class {
+  var IterableEntryBase = class {
     /**
      * Time Complexity: O(n)
      * Space Complexity: O(1)
@@ -829,7 +829,7 @@ var dataStructureTyped = (() => {
   };
 
   // src/data-structures/hash/hash-map.ts
-  var HashMap = class _HashMap extends IterablePairBase {
+  var HashMap = class _HashMap extends IterableEntryBase {
     /**
      * The constructor function initializes a new instance of a class with optional elements and options.
      * @param elements - The `elements` parameter is an iterable containing key-value pairs `[K, V]`. It
@@ -1041,7 +1041,7 @@ var dataStructureTyped = (() => {
       return strKey;
     }
   };
-  var LinkedHashMap = class _LinkedHashMap extends IterablePairBase {
+  var LinkedHashMap = class _LinkedHashMap extends IterableEntryBase {
     constructor(elements, options = {
       hashFn: (key) => String(key),
       objHashFn: (key) => key
@@ -5420,13 +5420,13 @@ var dataStructureTyped = (() => {
      * 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.
      */
   };
-  var AbstractGraph = class extends IterablePairBase {
+  var AbstractGraph = class extends IterableEntryBase {
     constructor() {
       super();
-      __publicField(this, "_vertices", /* @__PURE__ */ new Map());
+      __publicField(this, "_vertexMap", /* @__PURE__ */ new Map());
     }
-    get vertices() {
-      return this._vertices;
+    get vertexMap() {
+      return this._vertexMap;
     }
     /**
      * Time Complexity: O(1) - Constant time for Map lookup.
@@ -5438,12 +5438,12 @@ var dataStructureTyped = (() => {
      *
      * The function "getVertex" returns the vertex with the specified ID or undefined if it doesn't exist.
      * @param {VertexKey} vertexKey - The `vertexKey` parameter is the identifier of the vertex that you want to retrieve from
-     * the `_vertices` map.
-     * @returns The method `getVertex` returns the vertex with the specified `vertexKey` if it exists in the `_vertices`
+     * the `_vertexMap` map.
+     * @returns The method `getVertex` returns the vertex with the specified `vertexKey` if it exists in the `_vertexMap`
      * map. If the vertex does not exist, it returns `undefined`.
      */
     getVertex(vertexKey) {
-      return this._vertices.get(vertexKey) || void 0;
+      return this._vertexMap.get(vertexKey) || void 0;
     }
     /**
      * Time Complexity: O(1) - Constant time for Map lookup.
@@ -5459,7 +5459,7 @@ var dataStructureTyped = (() => {
      * @returns a boolean value.
      */
     hasVertex(vertexOrKey) {
-      return this._vertices.has(this._getVertexKey(vertexOrKey));
+      return this._vertexMap.has(this._getVertexKey(vertexOrKey));
     }
     /**
      * Time Complexity: O(1) - Constant time for Map operations.
@@ -5492,25 +5492,25 @@ var dataStructureTyped = (() => {
      */
     deleteVertex(vertexOrKey) {
       const vertexKey = this._getVertexKey(vertexOrKey);
-      return this._vertices.delete(vertexKey);
+      return this._vertexMap.delete(vertexKey);
     }
     /**
-     * Time Complexity: O(K), where K is the number of vertices to be removed.
+     * Time Complexity: O(K), where K is the number of vertexMap to be removed.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
      */
     /**
-     * Time Complexity: O(K), where K is the number of vertices to be removed.
+     * Time Complexity: O(K), where K is the number of vertexMap to be removed.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
      *
-     * The function removes all vertices from a graph and returns a boolean indicating if any vertices were removed.
-     * @param {VO[] | VertexKey[]} vertices - The `vertices` parameter can be either an array of vertices (`VO[]`) or an array
+     * The function removes all vertexMap from a graph and returns a boolean indicating if any vertexMap were removed.
+     * @param {VO[] | VertexKey[]} vertexMap - The `vertexMap` parameter can be either an array of vertexMap (`VO[]`) or an array
      * of vertex IDs (`VertexKey[]`).
-     * @returns a boolean value. It returns true if at least one vertex was successfully removed, and false if no vertices
+     * @returns a boolean value. It returns true if at least one vertex was successfully removed, and false if no vertexMap
      * were removed.
      */
-    removeManyVertices(vertices) {
+    removeManyVertices(vertexMap) {
       const removed = [];
-      for (const v of vertices) {
+      for (const v of vertexMap) {
         removed.push(this.deleteVertex(v));
       }
       return removed.length > 0;
@@ -5523,7 +5523,7 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1) - Depends on the implementation in the concrete class.
      * Space Complexity: O(1) - Depends on the implementation in the concrete class.
      *
-     * The function checks if there is an edge between two vertices and returns a boolean value indicating the result.
+     * The function checks if there is an edge between two vertexMap and returns a boolean value indicating the result.
      * @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 type of the vertex object itself.
      * @param {VertexKey | VO} v2 - The parameter `v2` represents the second vertex in the edge. It can be either a
@@ -5564,14 +5564,14 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1) - Constant time for Map and Edge operations.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
      *
-     * The function sets the weight of an edge between two vertices in a graph.
+     * The function sets the weight of an edge between two vertexMap in a graph.
      * @param {VertexKey | VO} srcOrKey - The `srcOrKey` parameter can be either a `VertexKey` or a `VO` object. It represents
      * the source vertex of the edge.
      * @param {VertexKey | VO} destOrKey - The `destOrKey` parameter represents the destination vertex of the edge. It can be
      * either a `VertexKey` or a vertex object `VO`.
      * @param {number} weight - The weight parameter represents the weight of the edge between the source vertex (srcOrKey)
      * and the destination vertex (destOrKey).
-     * @returns a boolean value. If the edge exists between the source and destination vertices, the function will update
+     * @returns a boolean value. If the edge exists between the source and destination vertexMap, the function will update
      * the weight of the edge and return true. If the edge does not exist, the function will return false.
      */
     setEdgeWeight(srcOrKey, destOrKey, weight) {
@@ -5591,12 +5591,12 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(P), where P is the number of paths found (in the worst case, exploring all paths).
      * Space Complexity: O(P) - Linear space, where P is the number of paths found.
      *
-     * The function `getAllPathsBetween` finds all paths between two vertices in a graph using depth-first search.
+     * The function `getAllPathsBetween` finds all paths between two vertexMap in a graph using depth-first search.
      * @param {VO | VertexKey} v1 - The parameter `v1` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
      * It is the starting vertex for finding paths.
      * @param {VO | VertexKey} v2 - The parameter `v2` represents either a vertex object (`VO`) or a vertex ID (`VertexKey`).
      * @param limit - The count of limitation of result array.
-     * @returns The function `getAllPathsBetween` returns an array of arrays of vertices (`VO[][]`).
+     * @returns The function `getAllPathsBetween` returns an array of arrays of vertexMap (`VO[][]`).
      */
     getAllPathsBetween(v1, v2, limit = 1e3) {
       const paths = [];
@@ -5633,8 +5633,8 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1) - Constant space.
      *
      * The function calculates the sum of weights along a given path.
-     * @param {VO[]} path - An array of vertices (VO) representing a path in a graph.
-     * @returns The function `getPathSumWeight` returns the sum of the weights of the edges in the given path.
+     * @param {VO[]} path - An array of vertexMap (VO) representing a path in a graph.
+     * @returns The function `getPathSumWeight` returns the sum of the weights of the edgeMap in the given path.
      */
     getPathSumWeight(path) {
       var _a;
@@ -5652,17 +5652,17 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
      * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
      *
-     * The function `getMinCostBetween` calculates the minimum cost between two vertices in a graph, either based on edge
+     * The function `getMinCostBetween` calculates the minimum cost between two vertexMap in a graph, either based on edge
      * weights or using a breadth-first search algorithm.
      * @param {VO | VertexKey} v1 - The parameter `v1` represents the starting vertex or its ID.
      * @param {VO | VertexKey} v2 - The parameter `v2` represents the destination vertex or its ID. It is the vertex to which
      * you want to find the minimum cost or weight from the source vertex `v1`.
-     * @param {boolean} [isWeight] - isWeight is an optional parameter that indicates whether the graph edges have weights.
+     * @param {boolean} [isWeight] - isWeight is an optional parameter that indicates whether the graph edgeMap have weights.
      * If isWeight is set to true, the function will calculate the minimum cost between v1 and v2 based on the weights of
-     * the edges. If isWeight is set to false or not provided, the function will calculate the
-     * @returns The function `getMinCostBetween` returns a number representing the minimum cost between two vertices (`v1`
+     * the edgeMap. If isWeight is set to false or not provided, the function will calculate the
+     * @returns The function `getMinCostBetween` returns a number representing the minimum cost between two vertexMap (`v1`
      * and `v2`). If the `isWeight` parameter is `true`, it calculates the minimum weight among all paths between the
-     * vertices. If `isWeight` is `false` or not provided, it uses a breadth-first search (BFS) algorithm to calculate the
+     * vertexMap. If `isWeight` is `false` or not provided, it uses a breadth-first search (BFS) algorithm to calculate the
      * minimum number of
      */
     getMinCostBetween(v1, v2, isWeight) {
@@ -5714,20 +5714,20 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm or DFS).
      * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm or DFS).
      *
-     * The function `getMinPathBetween` returns the minimum path between two vertices in a graph, either based on weight or
+     * The function `getMinPathBetween` returns the minimum path between two vertexMap in a graph, either based on weight or
      * using a breadth-first search algorithm.
      * @param {VO | VertexKey} v1 - The parameter `v1` represents the starting vertex of the path. It can be either a vertex
      * object (`VO`) or a vertex ID (`VertexKey`).
      * @param {VO | VertexKey} v2 - VO | VertexKey - The second vertex or vertex ID between which we want to find the minimum
      * path.
-     * @param {boolean} [isWeight] - A boolean flag indicating whether to consider the weight of edges in finding the
+     * @param {boolean} [isWeight] - A boolean flag indicating whether to consider the weight of edgeMap in finding the
      * minimum path. If set to true, the function will use Dijkstra's algorithm to find the minimum weighted path. If set
      * to false, the function will use breadth-first search (BFS) to find the minimum path.
      * @param isDFS - If set to true, it enforces the use of getAllPathsBetween to first obtain all possible paths,
      * followed by iterative computation of the shortest path. This approach may result in exponential time complexity,
      * so the default method is to use the Dijkstra algorithm to obtain the shortest weighted path.
-     * @returns The function `getMinPathBetween` returns an array of vertices (`VO[]`) representing the minimum path between
-     * two vertices (`v1` and `v2`). If there is no path between the vertices, it returns `undefined`.
+     * @returns The function `getMinPathBetween` returns an array of vertexMap (`VO[]`) representing the minimum path between
+     * two vertexMap (`v1` and `v2`). If there is no path between the vertexMap, it returns `undefined`.
      */
     getMinPathBetween(v1, v2, isWeight, isDFS = false) {
       var _a, _b;
@@ -5789,7 +5789,7 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(V^2 + E) - Quadratic time in the worst case (no heap optimization).
      * Space Complexity: O(V + E) - Depends on the implementation (Dijkstra's algorithm).
      *
-     * The function `dijkstraWithoutHeap` implements Dijkstra's algorithm to find the shortest path between two vertices in
+     * The function `dijkstraWithoutHeap` implements Dijkstra's algorithm to find the shortest path between two vertexMap in
      * a graph without using a heap data structure.
      * @param {VO | VertexKey} src - The source vertex from which to start the Dijkstra's algorithm. It can be either a
      * vertex object or a vertex ID.
@@ -5801,7 +5801,7 @@ var dataStructureTyped = (() => {
      * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
      * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
      * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
-     * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
+     * shortest paths from the source vertex to all other vertexMap in the graph. If `genPaths
      * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<VO>`.
      */
     dijkstraWithoutHeap(src, dest, getMinDist, genPaths) {
@@ -5815,7 +5815,7 @@ var dataStructureTyped = (() => {
       let minDest = void 0;
       let minPath = [];
       const paths = [];
-      const vertices = this._vertices;
+      const vertexMap = this._vertexMap;
       const distMap = /* @__PURE__ */ new Map();
       const seen = /* @__PURE__ */ new Set();
       const preMap = /* @__PURE__ */ new Map();
@@ -5824,7 +5824,7 @@ var dataStructureTyped = (() => {
       if (!srcVertex) {
         return void 0;
       }
-      for (const vertex of vertices) {
+      for (const vertex of vertexMap) {
         const vertexOrKey = vertex[1];
         if (vertexOrKey instanceof AbstractVertex)
           distMap.set(vertexOrKey, Infinity);
@@ -5845,7 +5845,7 @@ var dataStructureTyped = (() => {
         return minV;
       };
       const getPaths = (minV) => {
-        for (const vertex of vertices) {
+        for (const vertex of vertexMap) {
           const vertexOrKey = vertex[1];
           if (vertexOrKey instanceof AbstractVertex) {
             const path = [vertexOrKey];
@@ -5861,7 +5861,7 @@ var dataStructureTyped = (() => {
           }
         }
       };
-      for (let i = 1; i < vertices.size; i++) {
+      for (let i = 1; i < vertexMap.size; i++) {
         const cur = getMinOfNoSeen();
         if (cur) {
           seen.add(cur);
@@ -5908,7 +5908,7 @@ var dataStructureTyped = (() => {
        *  Dijkstra algorithm time: O(logVE) space: O(VO + EO)
        *
        * Dijkstra's algorithm only solves the single-source shortest path problem, while the Bellman-Ford algorithm and Floyd-Warshall algorithm can address shortest paths between all pairs of nodes.
-       * Dijkstra's algorithm is suitable for graphs with non-negative edge weights, whereas the Bellman-Ford algorithm and Floyd-Warshall algorithm can handle negative-weight edges.
+       * Dijkstra's algorithm is suitable for graphs with non-negative edge weights, whereas the Bellman-Ford algorithm and Floyd-Warshall algorithm can handle negative-weight edgeMap.
        * The time complexity of Dijkstra's algorithm and the Bellman-Ford algorithm depends on the size of the graph, while the time complexity of the Floyd-Warshall algorithm is O(VO^3), where VO is the number of nodes. For dense graphs, Floyd-Warshall might become slower.
        *
        * /
@@ -5928,13 +5928,13 @@ var dataStructureTyped = (() => {
      * start. It can be either a vertex object or a vertex ID.
      * @param {VO | VertexKey | undefined} [dest] - The `dest` parameter is the destination vertex or vertex ID. It specifies the
      * vertex to which the shortest path is calculated from the source vertex. If no destination is provided, the algorithm
-     * will calculate the shortest paths to all other vertices from the source vertex.
+     * will calculate the shortest paths to all other vertexMap from the source vertex.
      * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
      * distance from the source vertex to the destination vertex should be calculated and returned in the result. If
      * `getMinDist` is set to `true`, the `minDist` property in the result will contain the minimum distance
      * @param {boolean} [genPaths] - The `genPaths` parameter is a boolean flag that determines whether or not to generate
      * paths in the Dijkstra algorithm. If `genPaths` is set to `true`, the algorithm will calculate and return the
-     * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
+     * shortest paths from the source vertex to all other vertexMap in the graph. If `genPaths
      * @returns The function `dijkstra` returns an object of type `DijkstraResult<VO>`.
      */
     dijkstra(src, dest, getMinDist, genPaths) {
@@ -5949,7 +5949,7 @@ var dataStructureTyped = (() => {
       let minDest = void 0;
       let minPath = [];
       const paths = [];
-      const vertices = this._vertices;
+      const vertexMap = this._vertexMap;
       const distMap = /* @__PURE__ */ new Map();
       const seen = /* @__PURE__ */ new Set();
       const preMap = /* @__PURE__ */ new Map();
@@ -5957,7 +5957,7 @@ var dataStructureTyped = (() => {
       const destVertex = dest ? this._getVertex(dest) : void 0;
       if (!srcVertex)
         return void 0;
-      for (const vertex of vertices) {
+      for (const vertex of vertexMap) {
         const vertexOrKey = vertex[1];
         if (vertexOrKey instanceof AbstractVertex)
           distMap.set(vertexOrKey, Infinity);
@@ -5967,7 +5967,7 @@ var dataStructureTyped = (() => {
       distMap.set(srcVertex, 0);
       preMap.set(srcVertex, void 0);
       const getPaths = (minV) => {
-        for (const vertex of vertices) {
+        for (const vertex of vertexMap) {
           const vertexOrKey = vertex[1];
           if (vertexOrKey instanceof AbstractVertex) {
             const path = [vertexOrKey];
@@ -6045,16 +6045,16 @@ var dataStructureTyped = (() => {
        * Space Complexity: O(V + E) - Depends on the implementation (Bellman-Ford algorithm).
        *
        * one to rest pairs
-       * The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edges for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edges, the Bellman-Ford algorithm is more flexible in some scenarios.
+       * The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edgeMap for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edgeMap, the Bellman-Ford algorithm is more flexible in some scenarios.
        * The `bellmanFord` function implements the Bellman-Ford algorithm to find the shortest path from a source vertex to
-       * all other vertices in a graph, and optionally detects negative cycles and generates the minimum path.
+       * all other vertexMap in a graph, and optionally detects negative cycles and generates the minimum path.
        * @param {VO | VertexKey} src - The `src` parameter is the source vertex from which the Bellman-Ford algorithm will
        * start calculating the shortest paths. It can be either a vertex object or a vertex ID.
        * @param {boolean} [scanNegativeCycle] - A boolean flag indicating whether to scan for negative cycles in the graph.
        * @param {boolean} [getMin] - The `getMin` parameter is a boolean flag that determines whether the algorithm should
-       * calculate the minimum distance from the source vertex to all other vertices in the graph. If `getMin` is set to
+       * calculate the minimum distance from the source vertex to all other vertexMap in the graph. If `getMin` is set to
        * `true`, the algorithm will find the minimum distance and update the `min` variable with the minimum
-       * @param {boolean} [genPath] - A boolean flag indicating whether to generate paths for all vertices from the source
+       * @param {boolean} [genPath] - A boolean flag indicating whether to generate paths for all vertexMap from the source
        * vertex.
        * @returns The function `bellmanFord` returns an object with the following properties:
        */
@@ -6074,20 +6074,20 @@ var dataStructureTyped = (() => {
         hasNegativeCycle = false;
       if (!srcVertex)
         return { hasNegativeCycle, distMap, preMap, paths, min, minPath };
-      const vertices = this._vertices;
-      const numOfVertices = vertices.size;
-      const edges = this.edgeSet();
-      const numOfEdges = edges.length;
-      this._vertices.forEach((vertex) => {
+      const vertexMap = this._vertexMap;
+      const numOfVertices = vertexMap.size;
+      const edgeMap = this.edgeSet();
+      const numOfEdges = edgeMap.length;
+      this._vertexMap.forEach((vertex) => {
         distMap.set(vertex, Infinity);
       });
       distMap.set(srcVertex, 0);
       for (let i = 1; i < numOfVertices; ++i) {
         for (let j = 0; j < numOfEdges; ++j) {
-          const ends = this.getEndsOfEdge(edges[j]);
+          const ends = this.getEndsOfEdge(edgeMap[j]);
           if (ends) {
             const [s, d] = ends;
-            const weight = edges[j].weight;
+            const weight = edgeMap[j].weight;
             const sWeight = distMap.get(s);
             const dWeight = distMap.get(d);
             if (sWeight !== void 0 && dWeight !== void 0) {
@@ -6112,7 +6112,7 @@ var dataStructureTyped = (() => {
         });
       }
       if (genPath) {
-        for (const vertex of vertices) {
+        for (const vertex of vertexMap) {
           const vertexOrKey = vertex[1];
           if (vertexOrKey instanceof AbstractVertex) {
             const path = [vertexOrKey];
@@ -6129,10 +6129,10 @@ var dataStructureTyped = (() => {
         }
       }
       for (let j = 0; j < numOfEdges; ++j) {
-        const ends = this.getEndsOfEdge(edges[j]);
+        const ends = this.getEndsOfEdge(edgeMap[j]);
         if (ends) {
           const [s] = ends;
-          const weight = edges[j].weight;
+          const weight = edgeMap[j].weight;
           const sWeight = distMap.get(s);
           if (sWeight) {
             if (sWeight !== Infinity && sWeight + weight < sWeight)
@@ -6153,7 +6153,7 @@ var dataStructureTyped = (() => {
     /**
      * BellmanFord time:O(VE) space:O(VO)
      * one to rest pairs
-     * The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edges for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edges, the Bellman-Ford algorithm is more flexible in some scenarios.
+     * The Bellman-Ford algorithm is also used to find the shortest paths from a source node to all other nodes in a graph. Unlike Dijkstra's algorithm, it can handle edge weights that are negative. Its basic idea involves iterative relaxation of all edgeMap for several rounds to gradually approximate the shortest paths. Due to its ability to handle negative-weight edgeMap, the Bellman-Ford algorithm is more flexible in some scenarios.
      * The `bellmanFord` function implements the Bellman-Ford algorithm to find the shortest path from a source vertex to
      */
     /**
@@ -6161,7 +6161,7 @@ var dataStructureTyped = (() => {
        * Space Complexity: O(V^2) - Quadratic space (Floyd-Warshall algorithm).
        * Not support graph with negative weight cycle
        * all pairs
-       * The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edges, and it can simultaneously compute shortest paths between any two nodes.
+       * The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edgeMap, and it can simultaneously compute shortest paths between any two nodes.
        * /
     
        /**
@@ -6170,17 +6170,17 @@ var dataStructureTyped = (() => {
        *
        * Not support graph with negative weight cycle
        * all pairs
-       * The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edges, and it can simultaneously compute shortest paths between any two nodes.
-       * The function implements the Floyd-Warshall algorithm to find the shortest path between all pairs of vertices in a
+       * The Floyd-Warshall algorithm is used to find the shortest paths between all pairs of nodes in a graph. It employs dynamic programming to compute the shortest paths from any node to any other node. The Floyd-Warshall algorithm's advantage lies in its ability to handle graphs with negative-weight edgeMap, and it can simultaneously compute shortest paths between any two nodes.
+       * The function implements the Floyd-Warshall algorithm to find the shortest path between all pairs of vertexMap in a
        * graph.
        * @returns The function `floydWarshall()` returns an object with two properties: `costs` and `predecessor`. The `costs`
-       * property is a 2D array of numbers representing the shortest path costs between vertices in a graph. The
-       * `predecessor` property is a 2D array of vertices (or `undefined`) representing the predecessor vertices in the shortest
-       * path between vertices in the
+       * property is a 2D array of numbers representing the shortest path costs between vertexMap in a graph. The
+       * `predecessor` property is a 2D array of vertexMap (or `undefined`) representing the predecessor vertexMap in the shortest
+       * path between vertexMap in the
        */
     floydWarshall() {
       var _a;
-      const idAndVertices = [...this._vertices];
+      const idAndVertices = [...this._vertexMap];
       const n = idAndVertices.length;
       const costs = [];
       const predecessor = [];
@@ -6213,7 +6213,7 @@ var dataStructureTyped = (() => {
        * Space Complexity: O(V) - Linear space (Tarjan's algorithm).
        * Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
        * Tarjan can find cycles in directed or undirected graph
-       * Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time,
+       * Tarjan can find the articulation points and bridges(critical edgeMap) of undirected graphs in linear time,
        * Tarjan solve the bi-connected components of undirected graphs;
        * Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs.
        * /
@@ -6224,22 +6224,22 @@ var dataStructureTyped = (() => {
        *
        * Tarjan is an algorithm based on dfs,which is used to solve the connectivity problem of graphs.
        * Tarjan can find cycles in directed or undirected graph
-       * Tarjan can find the articulation points and bridges(critical edges) of undirected graphs in linear time,
+       * Tarjan can find the articulation points and bridges(critical edgeMap) of undirected graphs in linear time,
        * Tarjan solve the bi-connected components of undirected graphs;
        * Tarjan can find the SSC(strongly connected components), articulation points, and bridges of directed graphs.
        * The `tarjan` function is used to perform various graph analysis tasks such as finding articulation points, bridges,
        * strongly connected components (SCCs), and cycles in a graph.
        * @param {boolean} [needCutVertexes] - A boolean value indicating whether or not to calculate and return the
-       * articulation points in the graph. Articulation points are the vertices in a graph whose removal would increase the
+       * articulation points in the graph. Articulation points are the vertexMap in a graph whose removal would increase the
        * number of connected components in the graph.
        * @param {boolean} [needBridges] - A boolean flag indicating whether the algorithm should find and return the bridges
-       * (edges whose removal would increase the number of connected components in the graph).
+       * (edgeMap whose removal would increase the number of connected components in the graph).
        * @param {boolean} [needSCCs] - A boolean value indicating whether the Strongly Connected Components (SCCs) of the
        * graph are needed. If set to true, the function will calculate and return the SCCs of the graph. If set to false, the
        * SCCs will not be calculated or returned.
        * @param {boolean} [needCycles] - A boolean flag indicating whether the algorithm should find cycles in the graph. If
        * set to true, the algorithm will return a map of cycles, where the keys are the low values of the SCCs and the values
-       * are arrays of vertices that form cycles within the SCCs.
+       * are arrays of vertexMap that form cycles within the SCCs.
        * @returns The function `tarjan` returns an object with the following properties:
        */
     tarjan(needCutVertexes = false, needBridges = false, needSCCs = true, needCycles = false) {
@@ -6254,12 +6254,12 @@ var dataStructureTyped = (() => {
         needCycles = defaultConfig;
       const dfnMap = /* @__PURE__ */ new Map();
       const lowMap = /* @__PURE__ */ new Map();
-      const vertices = this._vertices;
-      vertices.forEach((v) => {
+      const vertexMap = this._vertexMap;
+      vertexMap.forEach((v) => {
         dfnMap.set(v, -1);
         lowMap.set(v, Infinity);
       });
-      const [root] = vertices.values();
+      const [root] = vertexMap.values();
       const cutVertexes = [];
       const bridges = [];
       let dfn = 0;
@@ -6441,7 +6441,7 @@ var dataStructureTyped = (() => {
       return mapped;
     }
     *_getIterator() {
-      for (const vertex of this._vertices.values()) {
+      for (const vertex of this._vertexMap.values()) {
         yield [vertex.key, vertex.value];
       }
     }
@@ -6449,12 +6449,12 @@ var dataStructureTyped = (() => {
       if (this.hasVertex(newVertex)) {
         return false;
       }
-      this._vertices.set(newVertex.key, newVertex);
+      this._vertexMap.set(newVertex.key, newVertex);
       return true;
     }
     _getVertex(vertexOrKey) {
       const vertexKey = this._getVertexKey(vertexOrKey);
-      return this._vertices.get(vertexKey) || void 0;
+      return this._vertexMap.get(vertexKey) || void 0;
     }
     _getVertexKey(vertexOrKey) {
       return vertexOrKey instanceof AbstractVertex ? vertexOrKey.key : vertexOrKey;
@@ -6476,7 +6476,7 @@ var dataStructureTyped = (() => {
   };
   var DirectedEdge = class extends 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.
@@ -6516,7 +6516,7 @@ var dataStructureTyped = (() => {
     /**
      * 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
@@ -6530,7 +6530,7 @@ var dataStructureTyped = (() => {
      * 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
@@ -6543,43 +6543,43 @@ var dataStructureTyped = (() => {
       return new DirectedEdge(src, dest, weight != null ? 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 !== void 0 && destOrKey !== void 0) {
         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] || void 0;
+      return edgeMap[0] || void 0;
     }
     /**
-     * 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.
@@ -6602,11 +6602,11 @@ var dataStructureTyped = (() => {
       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 `deleteEdge` function removes an edge from a graph and returns the removed edge.
@@ -6671,22 +6671,22 @@ var dataStructureTyped = (() => {
         this._outEdgeMap.delete(vertex);
         this._inEdgeMap.delete(vertex);
       }
-      return this._vertices.delete(vertexKey);
+      return this._vertexMap.delete(vertexKey);
     }
     /**
-     * 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 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 = [];
@@ -6706,10 +6706,10 @@ var dataStructureTyped = (() => {
      * 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);
@@ -6726,10 +6726,10 @@ var dataStructureTyped = (() => {
      * 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);
@@ -6761,9 +6761,9 @@ var dataStructureTyped = (() => {
      * 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;
@@ -6776,9 +6776,9 @@ var dataStructureTyped = (() => {
      * 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;
@@ -6791,9 +6791,9 @@ var dataStructureTyped = (() => {
      * 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)];
@@ -6829,17 +6829,17 @@ var dataStructureTyped = (() => {
       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 === void 0) {
@@ -6856,24 +6856,24 @@ var dataStructureTyped = (() => {
       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 : "key";
       const statusMap = /* @__PURE__ */ new Map();
-      for (const entry of this.vertices) {
+      for (const entry of this.vertexMap) {
         statusMap.set(entry[1], 0);
       }
       let sorted = [];
@@ -6892,7 +6892,7 @@ var dataStructureTyped = (() => {
         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]);
         }
@@ -6904,35 +6904,35 @@ var dataStructureTyped = (() => {
       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 = [];
@@ -6956,10 +6956,10 @@ var dataStructureTyped = (() => {
      * 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) {
@@ -6982,7 +6982,7 @@ var dataStructureTyped = (() => {
      * 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
@@ -7040,21 +7040,21 @@ var dataStructureTyped = (() => {
      */
     constructor(v1, v2, weight, value) {
       super(weight, value);
-      __publicField(this, "vertices");
-      this.vertices = [v1, v2];
+      __publicField(this, "vertexMap");
+      this.vertexMap = [v1, v2];
     }
   };
   var UndirectedGraph = class extends AbstractGraph {
     /**
-     * The constructor initializes a new Map object to store edges.
+     * The constructor initializes a new Map object to store edgeMap.
      */
     constructor() {
       super();
-      __publicField(this, "_edges");
-      this._edges = /* @__PURE__ */ new Map();
+      __publicField(this, "_edgeMap");
+      this._edgeMap = /* @__PURE__ */ new Map();
     }
-    get edges() {
-      return this._edges;
+    get edgeMap() {
+      return this._edgeMap;
     }
     /**
      * The function creates a new vertex with an optional value and returns it.
@@ -7069,7 +7069,7 @@ var dataStructureTyped = (() => {
       return new UndirectedVertex(key, value != null ? value : key);
     }
     /**
-     * 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
@@ -7082,14 +7082,14 @@ var dataStructureTyped = (() => {
       return new UndirectedEdge(v1, v2, weight != null ? weight : 1, value);
     }
     /**
-     * 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
@@ -7098,29 +7098,29 @@ var dataStructureTyped = (() => {
      */
     getEdge(v1, v2) {
       var _a;
-      let edges = [];
+      let edgeMap = [];
       if (v1 !== void 0 && v2 !== void 0) {
         const vertex1 = this._getVertex(v1);
         const vertex2 = this._getVertex(v2);
         if (vertex1 && vertex2) {
-          edges = (_a = this._edges.get(vertex1)) == null ? void 0 : _a.filter((e) => e.vertices.includes(vertex2.key));
+          edgeMap = (_a = this._edgeMap.get(vertex1)) == null ? void 0 : _a.filter((e) => e.vertexMap.includes(vertex2.key));
         }
       }
-      return edges ? edges[0] || void 0 : void 0;
+      return edgeMap ? edgeMap[0] || void 0 : void 0;
     }
     /**
-     * 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, v2) {
       const vertex1 = this._getVertex(v1);
@@ -7128,26 +7128,26 @@ var dataStructureTyped = (() => {
       if (!vertex1 || !vertex2) {
         return void 0;
       }
-      const v1Edges = this._edges.get(vertex1);
+      const v1Edges = this._edgeMap.get(vertex1);
       let removed = void 0;
       if (v1Edges) {
-        removed = arrayRemove(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || void 0;
+        removed = arrayRemove(v1Edges, (e) => e.vertexMap.includes(vertex2.key))[0] || void 0;
       }
-      const v2Edges = this._edges.get(vertex2);
+      const v2Edges = this._edgeMap.get(vertex2);
       if (v2Edges) {
-        arrayRemove(v2Edges, (e) => e.vertices.includes(vertex1.key));
+        arrayRemove(v2Edges, (e) => e.vertexMap.includes(vertex1.key));
       }
       return removed;
     }
     /**
-     * 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 `deleteEdge` deletes an edge between two vertices in a graph.
+     * 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
@@ -7166,8 +7166,8 @@ var dataStructureTyped = (() => {
           return;
         }
       } else {
-        oneSide = this._getVertex(edgeOrOneSideVertexKey.vertices[0]);
-        otherSide = this._getVertex(edgeOrOneSideVertexKey.vertices[1]);
+        oneSide = this._getVertex(edgeOrOneSideVertexKey.vertexMap[0]);
+        otherSide = this._getVertex(edgeOrOneSideVertexKey.vertexMap[1]);
       }
       if (oneSide && otherSide) {
         return this.deleteEdgeBetween(oneSide, otherSide);
@@ -7201,17 +7201,17 @@ var dataStructureTyped = (() => {
       const neighbors = this.getNeighbors(vertexOrKey);
       if (vertex) {
         neighbors.forEach((neighbor) => {
-          const neighborEdges = this._edges.get(neighbor);
+          const neighborEdges = this._edgeMap.get(neighbor);
           if (neighborEdges) {
             const restEdges = neighborEdges.filter((edge) => {
-              return !edge.vertices.includes(vertexKey);
+              return !edge.vertexMap.includes(vertexKey);
             });
-            this._edges.set(neighbor, restEdges);
+            this._edgeMap.set(neighbor, restEdges);
           }
         });
-        this._edges.delete(vertex);
+        this._edgeMap.delete(vertex);
       }
-      return this._vertices.delete(vertexKey);
+      return this._vertexMap.delete(vertexKey);
     }
     /**
      * Time Complexity: O(1)
@@ -7221,17 +7221,17 @@ var dataStructureTyped = (() => {
      * 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) {
       var _a;
       const vertex = this._getVertex(vertexOrKey);
       if (vertex) {
-        return ((_a = this._edges.get(vertex)) == null ? void 0 : _a.length) || 0;
+        return ((_a = this._edgeMap.get(vertex)) == null ? void 0 : _a.length) || 0;
       } else {
         return 0;
       }
@@ -7244,51 +7244,51 @@ var dataStructureTyped = (() => {
      * 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) {
       const vertex = this._getVertex(vertexOrKey);
       if (vertex) {
-        return this._edges.get(vertex) || [];
+        return this._edgeMap.get(vertex) || [];
       } else {
         return [];
       }
     }
     /**
-     * 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() {
       const edgeSet = /* @__PURE__ */ new Set();
-      this._edges.forEach((edges) => {
-        edges.forEach((edge) => {
+      this._edgeMap.forEach((edgeMap) => {
+        edgeMap.forEach((edge) => {
           edgeSet.add(edge);
         });
       });
       return [...edgeSet];
     }
     /**
-     * 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) {
       const neighbors = [];
@@ -7296,7 +7296,7 @@ var dataStructureTyped = (() => {
       if (vertex) {
         const neighborEdges = this.edgesOf(vertex);
         for (const edge of neighborEdges) {
-          const neighbor = this._getVertex(edge.vertices.filter((e) => e !== vertex.key)[0]);
+          const neighbor = this._getVertex(edge.vertexMap.filter((e) => e !== vertex.key)[0]);
           if (neighbor) {
             neighbors.push(neighbor);
           }
@@ -7312,18 +7312,18 @@ var dataStructureTyped = (() => {
      * 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) {
-      if (!this.hasEdge(edge.vertices[0], edge.vertices[1])) {
+      if (!this.hasEdge(edge.vertexMap[0], edge.vertexMap[1])) {
         return void 0;
       }
-      const v1 = this._getVertex(edge.vertices[0]);
-      const v2 = this._getVertex(edge.vertices[1]);
+      const v1 = this._getVertex(edge.vertexMap[0]);
+      const v2 = this._getVertex(edge.vertexMap[1]);
       if (v1 && v2) {
         return [v1, v2];
       } else {
@@ -7338,21 +7338,21 @@ var dataStructureTyped = (() => {
      * 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.
      */
     _addEdgeOnly(edge) {
-      for (const end of edge.vertices) {
+      for (const end of edge.vertexMap) {
         const endVertex = this._getVertex(end);
         if (endVertex === void 0)
           return false;
         if (endVertex) {
-          const edges = this._edges.get(endVertex);
-          if (edges) {
-            edges.push(edge);
+          const edgeMap = this._edgeMap.get(endVertex);
+          if (edgeMap) {
+            edgeMap.push(edge);
           } else {
-            this._edges.set(endVertex, [edge]);
+            this._edgeMap.set(endVertex, [edge]);
           }
         }
       }
@@ -7399,23 +7399,23 @@ var dataStructureTyped = (() => {
   };
   var MapGraph = class extends 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();
-      __publicField(this, "_origin", [0, 0]);
+      __publicField(this, "_originCoord", [0, 0]);
       __publicField(this, "_bottomRight");
-      this._origin = origin;
+      this._originCoord = originCoord;
       this._bottomRight = bottomRight;
     }
-    get origin() {
-      return this._origin;
+    get originCoord() {
+      return this._originCoord;
     }
     get bottomRight() {
       return this._bottomRight;
@@ -7431,7 +7431,7 @@ var dataStructureTyped = (() => {
      * @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);
     }
     /**
@@ -7534,7 +7534,7 @@ var dataStructureTyped = (() => {
       return "MAL_NODE" /* MAL_NODE */;
     }
   };
-  var BinaryTree = class _BinaryTree extends IterablePairBase {
+  var BinaryTree = class _BinaryTree extends IterableEntryBase {
     /**
      * The constructor function initializes a binary tree object with optional elements and options.
      * @param [elements] - An optional iterable of BTNodeExemplar objects. These objects represent the
@@ -7601,31 +7601,32 @@ var dataStructureTyped = (() => {
       return exemplar instanceof BinaryTreeNode;
     }
     /**
-     * The function `exemplarToNode` converts an exemplar of a binary tree node into an actual node
-     * object.
-     * @param exemplar - BTNodeExemplar<K, V,N> - A generic type representing the exemplar parameter of the
-     * function. It can be any type.
-     * @returns a value of type `N` (which represents a node), or `null`, or `undefined`.
+     * The function `exemplarToNode` converts an exemplar object into a node object.
+     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`.
+     * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
+     * `exemplarToNode` function. It represents the value associated with the exemplar node. If no value
+     * is provided, it will be `undefined`.
+     * @returns a value of type N (node), or null, or undefined.
      */
-    exemplarToNode(exemplar) {
+    exemplarToNode(exemplar, value) {
       if (exemplar === void 0)
         return;
       let node;
       if (exemplar === null) {
         node = null;
       } else if (this.isEntry(exemplar)) {
-        const [key, value] = exemplar;
+        const [key, value2] = exemplar;
         if (key === void 0) {
           return;
         } else if (key === null) {
           node = null;
         } else {
-          node = this.createNode(key, value);
+          node = this.createNode(key, value2);
         }
       } else if (this.isNode(exemplar)) {
         node = exemplar;
       } else if (this.isNotNodeInstance(exemplar)) {
-        node = this.createNode(exemplar);
+        node = this.createNode(exemplar, value);
       } else {
         return;
       }
@@ -7647,14 +7648,16 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity O(log n) - O(n)
      * Space Complexity O(1)
-     *
-     * The `add` function adds a new node to a binary tree, either by key or by providing a node object.
-     * @param keyOrNodeOrEntry - The parameter `keyOrNodeOrEntry` can be one of the following:
-     * @returns The function `add` returns the inserted node (`N`), `null`, or `undefined`.
+     * 
+     * The `add` function adds a new node to a binary tree, either by creating a new node or replacing an
+     * existing node with the same key.
+     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be one of the following:
+     * @param {V} [value] - The value to be inserted into the binary tree.
+     * @returns The function `add` returns either a node (`N`), `null`, or `undefined`.
      */
-    add(keyOrNodeOrEntry) {
+    add(keyOrNodeOrEntry, value) {
       let inserted;
-      const newNode = this.exemplarToNode(keyOrNodeOrEntry);
+      const newNode = this.exemplarToNode(keyOrNodeOrEntry, value);
       if (newNode === void 0)
         return;
       const _bfs = (root, newNode2) => {
@@ -9199,26 +9202,28 @@ var dataStructureTyped = (() => {
       return exemplar instanceof BSTNode;
     }
     /**
-     * The function `exemplarToNode` takes an exemplar and returns a corresponding node if the exemplar
-     * is valid, otherwise it returns undefined.
-     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`.
-     * @returns a variable `node` which is of type `N` or `undefined`.
+     * The function `exemplarToNode` takes an exemplar and returns a node if the exemplar is valid,
+     * otherwise it returns undefined.
+     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`, where:
+     * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
+     * `exemplarToNode` function. It represents the value associated with the exemplar node.
+     * @returns a node of type N or undefined.
      */
-    exemplarToNode(exemplar) {
+    exemplarToNode(exemplar, value) {
       let node;
       if (exemplar === null || exemplar === void 0) {
         return;
       } else if (this.isNode(exemplar)) {
         node = exemplar;
       } else if (this.isEntry(exemplar)) {
-        const [key, value] = exemplar;
+        const [key, value2] = exemplar;
         if (key === void 0 || key === null) {
           return;
         } else {
-          node = this.createNode(key, value);
+          node = this.createNode(key, value2);
         }
       } else if (this.isNotNodeInstance(exemplar)) {
-        node = this.createNode(exemplar);
+        node = this.createNode(exemplar, value);
       } else {
         return;
       }
@@ -9231,15 +9236,17 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(log n) - Average case for a balanced tree. In the worst case (unbalanced tree), it can be O(n).
      * Space Complexity: O(1) - Constant space is used.
-     *
-     * The `add` function adds a new node to a binary search tree, either by key or by providing a node
-     * object.
-     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be one of the following:
-     * @returns The method returns either the newly added node (`newNode`) or `undefined` if the input
-     * (`keyOrNodeOrEntry`) is null, undefined, or does not match any of the expected types.
-     */
-    add(keyOrNodeOrEntry) {
-      const newNode = this.exemplarToNode(keyOrNodeOrEntry);
+     * 
+     * The `add` function adds a new node to a binary tree, updating the value if the key already exists
+     * or inserting a new node if the key is unique.
+     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can accept three types of values:
+     * @param {V} [value] - The `value` parameter represents the value associated with the key that is
+     * being added to the binary tree.
+     * @returns The method `add` returns either the newly added node (`newNode`) or `undefined` if the
+     * node was not added.
+     */
+    add(keyOrNodeOrEntry, value) {
+      const newNode = this.exemplarToNode(keyOrNodeOrEntry, value);
       if (newNode === void 0)
         return;
       if (this.root === void 0) {
@@ -10214,17 +10221,19 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (BST) has logarithmic time complexity.
      * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
-     *
+     * 
      * The function overrides the add method of a binary tree node and balances the tree after inserting
      * a new node.
-     * @param keyOrNodeOrEntry - The parameter `keyOrNodeOrEntry` can be either a key, a node, or an
+     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be either a key, a node, or an
      * entry.
-     * @returns The method is returning either the inserted node or `undefined`.
+     * @param {V} [value] - The `value` parameter represents the value associated with the key that is
+     * being added to the binary tree.
+     * @returns The method is returning either the inserted node or undefined.
      */
-    add(keyOrNodeOrEntry) {
+    add(keyOrNodeOrEntry, value) {
       if (keyOrNodeOrEntry === null)
         return void 0;
-      const inserted = super.add(keyOrNodeOrEntry);
+      const inserted = super.add(keyOrNodeOrEntry, value);
       if (inserted)
         this._balancePath(inserted);
       return inserted;
@@ -10637,28 +10646,28 @@ var dataStructureTyped = (() => {
       return exemplar instanceof RedBlackTreeNode;
     }
     /**
-     * The function `exemplarToNode` takes an exemplar and returns a node if the exemplar is valid,
-     * otherwise it returns undefined.
-     * @param exemplar - BTNodeExemplar<K, V, N> - A generic type representing an exemplar of a binary tree
-     * node. It can be either a node itself, an entry (key-value pair), a node key, or any other value
-     * that is not a valid exemplar.
-     * @returns a variable `node` which is of type `N | undefined`.
+     * The function `exemplarToNode` takes an exemplar and converts it into a node object if possible.
+     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`, where:
+     * @param {V} [value] - The `value` parameter is an optional value that can be passed to the
+     * `exemplarToNode` function. It represents the value associated with the exemplar node. If a value
+     * is provided, it will be used when creating the new node. If no value is provided, the new node
+     * @returns a node of type N or undefined.
      */
-    exemplarToNode(exemplar) {
+    exemplarToNode(exemplar, value) {
       let node;
       if (exemplar === null || exemplar === void 0) {
         return;
       } else if (this.isNode(exemplar)) {
         node = exemplar;
       } else if (this.isEntry(exemplar)) {
-        const [key, value] = exemplar;
+        const [key, value2] = exemplar;
         if (key === void 0 || key === null) {
           return;
         } else {
-          node = this.createNode(key, value, 1 /* RED */);
+          node = this.createNode(key, value2, 1 /* RED */);
         }
       } else if (this.isNotNodeInstance(exemplar)) {
-        node = this.createNode(exemplar, void 0, 1 /* RED */);
+        node = this.createNode(exemplar, value, 1 /* RED */);
       } else {
         return;
       }
@@ -10669,13 +10678,19 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      */
     /**
-     * The function adds a node to a Red-Black Tree data structure.
-     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be one of the following:
-     * @returns The method `add` returns either an instance of `N` (the node that was added) or
-     * `undefined`.
+     * Time Complexity: O(log n) on average (where n is the number of nodes in the tree)
+     * Space Complexity: O(1)
+     * 
+     * The `add` function adds a new node to a binary search tree and performs necessary rotations and
+     * color changes to maintain the red-black tree properties.
+     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be either a key, a node, or an
+     * entry.
+     * @param {V} [value] - The `value` parameter represents the value associated with the key that is
+     * being added to the binary search tree.
+     * @returns The method `add` returns either the newly added node (`N`) or `undefined`.
      */
-    add(keyOrNodeOrEntry) {
-      const newNode = this.exemplarToNode(keyOrNodeOrEntry);
+    add(keyOrNodeOrEntry, value) {
+      const newNode = this.exemplarToNode(keyOrNodeOrEntry, value);
       if (newNode === void 0)
         return;
       newNode.left = this.Sentinel;
@@ -11176,27 +11191,30 @@ var dataStructureTyped = (() => {
     }
     /**
      * The function `exemplarToNode` converts an exemplar object into a node object.
-     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`, where `V` represents
-     * the value type and `N` represents the node type.
+     * @param exemplar - The `exemplar` parameter is of type `BTNodeExemplar<K, V, N>`, which means it
+     * can be one of the following:
+     * @param {V} [value] - The `value` parameter is an optional argument that represents the value
+     * associated with the node. It is of type `V`, which can be any data type. If no value is provided,
+     * it defaults to `undefined`.
      * @param [count=1] - The `count` parameter is an optional parameter that specifies the number of
-     * times the node should be created. If not provided, it defaults to 1.
-     * @returns a value of type `N` (the generic type parameter) or `undefined`.
+     * times the value should be added to the node. If not provided, it defaults to 1.
+     * @returns a node of type `N` or `undefined`.
      */
-    exemplarToNode(exemplar, count = 1) {
+    exemplarToNode(exemplar, value, count = 1) {
       let node;
       if (exemplar === void 0 || exemplar === null) {
         return;
       } else if (this.isNode(exemplar)) {
         node = exemplar;
       } else if (this.isEntry(exemplar)) {
-        const [key, value] = exemplar;
+        const [key, value2] = exemplar;
         if (key === void 0 || key === null) {
           return;
         } else {
-          node = this.createNode(key, value, count);
+          node = this.createNode(key, value2, count);
         }
       } else if (this.isNotNodeInstance(exemplar)) {
-        node = this.createNode(exemplar, void 0, count);
+        node = this.createNode(exemplar, value, count);
       } else {
         return;
       }
@@ -11209,17 +11227,21 @@ var dataStructureTyped = (() => {
     /**
      * Time Complexity: O(log n) - logarithmic time, where "n" is the number of nodes in the tree. The add method of the superclass (AVLTree) has logarithmic time complexity.
      * Space Complexity: O(1) - constant space, as it doesn't use additional data structures that scale with input size.
-     *
-     * The `add` function overrides the base class `add` function to add a new node to the tree multimap
-     * and update the count.
-     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be one of the following:
-     * @param [count=1] - The `count` parameter is an optional parameter that specifies the number of
-     * times the key or node or entry should be added to the multimap. If not provided, the default value
-     * is 1.
-     * @returns either a node (`N`) or `undefined`.
-     */
-    add(keyOrNodeOrEntry, count = 1) {
-      const newNode = this.exemplarToNode(keyOrNodeOrEntry, count);
+     * 
+     * The function overrides the add method of a binary tree node and adds a new node to the tree.
+     * @param keyOrNodeOrEntry - The `keyOrNodeOrEntry` parameter can be either a key, a node, or an
+     * entry. It represents the key, node, or entry that you want to add to the binary tree.
+     * @param {V} [value] - The `value` parameter represents the value associated with the key in the
+     * binary tree node. It is an optional parameter, meaning it can be omitted when calling the `add`
+     * method.
+     * @param [count=1] - The `count` parameter represents the number of times the key-value pair should
+     * be added to the binary tree. By default, it is set to 1, meaning that the key-value pair will be
+     * added once. However, you can specify a different value for `count` if you want to add
+     * @returns The method is returning either the newly inserted node or `undefined` if the insertion
+     * was not successful.
+     */
+    add(keyOrNodeOrEntry, value, count = 1) {
+      const newNode = this.exemplarToNode(keyOrNodeOrEntry, value, count);
       if (newNode === void 0)
         return;
       const orgNodeCount = (newNode == null ? void 0 : newNode.count) || 0;
@@ -11272,7 +11294,7 @@ var dataStructureTyped = (() => {
             return;
           const m = l + Math.floor((r - l) / 2);
           const midNode = sorted[m];
-          this.add([midNode.key, midNode.value], midNode.count);
+          this.add(midNode.key, midNode.value, midNode.count);
           buildBalanceBST(l, m - 1);
           buildBalanceBST(m + 1, r);
         };
@@ -11287,7 +11309,7 @@ var dataStructureTyped = (() => {
             if (l <= r) {
               const m = l + Math.floor((r - l) / 2);
               const midNode = sorted[m];
-              this.add([midNode.key, midNode.value], midNode.count);
+              this.add(midNode.key, midNode.value, midNode.count);
               stack.push([m + 1, r]);
               stack.push([l, m - 1]);
             }
@@ -11395,7 +11417,7 @@ var dataStructureTyped = (() => {
      */
     clone() {
       const cloned = this.createTree();
-      this.bfs((node) => cloned.add([node.key, node.value], node.count));
+      this.bfs((node) => cloned.add(node.key, node.value, node.count));
       return cloned;
     }
     /**