min-heap-typed 1.49.3 → 1.49.4

package/dist/data-structures/binary-tree/binary-tree.d.ts

@@ -525,7 +525,7 @@ export declare class BinaryTree<K = any, V = any, N extends BinaryTreeNode<K, V,
     print(beginRoot?: BTNKeyOrNode<K, N>, options?: BinaryTreePrintOptions): void;
     protected _getIterator(node?: N | null | undefined): IterableIterator<[K, V | undefined]>;
     protected _displayAux(node: N | null | undefined, options: BinaryTreePrintOptions): NodeDisplayLayout;
-    protected _defaultOneParamCallback: (node: N) => K;
+    protected _defaultOneParamCallback: (node: N | null | undefined) => K | undefined;
     /**
      * Swap the data of two nodes in the binary tree.
      * @param {N} srcNode - The source node to swap.

package/dist/data-structures/binary-tree/binary-tree.js

@@ -80,7 +80,7 @@ class BinaryTree extends base_1.IterableEntryBase {
         super();
         this.iterationType = types_1.IterationType.ITERATIVE;
         this._extractor = (key) => Number(key);
-        this._defaultOneParamCallback = (node) => node.key;
+        this._defaultOneParamCallback = (node) => node ? node.key : undefined;
         if (options) {
             const { iterationType, extractor } = options;
             if (iterationType) {

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

@@ -99,16 +99,7 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * 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: VO | VertexKey): boolean;
+    abstract deleteVertex(vertexOrKey: VO | VertexKey): boolean;
     /**
      * 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.

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

@@ -97,23 +97,6 @@ class AbstractGraph extends base_1.IterableEntryBase {
         const potentialKeyType = typeof potentialKey;
         return potentialKeyType === "string" || potentialKeyType === "number";
     }
-    /**
-     * 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) {
-        const vertexKey = this._getVertexKey(vertexOrKey);
-        return this._vertexMap.delete(vertexKey);
-    }
     /**
      * 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.

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

@@ -212,6 +212,10 @@ class DirectedGraph extends abstract_graph_1.AbstractGraph {
             vertexKey = this._getVertexKey(vertexOrKey);
         }
         if (vertex) {
+            const neighbors = this.getNeighbors(vertex);
+            for (const neighbor of neighbors) {
+                this._inEdgeMap.delete(neighbor);
+            }
             this._outEdgeMap.delete(vertex);
             this._inEdgeMap.delete(vertex);
         }

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "min-heap-typed",
-  "version": "1.49.3",
+  "version": "1.49.4",
   "description": "Min Heap. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -132,6 +132,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.49.3"
+    "data-structure-typed": "^1.49.4"
   }
 }

package/src/data-structures/binary-tree/binary-tree.ts

@@ -1957,7 +1957,7 @@ export class BinaryTree<K = any, V = any, N extends BinaryTreeNode<K, V, N> = Bi
     }
   }
 
-  protected _defaultOneParamCallback = (node: N) => node.key;
+  protected _defaultOneParamCallback = (node: N | null | undefined) => node ? node.key : undefined;
 
   /**
    * Swap the data of two nodes in the binary tree.

package/src/data-structures/graph/abstract-graph.ts

@@ -173,19 +173,7 @@ export abstract class AbstractGraph<
    * 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: VO | VertexKey): boolean {
-    const vertexKey = this._getVertexKey(vertexOrKey);
-    return this._vertexMap.delete(vertexKey);
-  }
+  abstract deleteVertex(vertexOrKey: VO | VertexKey): boolean;
 
   /**
    * Time Complexity: O(K), where K is the number of vertexMap to be removed.

package/src/data-structures/graph/directed-graph.ts

@@ -240,7 +240,7 @@ export class DirectedGraph<
    * (`VertexKey`).
    * @returns The method is returning a boolean value.
    */
-  override deleteVertex(vertexOrKey: VO | VertexKey): boolean {
+  deleteVertex(vertexOrKey: VO | VertexKey): boolean {
     let vertexKey: VertexKey;
     let vertex: VO | undefined;
     if (this.isVertexKey(vertexOrKey)) {
@@ -252,8 +252,12 @@ export class DirectedGraph<
     }
 
     if (vertex) {
-      this._outEdgeMap.delete(vertex)
-      this._inEdgeMap.delete(vertex)
+      const neighbors = this.getNeighbors(vertex);
+      for (const neighbor of neighbors) {
+        this._inEdgeMap.delete(neighbor);
+      }
+      this._outEdgeMap.delete(vertex);
+      this._inEdgeMap.delete(vertex);
     }
 
     return this._vertexMap.delete(vertexKey);

package/src/data-structures/graph/undirected-graph.ts

@@ -212,7 +212,7 @@ export class UndirectedGraph<
    * (`VertexKey`).
    * @returns The method is returning a boolean value.
    */
-  override deleteVertex(vertexOrKey: VO | VertexKey): boolean {
+  deleteVertex(vertexOrKey: VO | VertexKey): boolean {
     let vertexKey: VertexKey;
     let vertex: VO | undefined;
     if (this.isVertexKey(vertexOrKey)) {

package/src/data-structures/linked-list/singly-linked-list.ts

@@ -33,8 +33,7 @@ export class SinglyLinkedList<E = any> extends IterableElementBase<E> {
     this._tail = undefined;
     this._size = 0;
     if (elements) {
-      for (const el of elements)
-        this.push(el);
+      for (const el of elements) this.push(el);
     }
   }