data-structure-typed 1.47.7 → 1.47.9

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

@@ -868,7 +868,7 @@ var dataStructureTyped = (() => {
   // src/data-structures/linked-list/singly-linked-list.ts
   var SinglyLinkedListNode = class {
     /**
-     * The constructor function initializes an instance of a class with a given value and sets the next property to null.
+     * The constructor function initializes an instance of a class with a given value and sets the next property to undefined.
      * @param {E} value - The "value" parameter is of type E, which means it can be any data type. It represents the value that
      * will be stored in the node of a linked list.
      */
@@ -876,7 +876,7 @@ var dataStructureTyped = (() => {
       __publicField(this, "value");
       __publicField(this, "next");
       this.value = value;
-      this.next = null;
+      this.next = void 0;
     }
   };
   var SinglyLinkedList = class _SinglyLinkedList {
@@ -887,8 +887,8 @@ var dataStructureTyped = (() => {
       __publicField(this, "_head");
       __publicField(this, "_tail");
       __publicField(this, "_length");
-      this._head = null;
-      this._tail = null;
+      this._head = void 0;
+      this._tail = void 0;
       this._length = 0;
       if (elements) {
         for (const el of elements)
@@ -973,15 +973,15 @@ var dataStructureTyped = (() => {
      * The `pop()` function removes and returns the value of the last element in a linked list, updating the head and tail
      * pointers accordingly.
      * @returns The method `pop()` returns the value of the node that is being removed from the end of the linked list. If
-     * the linked list is empty, it returns `null`.
+     * the linked list is empty, it returns `undefined`.
      */
     pop() {
       if (!this.head)
         return void 0;
       if (this.head === this.tail) {
         const value2 = this.head.value;
-        this._head = null;
-        this._tail = null;
+        this._head = void 0;
+        this._tail = void 0;
         this._length--;
         return value2;
       }
@@ -990,7 +990,7 @@ var dataStructureTyped = (() => {
         current = current.next;
       }
       const value = this.tail.value;
-      current.next = null;
+      current.next = void 0;
       this._tail = current;
       this._length--;
       return value;
@@ -1006,7 +1006,7 @@ var dataStructureTyped = (() => {
      * The `popLast()` function removes and returns the value of the last element in a linked list, updating the head and tail
      * pointers accordingly.
      * @returns The method `pop()` returns the value of the node that is being removed from the end of the linked list. If
-     * the linked list is empty, it returns `null`.
+     * the linked list is empty, it returns `undefined`.
      */
     popLast() {
       return this.pop();
@@ -1090,11 +1090,11 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n) - Linear time, where n is the index, as it may need to traverse the list to find the desired node.
      * Space Complexity: O(1) - Constant space.
      *
-     * The function `getAt` returns the value at a specified index in a linked list, or null if the index is out of range.
+     * The function `getAt` returns the value at a specified index in a linked list, or undefined if the index is out of range.
      * @param {number} index - The index parameter is a number that represents the position of the element we want to
      * retrieve from the list.
-     * @returns The method `getAt(index: number): E | null` returns the value at the specified index in the linked list, or
-     * `null` if the index is out of bounds.
+     * @returns The method `getAt(index: number): E | undefined` returns the value at the specified index in the linked list, or
+     * `undefined` if the index is out of bounds.
      */
     getAt(index) {
       if (index < 0 || index >= this.length)
@@ -1117,7 +1117,7 @@ var dataStructureTyped = (() => {
      * @param {number} index - The `index` parameter is a number that represents the position of the node we want to
      * retrieve from the linked list. It indicates the zero-based index of the node we want to access.
      * @returns The method `getNodeAt(index: number)` returns a `SinglyLinkedListNode<E>` object if the node at the
-     * specified index exists, or `null` if the index is out of bounds.
+     * specified index exists, or `undefined` if the index is out of bounds.
      */
     getNodeAt(index) {
       let current = this.head;
@@ -1137,7 +1137,7 @@ var dataStructureTyped = (() => {
      * The `deleteAt` function removes an element at a specified index from a linked list and returns the removed element.
      * @param {number} index - The index parameter represents the position of the element that needs to be deleted in the
      * data structure. It is of type number.
-     * @returns The method `deleteAt` returns the value of the node that was deleted, or `null` if the index is out of
+     * @returns The method `deleteAt` returns the value of the node that was deleted, or `undefined` if the index is out of
      * bounds.
      */
     deleteAt(index) {
@@ -1176,13 +1176,13 @@ var dataStructureTyped = (() => {
       } else {
         value = valueOrNode;
       }
-      let current = this.head, prev = null;
+      let current = this.head, prev = void 0;
       while (current) {
         if (current.value === value) {
-          if (prev === null) {
+          if (prev === void 0) {
             this._head = current.next;
             if (current === this.tail) {
-              this._tail = null;
+              this._tail = void 0;
             }
           } else {
             prev.next = current.next;
@@ -1241,11 +1241,11 @@ var dataStructureTyped = (() => {
       return this.length === 0;
     }
     /**
-     * The `clear` function resets the linked list by setting the head, tail, and length to null and 0 respectively.
+     * The `clear` function resets the linked list by setting the head, tail, and length to undefined and 0 respectively.
      */
     clear() {
-      this._head = null;
-      this._tail = null;
+      this._head = void 0;
+      this._tail = void 0;
       this._length = 0;
     }
     /**
@@ -1282,9 +1282,9 @@ var dataStructureTyped = (() => {
     reverse() {
       if (!this.head || this.head === this.tail)
         return;
-      let prev = null;
+      let prev = void 0;
       let current = this.head;
-      let next = null;
+      let next = void 0;
       while (current) {
         next = current.next;
         current.next = prev;
@@ -1305,7 +1305,7 @@ var dataStructureTyped = (() => {
      * @param callback - A function that takes a value of type E as its parameter and returns a boolean value. This
      * function is used to determine whether a particular value in the linked list satisfies a certain condition.
      * @returns The method `find` returns the first element in the linked list that satisfies the condition specified by
-     * the callback function. If no element satisfies the condition, it returns `null`.
+     * the callback function. If no element satisfies the condition, it returns `undefined`.
      */
     find(callback) {
       let current = this.head;
@@ -1315,7 +1315,7 @@ var dataStructureTyped = (() => {
         }
         current = current.next;
       }
-      return null;
+      return void 0;
     }
     /**
      * Time Complexity: O(n) - Linear time, where n is the length of the list, as it needs to reverse the pointers of each node.
@@ -1351,10 +1351,10 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1) - Constant space.
      *
      * The function finds a node in a singly linked list by its value and returns the node if found, otherwise returns
-     * null.
+     * undefined.
      * @param {E} value - The value parameter is the value that we want to search for in the linked list.
      * @returns a `SinglyLinkedListNode<E>` if a node with the specified value is found in the linked list. If no node with
-     * the specified value is found, the function returns `null`.
+     * the specified value is found, the function returns `undefined`.
      */
     getNode(value) {
       let current = this.head;
@@ -1364,7 +1364,7 @@ var dataStructureTyped = (() => {
         }
         current = current.next;
       }
-      return null;
+      return void 0;
     }
     /**
      * Time Complexity: O(n) - Linear time, where n is the length of the list, as it needs to reverse the pointers of each node.
@@ -1586,8 +1586,8 @@ var dataStructureTyped = (() => {
       __publicField(this, "next");
       __publicField(this, "prev");
       this.value = value;
-      this.next = null;
-      this.prev = null;
+      this.next = void 0;
+      this.prev = void 0;
     }
   };
   var DoublyLinkedList = class _DoublyLinkedList {
@@ -1598,8 +1598,8 @@ var dataStructureTyped = (() => {
       __publicField(this, "_head");
       __publicField(this, "_tail");
       __publicField(this, "_length");
-      this._head = null;
-      this._tail = null;
+      this._head = void 0;
+      this._tail = void 0;
       this._length = 0;
       if (elements) {
         for (const el of elements) {
@@ -1686,18 +1686,18 @@ var dataStructureTyped = (() => {
      *
      * The `pop()` function removes and returns the value of the last node in a doubly linked list.
      * @returns The method is returning the value of the removed node (removedNode.value) if the list is not empty. If the
-     * list is empty, it returns null.
+     * list is empty, it returns undefined.
      */
     pop() {
       if (!this.tail)
         return void 0;
       const removedNode = this.tail;
       if (this.head === this.tail) {
-        this._head = null;
-        this._tail = null;
+        this._head = void 0;
+        this._tail = void 0;
       } else {
         this._tail = removedNode.prev;
-        this.tail.next = null;
+        this.tail.next = void 0;
       }
       this._length--;
       return removedNode.value;
@@ -1712,7 +1712,7 @@ var dataStructureTyped = (() => {
      *
      * The `popLast()` function removes and returns the value of the last node in a doubly linked list.
      * @returns The method is returning the value of the removed node (removedNode.value) if the list is not empty. If the
-     * list is empty, it returns null.
+     * list is empty, it returns undefined.
      */
     popLast() {
       return this.pop();
@@ -1734,11 +1734,11 @@ var dataStructureTyped = (() => {
         return void 0;
       const removedNode = this.head;
       if (this.head === this.tail) {
-        this._head = null;
-        this._tail = null;
+        this._head = void 0;
+        this._tail = void 0;
       } else {
         this._head = removedNode.next;
-        this.head.prev = null;
+        this.head.prev = void 0;
       }
       this._length--;
       return removedNode.value;
@@ -1805,8 +1805,8 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      *
-     * The `getFirst` function returns the first node in a doubly linked list, or null if the list is empty.
-     * @returns The method `getFirst()` returns the first node of the doubly linked list, or `null` if the list is empty.
+     * The `getFirst` function returns the first node in a doubly linked list, or undefined if the list is empty.
+     * @returns The method `getFirst()` returns the first node of the doubly linked list, or `undefined` if the list is empty.
      */
     getFirst() {
       var _a;
@@ -1820,8 +1820,8 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      *
-     * The `getLast` function returns the last node in a doubly linked list, or null if the list is empty.
-     * @returns The method `getLast()` returns the last node of the doubly linked list, or `null` if the list is empty.
+     * The `getLast` function returns the last node in a doubly linked list, or undefined if the list is empty.
+     * @returns The method `getLast()` returns the last node of the doubly linked list, or `undefined` if the list is empty.
      */
     getLast() {
       var _a;
@@ -1835,11 +1835,11 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      *
-     * The `getAt` function returns the value at a specified index in a linked list, or null if the index is out of bounds.
+     * The `getAt` function returns the value at a specified index in a linked list, or undefined if the index is out of bounds.
      * @param {number} index - The index parameter is a number that represents the position of the element we want to
      * retrieve from the list.
      * @returns The method is returning the value at the specified index in the linked list. If the index is out of bounds
-     * or the linked list is empty, it will return null.
+     * or the linked list is empty, it will return undefined.
      */
     getAt(index) {
       if (index < 0 || index >= this.length)
@@ -1858,16 +1858,16 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n), where n is the number of elements in the linked list.
      * Space Complexity: O(1)
      *
-     * The function `getNodeAt` returns the node at a given index in a doubly linked list, or null if the index is out of
+     * The function `getNodeAt` returns the node at a given index in a doubly linked list, or undefined if the index is out of
      * range.
      * @param {number} index - The `index` parameter is a number that represents the position of the node we want to
      * retrieve from the doubly linked list. It indicates the zero-based index of the node we want to access.
      * @returns The method `getNodeAt(index: number)` returns a `DoublyLinkedListNode<E>` object if the index is within the
-     * valid range of the linked list, otherwise it returns `null`.
+     * valid range of the linked list, otherwise it returns `undefined`.
      */
     getNodeAt(index) {
       if (index < 0 || index >= this.length)
-        return null;
+        return void 0;
       let current = this.head;
       for (let i = 0; i < index; i++) {
         current = current.next;
@@ -1883,10 +1883,10 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The function `findNodeByValue` searches for a node with a specific value in a doubly linked list and returns the
-     * node if found, otherwise it returns null.
+     * node if found, otherwise it returns undefined.
      * @param {E} value - The `value` parameter is the value that we want to search for in the doubly linked list.
      * @returns The function `findNodeByValue` returns a `DoublyLinkedListNode<E>` if a node with the specified value `value`
-     * is found in the linked list. If no such node is found, it returns `null`.
+     * is found in the linked list. If no such node is found, it returns `undefined`.
      */
     getNode(value) {
       let current = this.head;
@@ -1896,7 +1896,7 @@ var dataStructureTyped = (() => {
         }
         current = current.next;
       }
-      return null;
+      return void 0;
     }
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
@@ -2025,7 +2025,7 @@ var dataStructureTyped = (() => {
      * The `deleteAt` function removes an element at a specified index from a linked list and returns the removed element.
      * @param {number} index - The index parameter represents the position of the element that needs to be deleted in the
      * data structure. It is of type number.
-     * @returns The method `deleteAt` returns the value of the node that was deleted, or `null` if the index is out of
+     * @returns The method `deleteAt` returns the value of the node that was deleted, or `undefined` if the index is out of
      * bounds.
      */
     deleteAt(index) {
@@ -2088,11 +2088,11 @@ var dataStructureTyped = (() => {
       return this.length === 0;
     }
     /**
-     * The `clear` function resets the linked list by setting the head, tail, and length to null and 0 respectively.
+     * The `clear` function resets the linked list by setting the head, tail, and length to undefined and 0 respectively.
      */
     clear() {
-      this._head = null;
-      this._tail = null;
+      this._head = void 0;
+      this._tail = void 0;
       this._length = 0;
     }
     /**
@@ -2107,7 +2107,7 @@ var dataStructureTyped = (() => {
      * @param callback - A function that takes a value of type E as its parameter and returns a boolean value. This
      * function is used to determine whether a particular value in the linked list satisfies a certain condition.
      * @returns The method `find` returns the first element in the linked list that satisfies the condition specified by
-     * the callback function. If no element satisfies the condition, it returns `null`.
+     * the callback function. If no element satisfies the condition, it returns `undefined`.
      */
     find(callback) {
       let current = this.head;
@@ -2117,7 +2117,7 @@ var dataStructureTyped = (() => {
         }
         current = current.next;
       }
-      return null;
+      return void 0;
     }
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
@@ -2154,11 +2154,11 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The `findBackward` function iterates through a linked list from the last node to the first node and returns the last
-     * value that satisfies the given callback function, or null if no value satisfies the callback.
+     * value that satisfies the given callback function, or undefined if no value satisfies the callback.
      * @param callback - A function that takes a value of type E as its parameter and returns a boolean value. This
      * function is used to determine whether a given value satisfies a certain condition.
      * @returns The method `findBackward` returns the last value in the linked list that satisfies the condition specified by
-     * the callback function. If no value satisfies the condition, it returns `null`.
+     * the callback function. If no value satisfies the condition, it returns `undefined`.
      */
     findBackward(callback) {
       let current = this.tail;
@@ -2168,7 +2168,7 @@ var dataStructureTyped = (() => {
         }
         current = current.prev;
       }
-      return null;
+      return void 0;
     }
     /**
      * Time Complexity: O(n), where n is the number of elements in the linked list.
@@ -2363,7 +2363,7 @@ var dataStructureTyped = (() => {
       __publicField(this, "_level");
       __publicField(this, "_maxLevel");
       __publicField(this, "_probability");
-      this._head = new SkipListNode(null, null, maxLevel);
+      this._head = new SkipListNode(void 0, void 0, maxLevel);
       this._level = 0;
       this._maxLevel = maxLevel;
       this._probability = probability;
@@ -2407,7 +2407,7 @@ var dataStructureTyped = (() => {
         newNode.forward[i] = update[i].forward[i];
         update[i].forward[i] = newNode;
       }
-      if (newNode.forward[0] !== null) {
+      if (!newNode.forward[0]) {
         this._level = Math.max(this.level, newNode.forward.length);
       }
     }
@@ -2478,7 +2478,7 @@ var dataStructureTyped = (() => {
           }
           update[i].forward[i] = current.forward[i];
         }
-        while (this.level > 0 && this.head.forward[this.level - 1] === null) {
+        while (this.level > 0 && !this.head.forward[this.level - 1]) {
           this._level--;
         }
         return true;
@@ -2556,7 +2556,7 @@ var dataStructureTyped = (() => {
      */
     lower(key) {
       let current = this.head;
-      let lastLess = null;
+      let lastLess = void 0;
       for (let i = this.level - 1; i >= 0; i--) {
         while (current.forward[i] && current.forward[i].key < key) {
           current = current.forward[i];
@@ -2645,12 +2645,12 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1), as it only involves accessing the last element of the array.
      * Space Complexity: O(1), as it does not use any additional space.
      *
-     * The `peek` function returns the last element of an array, or null if the array is empty.
-     * @returns The `peek()` function returns the last element of the `_elements` array, or `null` if the array is empty.
+     * The `peek` function returns the last element of an array, or undefined if the array is empty.
+     * @returns The `peek()` function returns the last element of the `_elements` array, or `undefined` if the array is empty.
      */
     peek() {
       if (this.isEmpty())
-        return null;
+        return void 0;
       return this.elements[this.elements.length - 1];
     }
     /**
@@ -2677,14 +2677,14 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1), as it only involves accessing the last element of the array.
      * Space Complexity: O(1), as it does not use any additional space.
      *
-     * The `pop` function removes and returns the last element from an array, or returns null if the array is empty.
+     * The `pop` function removes and returns the last element from an array, or returns undefined if the array is empty.
      * @returns The `pop()` method is returning the last element of the array `_elements` if the array is not empty. If the
-     * array is empty, it returns `null`.
+     * array is empty, it returns `undefined`.
      */
     pop() {
       if (this.isEmpty())
-        return null;
-      return this.elements.pop() || null;
+        return void 0;
+      return this.elements.pop() || void 0;
     }
     /**
      * Time Complexity: O(n)
@@ -2784,8 +2784,8 @@ var dataStructureTyped = (() => {
       this.push(value);
     }
     /**
-     * The `dequeue` function removes and returns the first element from a queue, or returns null if the queue is empty.
-     * @returns The method is returning the element at the front of the queue, or null if the queue is empty.
+     * The `dequeue` function removes and returns the first element from a queue, or returns undefined if the queue is empty.
+     * @returns The method is returning the element at the front of the queue, or undefined if the queue is empty.
      */
     dequeue() {
       return this.shift();
@@ -2869,7 +2869,7 @@ var dataStructureTyped = (() => {
      *
      * The `shift` function removes and returns the first element in the queue, and adjusts the internal data structure if
      * necessary to optimize performance.
-     * @returns The function `shift()` returns either the first element in the queue or `null` if the queue is empty.
+     * @returns The function `shift()` returns either the first element in the queue or `undefined` if the queue is empty.
      */
     shift() {
       if (this.size === 0)
@@ -2890,9 +2890,9 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `getFirst` function returns the first element of the array `_nodes` if it exists, otherwise it returns `null`.
+     * The `getFirst` function returns the first element of the array `_nodes` if it exists, otherwise it returns `undefined`.
      * @returns The `getFirst()` method returns the first element of the data structure, represented by the `_nodes` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `null`.
+     * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
      */
     getFirst() {
       return this.size > 0 ? this.nodes[this.offset] : void 0;
@@ -2905,9 +2905,9 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `peek` function returns the first element of the array `_nodes` if it exists, otherwise it returns `null`.
+     * The `peek` function returns the first element of the array `_nodes` if it exists, otherwise it returns `undefined`.
      * @returns The `peek()` method returns the first element of the data structure, represented by the `_nodes` array at
-     * the `_offset` index. If the data structure is empty (size is 0), it returns `null`.
+     * the `_offset` index. If the data structure is empty (size is 0), it returns `undefined`.
      */
     peek() {
       return this.getFirst();
@@ -2920,9 +2920,9 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `getLast` function returns the last element in an array-like data structure, or null if the structure is empty.
+     * The `getLast` function returns the last element in an array-like data structure, or undefined if the structure is empty.
      * @returns The method `getLast()` returns the last element of the `_nodes` array if the array is not empty. If the
-     * array is empty, it returns `null`.
+     * array is empty, it returns `undefined`.
      */
     getLast() {
       return this.size > 0 ? this.nodes[this.nodes.length - 1] : void 0;
@@ -2935,9 +2935,9 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1) - constant time as it retrieves the value at the current offset.
      * Space Complexity: O(1) - no additional space is used.
      *
-     * The `peekLast` function returns the last element in an array-like data structure, or null if the structure is empty.
+     * The `peekLast` function returns the last element in an array-like data structure, or undefined if the structure is empty.
      * @returns The method `peekLast()` returns the last element of the `_nodes` array if the array is not empty. If the
-     * array is empty, it returns `null`.
+     * array is empty, it returns `undefined`.
      */
     peekLast() {
       return this.getLast();
@@ -2964,8 +2964,8 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(n) - same as shift().
      * Space Complexity: O(1) - same as shift().
      *
-     * The `dequeue` function removes and returns the first element from a queue, or returns null if the queue is empty.
-     * @returns The method is returning a value of type E or null.
+     * The `dequeue` function removes and returns the first element from a queue, or returns undefined if the queue is empty.
+     * @returns The method is returning a value of type E or undefined.
      */
     dequeue() {
       return this.shift();
@@ -4965,14 +4965,14 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1) - Constant time for Map lookup.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
      *
-     * The function "getVertex" returns the vertex with the specified ID or null if it doesn't exist.
+     * 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`
-     * map. If the vertex does not exist, it returns `null`.
+     * map. If the vertex does not exist, it returns `undefined`.
      */
     getVertex(vertexKey) {
-      return this._vertices.get(vertexKey) || null;
+      return this._vertices.get(vertexKey) || void 0;
     }
     /**
      * Time Complexity: O(1) - Constant time for Map lookup.
@@ -5204,7 +5204,7 @@ var dataStructureTyped = (() => {
         const vertex2 = this._getVertex(v2);
         const vertex1 = this._getVertex(v1);
         if (!(vertex1 && vertex2)) {
-          return null;
+          return void 0;
         }
         const visited = /* @__PURE__ */ new Map();
         const queue = new Queue([vertex1]);
@@ -5228,7 +5228,7 @@ var dataStructureTyped = (() => {
           }
           cost++;
         }
-        return null;
+        return void 0;
       }
     }
     /**
@@ -5252,7 +5252,7 @@ var dataStructureTyped = (() => {
      * 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 `null`.
+     * two vertices (`v1` and `v2`). If there is no path between the vertices, it returns `undefined`.
      */
     getMinPathBetween(v1, v2, isWeight, isDFS = false) {
       var _a, _b;
@@ -5272,7 +5272,7 @@ var dataStructureTyped = (() => {
             }
             index++;
           }
-          return allPaths[minIndex] || null;
+          return allPaths[minIndex] || void 0;
         } else {
           return (_b = (_a = this.dijkstra(v1, v2, true, true)) == null ? void 0 : _a.minPath) != null ? _b : [];
         }
@@ -5318,9 +5318,9 @@ var dataStructureTyped = (() => {
      * 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.
-     * @param {VO | VertexKey | null} [dest] - The `dest` parameter in the `dijkstraWithoutHeap` function is an optional
+     * @param {VO | VertexKey | undefined} [dest] - The `dest` parameter in the `dijkstraWithoutHeap` function is an optional
      * parameter that specifies the destination vertex for the Dijkstra algorithm. It can be either a vertex object or its
-     * identifier. If no destination is provided, the value is set to `null`.
+     * identifier. If no destination is provided, the value is set to `undefined`.
      * @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
@@ -5335,9 +5335,9 @@ var dataStructureTyped = (() => {
       if (genPaths === void 0)
         genPaths = false;
       if (dest === void 0)
-        dest = null;
+        dest = void 0;
       let minDist = Infinity;
-      let minDest = null;
+      let minDest = void 0;
       let minPath = [];
       const paths = [];
       const vertices = this._vertices;
@@ -5345,9 +5345,9 @@ var dataStructureTyped = (() => {
       const seen = /* @__PURE__ */ new Set();
       const preMap = /* @__PURE__ */ new Map();
       const srcVertex = this._getVertex(src);
-      const destVertex = dest ? this._getVertex(dest) : null;
+      const destVertex = dest ? this._getVertex(dest) : void 0;
       if (!srcVertex) {
-        return null;
+        return void 0;
       }
       for (const vertex of vertices) {
         const vertexOrKey = vertex[1];
@@ -5355,10 +5355,10 @@ var dataStructureTyped = (() => {
           distMap.set(vertexOrKey, Infinity);
       }
       distMap.set(srcVertex, 0);
-      preMap.set(srcVertex, null);
+      preMap.set(srcVertex, void 0);
       const getMinOfNoSeen = () => {
         let min = Infinity;
-        let minV = null;
+        let minV = void 0;
         for (const [key, value] of distMap) {
           if (!seen.has(key)) {
             if (value < min) {
@@ -5451,7 +5451,7 @@ var dataStructureTyped = (() => {
      * optional destination vertex, and optionally returns the minimum distance, the paths, and other information.
      * @param {VO | VertexKey} src - The `src` parameter represents the source vertex from which the Dijkstra algorithm will
      * start. It can be either a vertex object or a vertex ID.
-     * @param {VO | VertexKey | null} [dest] - The `dest` parameter is the destination vertex or vertex ID. It specifies the
+     * @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.
      * @param {boolean} [getMinDist] - The `getMinDist` parameter is a boolean flag that determines whether the minimum
@@ -5469,9 +5469,9 @@ var dataStructureTyped = (() => {
       if (genPaths === void 0)
         genPaths = false;
       if (dest === void 0)
-        dest = null;
+        dest = void 0;
       let minDist = Infinity;
-      let minDest = null;
+      let minDest = void 0;
       let minPath = [];
       const paths = [];
       const vertices = this._vertices;
@@ -5479,9 +5479,9 @@ var dataStructureTyped = (() => {
       const seen = /* @__PURE__ */ new Set();
       const preMap = /* @__PURE__ */ new Map();
       const srcVertex = this._getVertex(src);
-      const destVertex = dest ? this._getVertex(dest) : null;
+      const destVertex = dest ? this._getVertex(dest) : void 0;
       if (!srcVertex)
-        return null;
+        return void 0;
       for (const vertex of vertices) {
         const vertexOrKey = vertex[1];
         if (vertexOrKey instanceof AbstractVertex)
@@ -5490,7 +5490,7 @@ var dataStructureTyped = (() => {
       const heap = new PriorityQueue([], { comparator: (a, b) => a.key - b.key });
       heap.add({ key: 0, value: srcVertex });
       distMap.set(srcVertex, 0);
-      preMap.set(srcVertex, null);
+      preMap.set(srcVertex, void 0);
       const getPaths = (minV) => {
         for (const vertex of vertices) {
           const vertexOrKey = vertex[1];
@@ -5624,7 +5624,7 @@ var dataStructureTyped = (() => {
           }
         }
       }
-      let minDest = null;
+      let minDest = void 0;
       if (getMin) {
         distMap.forEach((d, v) => {
           if (v !== srcVertex) {
@@ -5700,7 +5700,7 @@ var dataStructureTyped = (() => {
        * 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 `null`) representing the predecessor vertices in the shortest
+       * `predecessor` property is a 2D array of vertices (or `undefined`) representing the predecessor vertices in the shortest
        * path between vertices in the
        */
     floydWarshall() {
@@ -5713,7 +5713,7 @@ var dataStructureTyped = (() => {
         costs[i] = [];
         predecessor[i] = [];
         for (let j = 0; j < n; j++) {
-          predecessor[i][j] = null;
+          predecessor[i][j] = void 0;
         }
       }
       for (let i = 0; i < n; i++) {
@@ -5824,7 +5824,7 @@ var dataStructureTyped = (() => {
           }
         }
       };
-      dfs(root, null);
+      dfs(root, void 0);
       let SCCs = /* @__PURE__ */ new Map();
       const getSCCs = () => {
         const SCCs2 = /* @__PURE__ */ new Map();
@@ -5908,6 +5908,47 @@ var dataStructureTyped = (() => {
     getBridges() {
       return this.tarjan(false, true, false, false).bridges;
     }
+    *[Symbol.iterator]() {
+      for (const vertex of this._vertices.values()) {
+        yield [vertex.key, vertex.value];
+      }
+    }
+    forEach(callback) {
+      let index = 0;
+      for (const vertex of this) {
+        callback(vertex, index, this._vertices);
+        index++;
+      }
+    }
+    filter(predicate) {
+      const filtered = [];
+      let index = 0;
+      for (const entry of this) {
+        if (predicate(entry, index, this._vertices)) {
+          filtered.push(entry);
+        }
+        index++;
+      }
+      return filtered;
+    }
+    map(callback) {
+      const mapped = [];
+      let index = 0;
+      for (const entry of this) {
+        mapped.push(callback(entry, index, this._vertices));
+        index++;
+      }
+      return mapped;
+    }
+    reduce(callback, initialValue) {
+      let accumulator = initialValue;
+      let index = 0;
+      for (const entry of this) {
+        accumulator = callback(accumulator, entry, index, this._vertices);
+        index++;
+      }
+      return accumulator;
+    }
     _addVertexOnly(newVertex) {
       if (this.hasVertex(newVertex)) {
         return false;
@@ -5917,7 +5958,7 @@ var dataStructureTyped = (() => {
     }
     _getVertex(vertexOrKey) {
       const vertexKey = this._getVertexKey(vertexOrKey);
-      return this._vertices.get(vertexKey) || null;
+      return this._vertices.get(vertexKey) || void 0;
     }
     _getVertexKey(vertexOrKey) {
       return vertexOrKey instanceof AbstractVertex ? vertexOrKey.key : vertexOrKey;
@@ -5986,7 +6027,7 @@ var dataStructureTyped = (() => {
      * @returns a new instance of a DirectedVertex object, casted as type VO.
      */
     createVertex(key, value) {
-      return new DirectedVertex(key, value != null ? value : key);
+      return new DirectedVertex(key, value);
     }
     /**
      * In TypeScript, a subclass inherits the interface implementation of its parent class, without needing to implement the same interface again in the subclass. This behavior differs from Java's approach. In Java, if a parent class implements an interface, the subclass needs to explicitly implement the same interface, even if the parent class has already implemented it.
@@ -6014,15 +6055,15 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The `getEdge` function retrieves an edge between two vertices based on their source and destination IDs.
-     * @param {VO | VertexKey | null} srcOrKey - The source vertex or its ID. It can be either a vertex object or a vertex ID.
-     * @param {VO | VertexKey | null} 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 `null` if the
+     * @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 null if no such edge is found.
+     * @returns the first edge found between the source and destination vertices, or undefined if no such edge is found.
      */
     getEdge(srcOrKey, destOrKey) {
       let edges = [];
-      if (srcOrKey !== null && destOrKey !== null) {
+      if (srcOrKey !== void 0 && destOrKey !== void 0) {
         const src = this._getVertex(srcOrKey);
         const dest = this._getVertex(destOrKey);
         if (src && dest) {
@@ -6032,7 +6073,7 @@ var dataStructureTyped = (() => {
           }
         }
       }
-      return edges[0] || null;
+      return edges[0] || void 0;
     }
     /**
      * Time Complexity: O(|E|) where |E| is the number of edges
@@ -6045,14 +6086,14 @@ var dataStructureTyped = (() => {
      * The function removes an edge between two vertices 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 null if either the source or destination vertex does not exist.
+     * @returns the removed edge (EO) if it exists, or undefined if either the source or destination vertex does not exist.
      */
     deleteEdgeSrcToDest(srcOrKey, destOrKey) {
       const src = this._getVertex(srcOrKey);
       const dest = this._getVertex(destOrKey);
-      let removed = null;
+      let removed = void 0;
       if (!src || !dest) {
-        return null;
+        return void 0;
       }
       const srcOutEdges = this._outEdgeMap.get(src);
       if (srcOutEdges) {
@@ -6060,7 +6101,7 @@ var dataStructureTyped = (() => {
       }
       const destInEdges = this._inEdgeMap.get(dest);
       if (destInEdges) {
-        removed = arrayRemove(destInEdges, (edge) => edge.src === src.key)[0] || null;
+        removed = arrayRemove(destInEdges, (edge) => edge.src === src.key)[0] || void 0;
       }
       return removed;
     }
@@ -6072,13 +6113,13 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(|E|) where |E| is the number of edges
      * Space Complexity: O(1)
      *
-     * The function removes an edge from a graph and returns the removed edge, or null if the edge was not found.
+     * The function removes an edge from a graph and returns the removed edge, or undefined if the edge was not found.
      * @param {EO} edge - The `edge` parameter is an object that represents an edge in a graph. It has two properties: `src`
      * and `dest`, which represent the source and destination vertices of the edge, respectively.
-     * @returns The method `deleteEdge` returns the removed edge (`EO`) if it exists, or `null` if the edge does not exist.
+     * @returns The method `deleteEdge` returns the removed edge (`EO`) if it exists, or `undefined` if the edge does not exist.
      */
     deleteEdge(edge) {
-      let removed = null;
+      let removed = void 0;
       const src = this._getVertex(edge.src);
       const dest = this._getVertex(edge.dest);
       if (src && dest) {
@@ -6226,9 +6267,9 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(1)
      * Space Complexity: O(1)
      *
-     * The function "getEdgeSrc" returns the source vertex of an edge, or null if the edge does not exist.
+     * The function "getEdgeSrc" returns the source vertex of an edge, or undefined if the edge does not exist.
      * @param {EO} e - The parameter "e" is of type EO, which represents an edge in a graph.
-     * @returns either a vertex object (VO) or null.
+     * @returns either a vertex object (VO) or undefined.
      */
     getEdgeSrc(e) {
       return this._getVertex(e.src);
@@ -6243,7 +6284,7 @@ var dataStructureTyped = (() => {
      *
      * The function "getEdgeDest" returns the destination vertex of an edge.
      * @param {EO} e - The parameter "e" is of type "EO", which represents an edge in a graph.
-     * @returns either a vertex object of type VO or null.
+     * @returns either a vertex object of type VO or undefined.
      */
     getEdgeDest(e) {
       return this._getVertex(e.dest);
@@ -6257,12 +6298,12 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The function `getDestinations` returns an array of destination vertices connected to a given vertex.
-     * @param {VO | VertexKey | null} 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 `null`.
+     * @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[]).
      */
     getDestinations(vertex) {
-      if (vertex === null) {
+      if (vertex === void 0) {
         return [];
       }
       const destinations = [];
@@ -6284,11 +6325,11 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(|V|)
      *
      * The `topologicalSort` function performs a topological sort on a graph and returns an array of vertices or vertex IDs
-     * in the sorted order, or null if the graph contains a cycle.
+     * 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 null.
+     * @returns an array of vertices or vertex IDs in topological order. If there is a cycle in the graph, it returns undefined.
      */
     topologicalSort(propertyName) {
       propertyName = propertyName != null ? propertyName : "key";
@@ -6318,7 +6359,7 @@ var dataStructureTyped = (() => {
         }
       }
       if (hasCycle)
-        return null;
+        return void 0;
       if (propertyName === "key")
         sorted = sorted.map((vertex) => vertex instanceof DirectedVertex ? vertex.key : vertex);
       return sorted.reverse();
@@ -6377,21 +6418,21 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The function "getEndsOfEdge" returns the source and destination vertices of an edge if it exists in the graph,
-     * otherwise it returns null.
+     * 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
-     * graph. If the edge does not exist, it returns `null`.
+     * graph. If the edge does not exist, it returns `undefined`.
      */
     getEndsOfEdge(edge) {
       if (!this.hasEdge(edge.src, edge.dest)) {
-        return null;
+        return void 0;
       }
       const v1 = this._getVertex(edge.src);
       const v2 = this._getVertex(edge.dest);
       if (v1 && v2) {
         return [v1, v2];
       } else {
-        return null;
+        return void 0;
       }
     }
     /**
@@ -6509,24 +6550,24 @@ var dataStructureTyped = (() => {
      * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
      * Space Complexity: O(1)
      *
-     * The function `getEdge` returns the first edge that connects two vertices, or null if no such edge exists.
-     * @param {VO | VertexKey | null} v1 - The parameter `v1` represents a vertex or vertex ID. It can be of type `VO` (vertex
-     * object), `null`, or `VertexKey` (a string or number representing the ID of a vertex).
-     * @param {VO | VertexKey | null} v2 - The parameter `v2` represents a vertex or vertex ID. It can be of type `VO` (vertex
-     * object), `null`, or `VertexKey` (vertex ID).
-     * @returns an edge (EO) or null.
+     * The function `getEdge` returns the first edge that connects two vertices, 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
+     * object), `undefined`, or `VertexKey` (vertex ID).
+     * @returns an edge (EO) or undefined.
      */
     getEdge(v1, v2) {
       var _a;
       let edges = [];
-      if (v1 !== null && v2 !== null) {
+      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));
         }
       }
-      return edges ? edges[0] || null : null;
+      return edges ? edges[0] || void 0 : void 0;
     }
     /**
      * Time Complexity: O(|E|), where |E| is the number of edges incident to the given vertex.
@@ -6540,18 +6581,18 @@ var dataStructureTyped = (() => {
      * @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 null if either of the vertices (VO) does not exist.
+     * @returns the removed edge (EO) if it exists, or undefined if either of the vertices (VO) does not exist.
      */
     deleteEdgeBetween(v1, v2) {
       const vertex1 = this._getVertex(v1);
       const vertex2 = this._getVertex(v2);
       if (!vertex1 || !vertex2) {
-        return null;
+        return void 0;
       }
       const v1Edges = this._edges.get(vertex1);
-      let removed = null;
+      let removed = void 0;
       if (v1Edges) {
-        removed = arrayRemove(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || null;
+        removed = arrayRemove(v1Edges, (e) => e.vertices.includes(vertex2.key))[0] || void 0;
       }
       const v2Edges = this._edges.get(vertex2);
       if (v2Edges) {
@@ -6569,7 +6610,7 @@ var dataStructureTyped = (() => {
      *
      * The deleteEdge function removes an edge between two vertices in a graph.
      * @param {EO} edge - The parameter "edge" is of type EO, which represents an edge in a graph.
-     * @returns The method is returning either the removed edge (of type EO) or null if the edge was not found.
+     * @returns The method is returning either the removed edge (of type EO) or undefined if the edge was not found.
      */
     deleteEdge(edge) {
       return this.deleteEdgeBetween(edge.vertices[0], edge.vertices[1]);
@@ -6674,21 +6715,21 @@ var dataStructureTyped = (() => {
      * Space Complexity: O(1)
      *
      * The function "getEndsOfEdge" returns the vertices at the ends of an edge if the edge exists in the graph, otherwise
-     * it returns null.
+     * 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
-     * graph. If the edge does not exist, it returns `null`.
+     * graph. If the edge does not exist, it returns `undefined`.
      */
     getEndsOfEdge(edge) {
       if (!this.hasEdge(edge.vertices[0], edge.vertices[1])) {
-        return null;
+        return void 0;
       }
       const v1 = this._getVertex(edge.vertices[0]);
       const v2 = this._getVertex(edge.vertices[1]);
       if (v1 && v2) {
         return [v1, v2];
       } else {
-        return null;
+        return void 0;
       }
     }
     /**
@@ -6706,7 +6747,7 @@ var dataStructureTyped = (() => {
     _addEdgeOnly(edge) {
       for (const end of edge.vertices) {
         const endVertex = this._getVertex(end);
-        if (endVertex === null)
+        if (endVertex === void 0)
           return false;
         if (endVertex) {
           const edges = this._edges.get(endVertex);
@@ -9297,14 +9338,14 @@ var dataStructureTyped = (() => {
     constructor(start, end, sum, value) {
       __publicField(this, "start", 0);
       __publicField(this, "end", 0);
-      __publicField(this, "value", null);
+      __publicField(this, "value");
       __publicField(this, "sum", 0);
-      __publicField(this, "left", null);
-      __publicField(this, "right", null);
+      __publicField(this, "left");
+      __publicField(this, "right");
       this.start = start;
       this.end = end;
       this.sum = sum;
-      this.value = value || null;
+      this.value = value || void 0;
     }
   };
   var SegmentTree = class {
@@ -9330,7 +9371,7 @@ var dataStructureTyped = (() => {
       if (values.length > 0) {
         this._root = this.build(start, end);
       } else {
-        this._root = null;
+        this._root = void 0;
         this._values = [];
       }
     }
@@ -9381,7 +9422,7 @@ var dataStructureTyped = (() => {
      * @returns The function does not return anything.
      */
     updateNode(index, sum, value) {
-      const root = this.root || null;
+      const root = this.root || void 0;
       if (!root) {
         return;
       }
@@ -9416,7 +9457,7 @@ var dataStructureTyped = (() => {
      * @returns The function `querySumByRange` returns a number.
      */
     querySumByRange(indexA, indexB) {
-      const root = this.root || null;
+      const root = this.root || void 0;
       if (!root) {
         return 0;
       }