data-structure-typed 1.47.7 → 1.47.8

package/CHANGELOG.md

@@ -8,7 +8,7 @@ All notable changes to this project will be documented in this file.
 - [Semantic Versioning](https://semver.org/spec/v2.0.0.html)
 - [`auto-changelog`](https://github.com/CookPete/auto-changelog)
 
-## [v1.47.7](https://github.com/zrwusa/data-structure-typed/compare/v1.35.0...main) (upcoming)
+## [v1.47.8](https://github.com/zrwusa/data-structure-typed/compare/v1.35.0...main) (upcoming)
 
 ### Changes
 

package/README.md

@@ -308,65 +308,146 @@ const orgStrArr = ["trie", "trial", "trick", "trip", "tree", "trend", "triangle"
 const entries = [[6, 6], [1, 1], [2, 2], [7, 7], [5, 5], [3, 3], [4, 4], [9, 9], [8, 8]];
 
 const queue = new Queue(orgArr);
-queue.print();
+queue.print();      
+// [6, 1, 2, 7, 5, 3, 4, 9, 8]
 
 const deque = new Deque(orgArr);
-deque.print();
+deque.print();      
+// [6, 1, 2, 7, 5, 3, 4, 9, 8]
 
 const sList = new SinglyLinkedList(orgArr);
-sList.print();
+sList.print();      
+// [6, 1, 2, 7, 5, 3, 4, 9, 8]
 
 const dList = new DoublyLinkedList(orgArr);
-dList.print();
+dList.print();      
+// [6, 1, 2, 7, 5, 3, 4, 9, 8]
 
 const stack = new Stack(orgArr);
-stack.print();
+stack.print();      
+// [6, 1, 2, 7, 5, 3, 4, 9, 8]
 
 const minHeap = new MinHeap(orgArr);
-minHeap.print();
+minHeap.print();    
+// [1, 5, 2, 7, 6, 3, 4, 9, 8]
 
 const maxPQ = new MaxPriorityQueue(orgArr);
-maxPQ.print();
+maxPQ.print();      
+// [9, 8, 4, 7, 5, 2, 3, 1, 6]
 
 const biTree = new BinaryTree(entries);
 biTree.print();
+//         ___6___
+//        /       \
+//     ___1_     _2_
+//    /     \   /   \
+//   _7_    5   3   4
+//  /   \
+//  9   8
 
 const bst = new BST(entries);
 bst.print();
+//     _____5___
+//    /         \
+//   _2_       _7_
+//  /   \     /   \
+//  1   3_    6   8_
+//        \         \
+//        4         9
+
 
 const rbTree = new RedBlackTree(entries);
 rbTree.print();
+//     ___4___
+//    /       \
+//   _2_     _6___
+//  /   \   /     \
+//  1   3   5    _8_
+//              /   \
+//              7   9
+
 
 const avl = new AVLTree(entries);
 avl.print();
+//     ___4___
+//    /       \
+//   _2_     _6___
+//  /   \   /     \
+//  1   3   5    _8_
+//              /   \
+//              7   9
 
 const treeMulti = new TreeMultimap(entries);
 treeMulti.print();
+//     ___4___
+//    /       \
+//   _2_     _6___
+//  /   \   /     \
+//  1   3   5    _8_
+//              /   \
+//              7   9
 
 const hm = new HashMap(entries);
-hm.print()
+hm.print()    
+// [[6, 6], [1, 1], [2, 2], [7, 7], [5, 5], [3, 3], [4, 4], [9, 9], [8, 8]]
+
 const rbTreeH = new RedBlackTree(hm);
 rbTreeH.print();
+//     ___4___
+//    /       \
+//   _2_     _6___
+//  /   \   /     \
+//  1   3   5    _8_
+//              /   \
+//              7   9
 
 const pq = new MinPriorityQueue(orgArr);
-pq.print();
+pq.print();   
+// [1, 5, 2, 7, 6, 3, 4, 9, 8]
+
 const bst1 = new BST(pq);
 bst1.print();
+//     _____5___
+//    /         \
+//   _2_       _7_
+//  /   \     /   \
+//  1   3_    6   8_
+//        \         \
+//        4         9
 
 const dq1 = new Deque(orgArr);
-dq1.print();
+dq1.print();    
+// [6, 1, 2, 7, 5, 3, 4, 9, 8]
 const rbTree1 = new RedBlackTree(dq1);
 rbTree1.print();
+//    _____5___
+//   /         \
+//  _2___     _7___
+// /     \   /     \
+// 1    _4   6    _9
+//      /         /
+//      3         8
+
 
 const trie2 = new Trie(orgStrArr);
-trie2.print();
+trie2.print();    
+// ['trie', 'trial', 'triangle', 'trick', 'trip', 'tree', 'trend', 'track', 'trace', 'transmit']
 const heap2 = new Heap(trie2, { comparator: (a, b) => Number(a) - Number(b) });
-heap2.print();
+heap2.print();    
+// ['transmit', 'trace', 'tree', 'trend', 'track', 'trial', 'trip', 'trie', 'trick', 'triangle']
 const dq2 = new Deque(heap2);
-dq2.print();
+dq2.print();      
+// ['transmit', 'trace', 'tree', 'trend', 'track', 'trial', 'trip', 'trie', 'trick', 'triangle']
 const entries2 = dq2.map((el, i) => [i, el]);
 const avl2 = new AVLTree(entries2);
 avl2.print();
+//     ___3_______
+//    /           \
+//   _1_       ___7_
+//  /   \     /     \
+//  0   2    _5_    8_
+//          /   \     \
+//          4   6     9
 ```
 
 ## API docs & Examples
@@ -379,7 +460,7 @@ avl2.print();
 
 ## Data Structures
 
-<table>
+<table style="display: table; width:100%; table-layout: fixed;">
 <thead>
 <tr>
 <th>Data Structure</th>
@@ -520,7 +601,7 @@ avl2.print();
 
 ## Standard library data structure comparison
 
-<table>
+<table style="display: table; width:100%; table-layout: fixed;">
   <thead>
   <tr>
     <th>Data Structure Typed</th>
@@ -752,7 +833,7 @@ avl2.print();
 
 ## Built-in classic algorithms
 
-<table>
+<table style="display: table; width:100%; table-layout: fixed;">
   <thead>
   <tr>
     <th>Algorithm</th>
@@ -853,7 +934,7 @@ avl2.print();
 
 ## Software Engineering Design Standards
 
-<table>
+<table style="display: table; width:100%; table-layout: fixed;">
     <tr>
         <th>Principle</th>
         <th>Description</th>

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

@@ -9,11 +9,11 @@ import type { SegmentTreeNodeVal } from '../../types';
 export declare class SegmentTreeNode {
     start: number;
     end: number;
-    value: SegmentTreeNodeVal | null;
+    value: SegmentTreeNodeVal | undefined;
     sum: number;
-    left: SegmentTreeNode | null;
-    right: SegmentTreeNode | null;
-    constructor(start: number, end: number, sum: number, value?: SegmentTreeNodeVal | null);
+    left: SegmentTreeNode | undefined;
+    right: SegmentTreeNode | undefined;
+    constructor(start: number, end: number, sum: number, value?: SegmentTreeNodeVal | undefined);
 }
 export declare class SegmentTree {
     /**
@@ -32,8 +32,8 @@ export declare class SegmentTree {
     get start(): number;
     protected _end: number;
     get end(): number;
-    protected _root: SegmentTreeNode | null;
-    get root(): SegmentTreeNode | null;
+    protected _root: SegmentTreeNode | undefined;
+    get root(): SegmentTreeNode | undefined;
     /**
      * The build function creates a segment tree by recursively dividing the given range into smaller segments and assigning
      * the sum of values to each segment.

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

@@ -12,14 +12,14 @@ class SegmentTreeNode {
     constructor(start, end, sum, value) {
         this.start = 0;
         this.end = 0;
-        this.value = null;
+        this.value = undefined;
         this.sum = 0;
-        this.left = null;
-        this.right = null;
+        this.left = undefined;
+        this.right = undefined;
         this.start = start;
         this.end = end;
         this.sum = sum;
-        this.value = value || null;
+        this.value = value || undefined;
     }
 }
 exports.SegmentTreeNode = SegmentTreeNode;
@@ -45,7 +45,7 @@ class SegmentTree {
             this._root = this.build(start, end);
         }
         else {
-            this._root = null;
+            this._root = undefined;
             this._values = [];
         }
     }
@@ -96,7 +96,7 @@ class SegmentTree {
      * @returns The function does not return anything.
      */
     updateNode(index, sum, value) {
-        const root = this.root || null;
+        const root = this.root || undefined;
         if (!root) {
             return;
         }
@@ -132,7 +132,7 @@ class SegmentTree {
      * @returns The function `querySumByRange` returns a number.
      */
     querySumByRange(indexA, indexB) {
-        const root = this.root || null;
+        const root = this.root || undefined;
         if (!root) {
             return 0;
         }

package/dist/cjs/data-structures/binary-tree/segment-tree.js.map

@@ -1 +1 @@
-{"version":3,"file":"segment-tree.js","sourceRoot":"","sources":["../../../../src/data-structures/binary-tree/segment-tree.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAIH,MAAa,eAAe;IAQ1B,YAAY,KAAa,EAAE,GAAW,EAAE,GAAW,EAAE,KAAiC;QAPtF,UAAK,GAAG,CAAC,CAAC;QACV,QAAG,GAAG,CAAC,CAAC;QACR,UAAK,GAA8B,IAAI,CAAC;QACxC,QAAG,GAAG,CAAC,CAAC;QACR,SAAI,GAA2B,IAAI,CAAC;QACpC,UAAK,GAA2B,IAAI,CAAC;QAGnC,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,IAAI,IAAI,CAAC;IAC7B,CAAC;CACF;AAdD,0CAcC;AAED,MAAa,WAAW;IACtB;;;;;;;;OAQG;IACH,YAAY,MAAgB,EAAE,KAAc,EAAE,GAAY;QAehD,YAAO,GAAa,EAAE,CAAC;QAMvB,WAAM,GAAG,CAAC,CAAC;QApBnB,KAAK,GAAG,KAAK,IAAI,CAAC,CAAC;QACnB,GAAG,GAAG,GAAG,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAEhB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YACrB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;SACrC;aAAM;YACL,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC;YAClB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;SACnB;IACH,CAAC;IAID,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAID,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAID,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,KAAa,EAAE,GAAW;QAC9B,IAAI,KAAK,GAAG,GAAG,EAAE;YACf,OAAO,IAAI,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;SAC3C;QACD,IAAI,KAAK,KAAK,GAAG;YAAE,OAAO,IAAI,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QAE/E,MAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,IAAI,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAClE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;QAChB,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;QAClB,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;;;;OAUG;IACH,UAAU,CAAC,KAAa,EAAE,GAAW,EAAE,KAA0B;QAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE;YACT,OAAO;SACR;QACD,MAAM,GAAG,GAAG,CAAC,GAAoB,EAAE,KAAa,EAAE,GAAW,EAAE,KAA0B,EAAE,EAAE;YAC3F,IAAI,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,KAAK,EAAE;gBAChD,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;gBACd,IAAI,KAAK,KAAK,SAAS;oBAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;gBAC3C,OAAO;aACR;YACD,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,IAAI,KAAK,IAAI,GAAG,EAAE;gBAChB,IAAI,GAAG,CAAC,IAAI,EAAE;oBACZ,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;iBAClC;aACF;iBAAM;gBACL,IAAI,GAAG,CAAC,KAAK,EAAE;oBACb,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;iBACnC;aACF;YACD,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE;gBACzB,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;aACxC;QACH,CAAC,CAAC;QAEF,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CAAC,MAAc,EAAE,MAAc;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,IAAI,CAAC;QAC/B,IAAI,CAAC,IAAI,EAAE;YACT,OAAO,CAAC,CAAC;SACV;QAED,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,GAAG,MAAM,EAAE;YACjE,OAAO,GAAG,CAAC;SACZ;QAED,MAAM,GAAG,GAAG,CAAC,GAAoB,EAAE,CAAS,EAAE,CAAS,EAAU,EAAE;YACjE,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE;gBAClC,mFAAmF;gBACnF,OAAO,GAAG,CAAC,GAAG,CAAC;aAChB;YACD,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,IAAI,CAAC,IAAI,GAAG,EAAE;gBACZ,IAAI,GAAG,CAAC,IAAI,EAAE;oBACZ,OAAO,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;iBAC5B;qBAAM;oBACL,OAAO,GAAG,CAAC;iBACZ;aACF;iBAAM,IAAI,CAAC,GAAG,GAAG,EAAE;gBAClB,IAAI,GAAG,CAAC,KAAK,EAAE;oBACb,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;iBAC7B;qBAAM;oBACL,OAAO,GAAG,CAAC;iBACZ;aACF;iBAAM;gBACL,qCAAqC;gBACrC,IAAI,OAAO,GAAG,CAAC,CAAC;gBAChB,IAAI,QAAQ,GAAG,CAAC,CAAC;gBACjB,IAAI,GAAG,CAAC,IAAI,EAAE;oBACZ,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;iBACjC;gBACD,IAAI,GAAG,CAAC,KAAK,EAAE;oBACb,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;iBACvC;gBACD,OAAO,OAAO,GAAG,QAAQ,CAAC;aAC3B;QACH,CAAC,CAAC;QACF,OAAO,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;CACF;AAnKD,kCAmKC"}
+{"version":3,"file":"segment-tree.js","sourceRoot":"","sources":["../../../../src/data-structures/binary-tree/segment-tree.ts"],"names":[],"mappings":";AAAA;;;;;;GAMG;;;AAIH,MAAa,eAAe;IAQ1B,YAAY,KAAa,EAAE,GAAW,EAAE,GAAW,EAAE,KAAsC;QAP3F,UAAK,GAAG,CAAC,CAAC;QACV,QAAG,GAAG,CAAC,CAAC;QACR,UAAK,GAAmC,SAAS,CAAC;QAClD,QAAG,GAAG,CAAC,CAAC;QACR,SAAI,GAAgC,SAAS,CAAC;QAC9C,UAAK,GAAgC,SAAS,CAAC;QAG7C,IAAI,CAAC,KAAK,GAAG,KAAK,CAAC;QACnB,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC;QACf,IAAI,CAAC,KAAK,GAAG,KAAK,IAAI,SAAS,CAAC;IAClC,CAAC;CACF;AAdD,0CAcC;AAED,MAAa,WAAW;IACtB;;;;;;;;OAQG;IACH,YAAY,MAAgB,EAAE,KAAc,EAAE,GAAY;QAehD,YAAO,GAAa,EAAE,CAAC;QAMvB,WAAM,GAAG,CAAC,CAAC;QApBnB,KAAK,GAAG,KAAK,IAAI,CAAC,CAAC;QACnB,GAAG,GAAG,GAAG,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,CAAC;QAC/B,IAAI,CAAC,OAAO,GAAG,MAAM,CAAC;QACtB,IAAI,CAAC,MAAM,GAAG,KAAK,CAAC;QACpB,IAAI,CAAC,IAAI,GAAG,GAAG,CAAC;QAEhB,IAAI,MAAM,CAAC,MAAM,GAAG,CAAC,EAAE;YACrB,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;SACrC;aAAM;YACL,IAAI,CAAC,KAAK,GAAG,SAAS,CAAC;YACvB,IAAI,CAAC,OAAO,GAAG,EAAE,CAAC;SACnB;IACH,CAAC;IAID,IAAI,MAAM;QACR,OAAO,IAAI,CAAC,OAAO,CAAC;IACtB,CAAC;IAID,IAAI,KAAK;QACP,OAAO,IAAI,CAAC,MAAM,CAAC;IACrB,CAAC;IAID,IAAI,GAAG;QACL,OAAO,IAAI,CAAC,IAAI,CAAC;IACnB,CAAC;IAID,IAAI,IAAI;QACN,OAAO,IAAI,CAAC,KAAK,CAAC;IACpB,CAAC;IAED;;;;;;;;OAQG;IACH,KAAK,CAAC,KAAa,EAAE,GAAW;QAC9B,IAAI,KAAK,GAAG,GAAG,EAAE;YACf,OAAO,IAAI,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC,CAAC;SAC3C;QACD,IAAI,KAAK,KAAK,GAAG;YAAE,OAAO,IAAI,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC;QAE/E,MAAM,GAAG,GAAG,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;QAClD,MAAM,IAAI,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,GAAG,CAAC,CAAC;QACpC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,GAAG,CAAC,EAAE,GAAG,CAAC,CAAC;QACvC,MAAM,GAAG,GAAG,IAAI,eAAe,CAAC,KAAK,EAAE,GAAG,EAAE,IAAI,CAAC,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,CAAC;QAClE,GAAG,CAAC,IAAI,GAAG,IAAI,CAAC;QAChB,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;QAClB,OAAO,GAAG,CAAC;IACb,CAAC;IAED;;;;;;;;;;OAUG;IACH,UAAU,CAAC,KAAa,EAAE,GAAW,EAAE,KAA0B;QAC/D,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC;QACpC,IAAI,CAAC,IAAI,EAAE;YACT,OAAO;SACR;QACD,MAAM,GAAG,GAAG,CAAC,GAAoB,EAAE,KAAa,EAAE,GAAW,EAAE,KAA0B,EAAE,EAAE;YAC3F,IAAI,GAAG,CAAC,KAAK,KAAK,GAAG,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,KAAK,KAAK,EAAE;gBAChD,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC;gBACd,IAAI,KAAK,KAAK,SAAS;oBAAE,GAAG,CAAC,KAAK,GAAG,KAAK,CAAC;gBAC3C,OAAO;aACR;YACD,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,IAAI,KAAK,IAAI,GAAG,EAAE;gBAChB,IAAI,GAAG,CAAC,IAAI,EAAE;oBACZ,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;iBAClC;aACF;iBAAM;gBACL,IAAI,GAAG,CAAC,KAAK,EAAE;oBACb,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;iBACnC;aACF;YACD,IAAI,GAAG,CAAC,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE;gBACzB,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,IAAI,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC;aACxC;QACH,CAAC,CAAC;QAEF,GAAG,CAAC,IAAI,EAAE,KAAK,EAAE,GAAG,EAAE,KAAK,CAAC,CAAC;IAC/B,CAAC;IAED;;;;;;OAMG;IACH,eAAe,CAAC,MAAc,EAAE,MAAc;QAC5C,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,IAAI,SAAS,CAAC;QACpC,IAAI,CAAC,IAAI,EAAE;YACT,OAAO,CAAC,CAAC;SACV;QAED,IAAI,MAAM,GAAG,CAAC,IAAI,MAAM,IAAI,IAAI,CAAC,MAAM,CAAC,MAAM,IAAI,MAAM,GAAG,MAAM,EAAE;YACjE,OAAO,GAAG,CAAC;SACZ;QAED,MAAM,GAAG,GAAG,CAAC,GAAoB,EAAE,CAAS,EAAE,CAAS,EAAU,EAAE;YACjE,IAAI,CAAC,IAAI,GAAG,CAAC,KAAK,IAAI,CAAC,IAAI,GAAG,CAAC,GAAG,EAAE;gBAClC,mFAAmF;gBACnF,OAAO,GAAG,CAAC,GAAG,CAAC;aAChB;YACD,MAAM,GAAG,GAAG,GAAG,CAAC,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,CAAC,GAAG,CAAC,GAAG,GAAG,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC;YAC9D,IAAI,CAAC,IAAI,GAAG,EAAE;gBACZ,IAAI,GAAG,CAAC,IAAI,EAAE;oBACZ,OAAO,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;iBAC5B;qBAAM;oBACL,OAAO,GAAG,CAAC;iBACZ;aACF;iBAAM,IAAI,CAAC,GAAG,GAAG,EAAE;gBAClB,IAAI,GAAG,CAAC,KAAK,EAAE;oBACb,OAAO,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,EAAE,CAAC,CAAC,CAAC;iBAC7B;qBAAM;oBACL,OAAO,GAAG,CAAC;iBACZ;aACF;iBAAM;gBACL,qCAAqC;gBACrC,IAAI,OAAO,GAAG,CAAC,CAAC;gBAChB,IAAI,QAAQ,GAAG,CAAC,CAAC;gBACjB,IAAI,GAAG,CAAC,IAAI,EAAE;oBACZ,OAAO,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC,EAAE,GAAG,CAAC,CAAC;iBACjC;gBACD,IAAI,GAAG,CAAC,KAAK,EAAE;oBACb,QAAQ,GAAG,GAAG,CAAC,GAAG,CAAC,KAAK,EAAE,GAAG,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;iBACvC;gBACD,OAAO,OAAO,GAAG,QAAQ,CAAC;aAC3B;QACH,CAAC,CAAC;QACF,OAAO,GAAG,CAAC,IAAI,EAAE,MAAM,EAAE,MAAM,CAAC,CAAC;IACnC,CAAC;CACF;AAnKD,kCAmKC"}

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

@@ -47,13 +47,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * @param value
      */
     abstract createEdge(srcOrV1: VertexKey, destOrV2: VertexKey, weight?: number, value?: E): EO;
-    abstract deleteEdge(edge: EO): EO | null;
-    abstract getEdge(srcOrKey: VO | VertexKey, destOrKey: VO | VertexKey): EO | null;
+    abstract deleteEdge(edge: EO): EO | undefined;
+    abstract getEdge(srcOrKey: VO | VertexKey, destOrKey: VO | VertexKey): EO | undefined;
     abstract degreeOf(vertexOrKey: VO | VertexKey): number;
     abstract edgeSet(): EO[];
     abstract edgesOf(vertexOrKey: VO | VertexKey): EO[];
     abstract getNeighbors(vertexOrKey: VO | VertexKey): VO[];
-    abstract getEndsOfEdge(edge: EO): [VO, VO] | null;
+    abstract getEndsOfEdge(edge: EO): [VO, VO] | undefined;
     /**
      * Time Complexity: O(1) - Constant time for Map lookup.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
@@ -62,13 +62,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * 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: VertexKey): VO | null;
+    getVertex(vertexKey: VertexKey): VO | undefined;
     /**
      * Time Complexity: O(1) - Constant time for Map lookup.
      * Space Complexity: O(1) - Constant space, as it creates only a few variables.
@@ -201,7 +201,7 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * vertices. If `isWeight` is `false` or not provided, it uses a breadth-first search (BFS) algorithm to calculate the
      * minimum number of
      */
-    getMinCostBetween(v1: VO | VertexKey, v2: VO | VertexKey, isWeight?: boolean): number | null;
+    getMinCostBetween(v1: VO | VertexKey, v2: VO | VertexKey, isWeight?: boolean): number | undefined;
     /**
      * 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).
@@ -223,9 +223,9 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * 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: VO | VertexKey, v2: VO | VertexKey, isWeight?: boolean, isDFS?: boolean): VO[] | null;
+    getMinPathBetween(v1: VO | VertexKey, v2: VO | VertexKey, isWeight?: boolean, isDFS?: boolean): VO[] | undefined;
     /**
      *  Dijkstra algorithm time: O(VE) space: O(VO + EO)
      * /
@@ -242,9 +242,9 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * 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
@@ -253,7 +253,7 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
      * @returns The function `dijkstraWithoutHeap` returns an object of type `DijkstraResult<VO>`.
      */
-    dijkstraWithoutHeap(src: VO | VertexKey, dest?: VO | VertexKey | null, getMinDist?: boolean, genPaths?: boolean): DijkstraResult<VO>;
+    dijkstraWithoutHeap(src: VO | VertexKey, dest?: VO | VertexKey | undefined, getMinDist?: boolean, genPaths?: boolean): DijkstraResult<VO>;
     /**
      *  Dijkstra algorithm time: O(logVE) space: O(VO + EO)
      *
@@ -276,7 +276,7 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * 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
@@ -287,7 +287,7 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * shortest paths from the source vertex to all other vertices in the graph. If `genPaths
      * @returns The function `dijkstra` returns an object of type `DijkstraResult<VO>`.
      */
-    dijkstra(src: VO | VertexKey, dest?: VO | VertexKey | null, getMinDist?: boolean, genPaths?: boolean): DijkstraResult<VO>;
+    dijkstra(src: VO | VertexKey, dest?: VO | VertexKey | undefined, getMinDist?: boolean, genPaths?: boolean): DijkstraResult<VO>;
     /**
      * Time Complexity: O(V * E) - Quadratic time in the worst case (Bellman-Ford algorithm).
      * Space Complexity: O(V + E) - Depends on the implementation (Bellman-Ford algorithm).
@@ -353,12 +353,12 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * 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(): {
         costs: number[][];
-        predecessor: (VO | null)[][];
+        predecessor: (VO | undefined)[][];
     };
     /**
      * Time Complexity: O(V + E) - Linear time (Tarjan's algorithm).
@@ -445,6 +445,6 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
     getBridges(): EO[];
     protected abstract _addEdgeOnly(edge: EO): boolean;
     protected _addVertexOnly(newVertex: VO): boolean;
-    protected _getVertex(vertexOrKey: VertexKey | VO): VO | null;
+    protected _getVertex(vertexOrKey: VertexKey | VO): VO | undefined;
     protected _getVertexKey(vertexOrKey: VO | VertexKey): VertexKey;
 }

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

@@ -60,14 +60,14 @@ class AbstractGraph {
      * 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) || undefined;
     }
     /**
      * Time Complexity: O(1) - Constant time for Map lookup.
@@ -305,7 +305,7 @@ class AbstractGraph {
             const vertex2 = this._getVertex(v2);
             const vertex1 = this._getVertex(v1);
             if (!(vertex1 && vertex2)) {
-                return null;
+                return undefined;
             }
             const visited = new Map();
             const queue = new queue_1.Queue([vertex1]);
@@ -330,7 +330,7 @@ class AbstractGraph {
                 }
                 cost++;
             }
-            return null;
+            return undefined;
         }
     }
     /**
@@ -354,7 +354,7 @@ class AbstractGraph {
      * 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;
@@ -374,7 +374,7 @@ class AbstractGraph {
                     }
                     index++;
                 }
-                return allPaths[minIndex] || null;
+                return allPaths[minIndex] || undefined;
             }
             else {
                 return (_b = (_a = this.dijkstra(v1, v2, true, true)) === null || _a === void 0 ? void 0 : _a.minPath) !== null && _b !== void 0 ? _b : [];
@@ -423,9 +423,9 @@ class AbstractGraph {
      * 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
@@ -440,9 +440,9 @@ class AbstractGraph {
         if (genPaths === undefined)
             genPaths = false;
         if (dest === undefined)
-            dest = null;
+            dest = undefined;
         let minDist = Infinity;
-        let minDest = null;
+        let minDest = undefined;
         let minPath = [];
         const paths = [];
         const vertices = this._vertices;
@@ -450,9 +450,9 @@ class AbstractGraph {
         const seen = new Set();
         const preMap = new Map(); // predecessor
         const srcVertex = this._getVertex(src);
-        const destVertex = dest ? this._getVertex(dest) : null;
+        const destVertex = dest ? this._getVertex(dest) : undefined;
         if (!srcVertex) {
-            return null;
+            return undefined;
         }
         for (const vertex of vertices) {
             const vertexOrKey = vertex[1];
@@ -460,10 +460,10 @@ class AbstractGraph {
                 distMap.set(vertexOrKey, Infinity);
         }
         distMap.set(srcVertex, 0);
-        preMap.set(srcVertex, null);
+        preMap.set(srcVertex, undefined);
         const getMinOfNoSeen = () => {
             let min = Infinity;
-            let minV = null;
+            let minV = undefined;
             for (const [key, value] of distMap) {
                 if (!seen.has(key)) {
                     if (value < min) {
@@ -511,7 +511,7 @@ class AbstractGraph {
                         if (edge) {
                             const curFromMap = distMap.get(cur);
                             const neighborFromMap = distMap.get(neighbor);
-                            // TODO after no-non-null-assertion not ensure the logic
+                            // TODO after no-non-undefined-assertion not ensure the logic
                             if (curFromMap !== undefined && neighborFromMap !== undefined) {
                                 if (edge.weight + curFromMap < neighborFromMap) {
                                     distMap.set(neighbor, edge.weight + curFromMap);
@@ -558,7 +558,7 @@ class AbstractGraph {
      * 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
@@ -576,9 +576,9 @@ class AbstractGraph {
         if (genPaths === undefined)
             genPaths = false;
         if (dest === undefined)
-            dest = null;
+            dest = undefined;
         let minDist = Infinity;
-        let minDest = null;
+        let minDest = undefined;
         let minPath = [];
         const paths = [];
         const vertices = this._vertices;
@@ -586,9 +586,9 @@ class AbstractGraph {
         const seen = new Set();
         const preMap = new Map(); // predecessor
         const srcVertex = this._getVertex(src);
-        const destVertex = dest ? this._getVertex(dest) : null;
+        const destVertex = dest ? this._getVertex(dest) : undefined;
         if (!srcVertex)
-            return null;
+            return undefined;
         for (const vertex of vertices) {
             const vertexOrKey = vertex[1];
             if (vertexOrKey instanceof AbstractVertex)
@@ -597,11 +597,11 @@ class AbstractGraph {
         const heap = new priority_queue_1.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, undefined);
         /**
          * The function `getPaths` retrieves all paths from vertices to a specified minimum vertex.
-         * @param {VO | null} minV - The parameter `minV` is of type `VO | null`. It represents the minimum vertex value or
-         * null.
+         * @param {VO | undefined} minV - The parameter `minV` is of type `VO | undefined`. It represents the minimum vertex value or
+         * undefined.
          */
         const getPaths = (minV) => {
             for (const vertex of vertices) {
@@ -737,7 +737,7 @@ class AbstractGraph {
                 }
             }
         }
-        let minDest = null;
+        let minDest = undefined;
         if (getMin) {
             distMap.forEach((d, v) => {
                 if (v !== srcVertex) {
@@ -813,7 +813,7 @@ class AbstractGraph {
      * 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() {
@@ -827,7 +827,7 @@ class AbstractGraph {
             costs[i] = [];
             predecessor[i] = [];
             for (let j = 0; j < n; j++) {
-                predecessor[i][j] = null;
+                predecessor[i][j] = undefined;
             }
         }
         for (let i = 0; i < n; i++) {
@@ -919,7 +919,7 @@ class AbstractGraph {
                     }
                     const childLow = lowMap.get(neighbor);
                     const curLow = lowMap.get(cur);
-                    // TODO after no-non-null-assertion not ensure the logic
+                    // TODO after no-non-undefined-assertion not ensure the logic
                     if (curLow !== undefined && childLow !== undefined) {
                         lowMap.set(cur, Math.min(curLow, childLow));
                     }
@@ -943,7 +943,7 @@ class AbstractGraph {
                 }
             }
         };
-        dfs(root, null);
+        dfs(root, undefined);
         let SCCs = new Map();
         const getSCCs = () => {
             const SCCs = new Map();
@@ -1038,7 +1038,7 @@ class AbstractGraph {
     }
     _getVertex(vertexOrKey) {
         const vertexKey = this._getVertexKey(vertexOrKey);
-        return this._vertices.get(vertexKey) || null;
+        return this._vertices.get(vertexKey) || undefined;
     }
     _getVertexKey(vertexOrKey) {
         return vertexOrKey instanceof AbstractVertex ? vertexOrKey.key : vertexOrKey;