graph-typed 1.44.1 → 1.45.1

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "graph-typed",
-  "version": "1.44.1",
+  "version": "1.45.1",
   "description": "Graph. Javascript & Typescript Data Structure.",
   "main": "dist/index.js",
   "scripts": {
@@ -136,6 +136,6 @@
     "typescript": "^4.9.5"
   },
   "dependencies": {
-    "data-structure-typed": "^1.44.1"
+    "data-structure-typed": "^1.45.0"
   }
 }

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

@@ -5,10 +5,10 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import {BST, BSTNode} from './bst';
-import type {AVLTreeNodeNested, AVLTreeOptions, BiTreeDeleteResult, BTNKey} from '../../types';
-import {BTNCallback} from '../../types';
-import {IBinaryTree} from '../../interfaces';
+import { BST, BSTNode } from './bst';
+import type { AVLTreeNodeNested, AVLTreeOptions, BiTreeDeleteResult, BTNKey } from '../../types';
+import { BTNCallback } from '../../types';
+import { IBinaryTree } from '../../interfaces';
 
 export class AVLTreeNode<V = any, N extends AVLTreeNode<V, N> = AVLTreeNodeNested<V>> extends BSTNode<V, N> {
   height: number;
@@ -95,7 +95,7 @@ export class AVLTree<V = any, N extends AVLTreeNode<V, N> = AVLTreeNode<V, AVLTr
   ): BiTreeDeleteResult<N>[] {
     if ((identifier as any) instanceof AVLTreeNode) callback = (node => node) as C;
     const deletedResults = super.delete(identifier, callback);
-    for (const {needBalanced} of deletedResults) {
+    for (const { needBalanced } of deletedResults) {
       if (needBalanced) {
         this._balancePath(needBalanced);
       }
@@ -118,7 +118,7 @@ export class AVLTree<V = any, N extends AVLTreeNode<V, N> = AVLTreeNode<V, AVLTr
     destNode = this.ensureNotKey(destNode);
 
     if (srcNode && destNode) {
-      const {key, value, height} = destNode;
+      const { key, value, height } = destNode;
       const tempNode = this.createNode(key, value);
 
       if (tempNode) {
@@ -209,7 +209,7 @@ export class AVLTree<V = any, N extends AVLTreeNode<V, N> = AVLTreeNode<V, AVLTr
       // Balance Restoration: If a balance issue is discovered after inserting a node, it requires balance restoration operations. Balance restoration includes four basic cases where rotation operations need to be performed to fix the balance:
       switch (
         this._balanceFactor(A) // second O(1)
-      ) {
+        ) {
         case -2:
           if (A && A.left) {
             if (this._balanceFactor(A.left) <= 0) {

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

@@ -5,7 +5,7 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import {getMSB} from '../../utils';
+import { getMSB } from '../../utils';
 
 export class BinaryIndexedTree {
   protected readonly _freq: number;
@@ -17,10 +17,10 @@ export class BinaryIndexedTree {
    * @param  - - `frequency`: The default frequency value. It is optional and has a default
    * value of 0.
    */
-  constructor({frequency = 0, max}: {frequency?: number; max: number}) {
+  constructor({ frequency = 0, max }: { frequency?: number; max: number }) {
     this._freq = frequency;
     this._max = max;
-    this._freqMap = {0: 0};
+    this._freqMap = { 0: 0 };
     this._msb = getMSB(max);
     this._negativeCount = frequency < 0 ? max : 0;
   }

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

@@ -6,11 +6,11 @@
  * @license MIT License
  */
 
-import type {BinaryTreeNodeNested, BinaryTreeOptions, BTNCallback, BTNKey} from '../../types';
-import {BiTreeDeleteResult, DFSOrderPattern, FamilyPosition, IterationType} from '../../types';
-import {IBinaryTree} from '../../interfaces';
-import {trampoline} from '../../utils';
-import {Queue} from '../queue';
+import type { BinaryTreeNodeNested, BinaryTreeOptions, BTNCallback, BTNKey } from '../../types';
+import { BiTreeDeleteResult, DFSOrderPattern, FamilyPosition, IterationType } from '../../types';
+import { IBinaryTree } from '../../interfaces';
+import { trampoline } from '../../utils';
+import { Queue } from '../queue';
 
 /**
  * Represents a node in a binary tree.
@@ -107,7 +107,8 @@ export class BinaryTreeNode<V = any, N extends BinaryTreeNode<V, N> = BinaryTree
  * Represents a binary tree data structure.
  * @template N - The type of the binary tree's nodes.
  */
-export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode<V, BinaryTreeNodeNested<V>>> implements IBinaryTree<V, N> {
+export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode<V, BinaryTreeNodeNested<V>>>
+  implements IBinaryTree<V, N> {
   iterationType: IterationType = IterationType.ITERATIVE;
 
   /**
@@ -116,7 +117,7 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
    */
   constructor(options?: BinaryTreeOptions) {
     if (options) {
-      const {iterationType = IterationType.ITERATIVE} = options;
+      const { iterationType = IterationType.ITERATIVE } = options;
       this.iterationType = iterationType;
     }
     this._size = 0;
@@ -315,7 +316,7 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
         // Handle the case when there's only one root node
         this._setRoot(null);
       } else {
-        const {familyPosition: fp} = curr;
+        const { familyPosition: fp } = curr;
         if (fp === FamilyPosition.LEFT || fp === FamilyPosition.ROOT_LEFT) {
           parent.left = curr.right;
         } else if (fp === FamilyPosition.RIGHT || fp === FamilyPosition.ROOT_RIGHT) {
@@ -330,7 +331,8 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
           const parentOfLeftSubTreeMax = leftSubTreeRightMost.parent;
           orgCurrent = this._swap(curr, leftSubTreeRightMost);
           if (parentOfLeftSubTreeMax) {
-            if (parentOfLeftSubTreeMax.right === leftSubTreeRightMost) parentOfLeftSubTreeMax.right = leftSubTreeRightMost.left;
+            if (parentOfLeftSubTreeMax.right === leftSubTreeRightMost)
+              parentOfLeftSubTreeMax.right = leftSubTreeRightMost.left;
             else parentOfLeftSubTreeMax.left = leftSubTreeRightMost.left;
             needBalanced = parentOfLeftSubTreeMax;
           }
@@ -339,7 +341,7 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
     }
     this._size = this.size - 1;
 
-    deletedResult.push({deleted: orgCurrent, needBalanced});
+    deletedResult.push({ deleted: orgCurrent, needBalanced });
     return deletedResult;
   }
 
@@ -409,14 +411,14 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
 
       return _getMaxHeight(beginRoot);
     } else {
-      const stack: {node: N; depth: number}[] = [{node: beginRoot, depth: 0}];
+      const stack: { node: N; depth: number }[] = [{ node: beginRoot, depth: 0 }];
       let maxHeight = 0;
 
       while (stack.length > 0) {
-        const {node, depth} = stack.pop()!;
+        const { node, depth } = stack.pop()!;
 
-        if (node.left) stack.push({node: node.left, depth: depth + 1});
-        if (node.right) stack.push({node: node.right, depth: depth + 1});
+        if (node.left) stack.push({ node: node.left, depth: depth + 1 });
+        if (node.right) stack.push({ node: node.right, depth: depth + 1 });
 
         maxHeight = Math.max(maxHeight, depth);
       }
@@ -912,7 +914,10 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
    * @returns The function `getLeftMost` returns the leftmost node (`N`) in the binary tree. If there
    * is no leftmost node, it returns `null` or `undefined` depending on the input.
    */
-  getLeftMost(beginRoot: BTNKey | N | null | undefined = this.root, iterationType = this.iterationType): N | null | undefined {
+  getLeftMost(
+    beginRoot: BTNKey | N | null | undefined = this.root,
+    iterationType = this.iterationType
+  ): N | null | undefined {
     beginRoot = this.ensureNotKey(beginRoot);
 
     if (!beginRoot) return beginRoot;
@@ -955,7 +960,10 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
    * @returns The function `getRightMost` returns the rightmost node (`N`) in a binary tree. If there
    * is no rightmost node, it returns `null` or `undefined`, depending on the input.
    */
-  getRightMost(beginRoot: BTNKey | N | null | undefined = this.root, iterationType = this.iterationType): N | null | undefined {
+  getRightMost(
+    beginRoot: BTNKey | N | null | undefined = this.root,
+    iterationType = this.iterationType
+  ): N | null | undefined {
     // TODO support get right most by passing key in
     beginRoot = this.ensureNotKey(beginRoot);
     if (!beginRoot) return beginRoot;
@@ -1284,7 +1292,7 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
       _traverse(beginRoot);
     } else {
       // 0: visit, 1: print
-      const stack: {opt: 0 | 1; node: N | null | undefined}[] = [{opt: 0, node: beginRoot}];
+      const stack: { opt: 0 | 1; node: N | null | undefined }[] = [{ opt: 0, node: beginRoot }];
 
       while (stack.length > 0) {
         const cur = stack.pop();
@@ -1299,24 +1307,24 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
         } else {
           switch (pattern) {
             case 'in':
-              cur.node && stack.push({opt: 0, node: cur.node.right});
-              stack.push({opt: 1, node: cur.node});
-              cur.node && stack.push({opt: 0, node: cur.node.left});
+              cur.node && stack.push({ opt: 0, node: cur.node.right });
+              stack.push({ opt: 1, node: cur.node });
+              cur.node && stack.push({ opt: 0, node: cur.node.left });
               break;
             case 'pre':
-              cur.node && stack.push({opt: 0, node: cur.node.right});
-              cur.node && stack.push({opt: 0, node: cur.node.left});
-              stack.push({opt: 1, node: cur.node});
+              cur.node && stack.push({ opt: 0, node: cur.node.right });
+              cur.node && stack.push({ opt: 0, node: cur.node.left });
+              stack.push({ opt: 1, node: cur.node });
               break;
             case 'post':
-              stack.push({opt: 1, node: cur.node});
-              cur.node && stack.push({opt: 0, node: cur.node.right});
-              cur.node && stack.push({opt: 0, node: cur.node.left});
+              stack.push({ opt: 1, node: cur.node });
+              cur.node && stack.push({ opt: 0, node: cur.node.right });
+              cur.node && stack.push({ opt: 0, node: cur.node.left });
               break;
             default:
-              cur.node && stack.push({opt: 0, node: cur.node.right});
-              stack.push({opt: 1, node: cur.node});
-              cur.node && stack.push({opt: 0, node: cur.node.left});
+              cur.node && stack.push({ opt: 0, node: cur.node.right });
+              stack.push({ opt: 1, node: cur.node });
+              cur.node && stack.push({ opt: 0, node: cur.node.left });
               break;
           }
         }
@@ -1686,7 +1694,7 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
    * @returns The `*[Symbol.iterator]` method returns a generator object that yields the keys of the
    * binary tree nodes in a specific order.
    */
-  *[Symbol.iterator](node = this.root): Generator<BTNKey, void, undefined> {
+  * [Symbol.iterator](node = this.root): Generator<BTNKey, void, undefined> {
     if (!node) {
       return;
     }
@@ -1798,7 +1806,7 @@ export class BinaryTree<V = any, N extends BinaryTreeNode<V, N> = BinaryTreeNode
     destNode = this.ensureNotKey(destNode);
 
     if (srcNode && destNode) {
-      const {key, value} = destNode;
+      const { key, value } = destNode;
       const tempNode = this.createNode(key, value);
 
       if (tempNode) {

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

@@ -5,11 +5,11 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type {BSTComparator, BSTNodeNested, BSTOptions, BTNCallback, BTNKey} from '../../types';
-import {CP, IterationType} from '../../types';
-import {BinaryTree, BinaryTreeNode} from './binary-tree';
-import {IBinaryTree} from '../../interfaces';
-import {Queue} from '../queue';
+import type { BSTComparator, BSTNodeNested, BSTOptions, BTNCallback, BTNKey } from '../../types';
+import { CP, IterationType } from '../../types';
+import { BinaryTree, BinaryTreeNode } from './binary-tree';
+import { IBinaryTree } from '../../interfaces';
+import { Queue } from '../queue';
 
 export class BSTNode<V = any, N extends BSTNode<V, N> = BSTNodeNested<V>> extends BinaryTreeNode<V, N> {
   override parent?: N;
@@ -62,7 +62,9 @@ export class BSTNode<V = any, N extends BSTNode<V, N> = BSTNodeNested<V>> extend
   }
 }
 
-export class BST<V = any, N extends BSTNode<V, N> = BSTNode<V, BSTNodeNested<V>>> extends BinaryTree<V, N> implements IBinaryTree<V, N> {
+export class BST<V = any, N extends BSTNode<V, N> = BSTNode<V, BSTNodeNested<V>>>
+  extends BinaryTree<V, N>
+  implements IBinaryTree<V, N> {
   /**
    * The constructor function initializes a binary search tree with an optional comparator function.
    * @param {BSTOptions} [options] - An optional object that contains additional configuration options
@@ -72,7 +74,7 @@ export class BST<V = any, N extends BSTNode<V, N> = BSTNode<V, BSTNodeNested<V>>
     super(options);
     this._root = undefined;
     if (options !== undefined) {
-      const {comparator} = options;
+      const { comparator } = options;
       if (comparator !== undefined) {
         this._comparator = comparator;
       }
@@ -225,7 +227,9 @@ export class BST<V = any, N extends BSTNode<V, N> = BSTNode<V, BSTNodeNested<V>>
     }
 
     const inserted: (N | undefined)[] = [];
-    const combinedArr: [BTNKey | N, V][] = keysOrNodes.map((value: BTNKey | N, index) => [value, data?.[index]] as [BTNKey | N, V]);
+    const combinedArr: [BTNKey | N, V][] = keysOrNodes.map(
+      (value: BTNKey | N, index) => [value, data?.[index]] as [BTNKey | N, V]
+    );
 
     let sorted = [];
 

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

@@ -6,12 +6,23 @@
  * @license MIT License
  */
 
-import {BiTreeDeleteResult, BTNCallback, BTNKey, IterationType, RBTNColor, RBTreeOptions, RedBlackTreeNodeNested} from '../../types';
-import {BST, BSTNode} from './bst';
-import {IBinaryTree} from '../../interfaces';
-import {BinaryTreeNode} from './binary-tree';
-
-export class RedBlackTreeNode<V = any, N extends RedBlackTreeNode<V, N> = RedBlackTreeNodeNested<V>> extends BSTNode<V, N> {
+import {
+  BiTreeDeleteResult,
+  BTNCallback,
+  BTNKey,
+  IterationType,
+  RBTNColor,
+  RBTreeOptions,
+  RedBlackTreeNodeNested
+} from '../../types';
+import { BST, BSTNode } from './bst';
+import { IBinaryTree } from '../../interfaces';
+import { BinaryTreeNode } from './binary-tree';
+
+export class RedBlackTreeNode<V = any, N extends RedBlackTreeNode<V, N> = RedBlackTreeNodeNested<V>> extends BSTNode<
+  V,
+  N
+> {
   color: RBTNColor;
 
   constructor(key: BTNKey, value?: V, color: RBTNColor = RBTNColor.BLACK) {

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

@@ -6,7 +6,7 @@
  * @license MIT License
  */
 
-import type {SegmentTreeNodeVal} from '../../types';
+import type { SegmentTreeNodeVal } from '../../types';
 
 export class SegmentTreeNode {
   start = 0;

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

@@ -5,12 +5,15 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import type {BTNKey, TreeMultimapNodeNested, TreeMultimapOptions} from '../../types';
-import {BiTreeDeleteResult, BTNCallback, CP, FamilyPosition, IterationType} from '../../types';
-import {IBinaryTree} from '../../interfaces';
-import {AVLTree, AVLTreeNode} from './avl-tree';
-
-export class TreeMultimapNode<V = any, N extends TreeMultimapNode<V, N> = TreeMultimapNodeNested<V>> extends AVLTreeNode<V, N> {
+import type { BTNKey, TreeMultimapNodeNested, TreeMultimapOptions } from '../../types';
+import { BiTreeDeleteResult, BTNCallback, CP, FamilyPosition, IterationType } from '../../types';
+import { IBinaryTree } from '../../interfaces';
+import { AVLTree, AVLTreeNode } from './avl-tree';
+
+export class TreeMultimapNode<
+  V = any,
+  N extends TreeMultimapNode<V, N> = TreeMultimapNodeNested<V>
+> extends AVLTreeNode<V, N> {
   count: number;
 
   /**
@@ -292,7 +295,7 @@ export class TreeMultimap<V = any, N extends TreeMultimapNode<V, N> = TreeMultim
         if (!parent) {
           if (curr.right !== undefined) this._setRoot(curr.right);
         } else {
-          const {familyPosition: fp} = curr;
+          const { familyPosition: fp } = curr;
           if (fp === FamilyPosition.LEFT || fp === FamilyPosition.ROOT_LEFT) {
             parent.left = curr.right;
           } else if (fp === FamilyPosition.RIGHT || fp === FamilyPosition.ROOT_RIGHT) {
@@ -320,7 +323,7 @@ export class TreeMultimap<V = any, N extends TreeMultimapNode<V, N> = TreeMultim
       if (orgCurrent) this._count -= orgCurrent.count;
     }
 
-    deletedResult.push({deleted: orgCurrent, needBalanced});
+    deletedResult.push({ deleted: orgCurrent, needBalanced });
 
     if (needBalanced) {
       this._balancePath(needBalanced);
@@ -396,7 +399,7 @@ export class TreeMultimap<V = any, N extends TreeMultimapNode<V, N> = TreeMultim
     srcNode = this.ensureNotKey(srcNode);
     destNode = this.ensureNotKey(destNode);
     if (srcNode && destNode) {
-      const {key, value, count, height} = destNode;
+      const { key, value, count, height } = destNode;
       const tempNode = this.createNode(key, value, count);
       if (tempNode) {
         tempNode.height = height;

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

@@ -5,11 +5,11 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import {uuidV4} from '../../utils';
-import {PriorityQueue} from '../priority-queue';
-import type {DijkstraResult, VertexKey} from '../../types';
-import {IGraph} from '../../interfaces';
-import {Queue} from '../queue';
+import { uuidV4 } from '../../utils';
+import { PriorityQueue } from '../priority-queue';
+import type { DijkstraResult, VertexKey } from '../../types';
+import { IGraph } from '../../interfaces';
+import { Queue } from '../queue';
 
 export abstract class AbstractVertex<V = any> {
   key: VertexKey;
@@ -300,11 +300,11 @@ export abstract class AbstractGraph<
       return [];
     }
 
-    const stack: {vertex: VO; path: VO[]}[] = [];
-    stack.push({vertex: vertex1, path: [vertex1]});
+    const stack: { vertex: VO; path: VO[] }[] = [];
+    stack.push({ vertex: vertex1, path: [vertex1] });
 
     while (stack.length > 0) {
-      const {vertex, path} = stack.pop()!;
+      const { vertex, path } = stack.pop()!;
 
       if (vertex === vertex2) {
         paths.push(path);
@@ -315,7 +315,7 @@ export abstract class AbstractGraph<
       for (const neighbor of neighbors) {
         if (!path.includes(neighbor)) {
           const newPath = [...path, neighbor];
-          stack.push({vertex: neighbor, path: newPath});
+          stack.push({ vertex: neighbor, path: newPath });
         }
       }
     }
@@ -514,7 +514,12 @@ export abstract class AbstractGraph<
    * 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 | null,
+    getMinDist?: boolean,
+    genPaths?: boolean
+  ): DijkstraResult<VO> {
     if (getMinDist === undefined) getMinDist = false;
     if (genPaths === undefined) genPaths = false;
 
@@ -586,7 +591,7 @@ export abstract class AbstractGraph<
           if (genPaths) {
             getPaths(destVertex);
           }
-          return {distMap, preMap, seen, paths, minDist, minPath};
+          return { distMap, preMap, seen, paths, minDist, minPath };
         }
         const neighbors = this.getNeighbors(cur);
         for (const neighbor of neighbors) {
@@ -609,18 +614,18 @@ export abstract class AbstractGraph<
     }
 
     getMinDist &&
-      distMap.forEach((d, v) => {
-        if (v !== srcVertex) {
-          if (d < minDist) {
-            minDist = d;
-            if (genPaths) minDest = v;
-          }
+    distMap.forEach((d, v) => {
+      if (v !== srcVertex) {
+        if (d < minDist) {
+          minDist = d;
+          if (genPaths) minDest = v;
         }
-      });
+      }
+    });
 
     genPaths && getPaths(minDest);
 
-    return {distMap, preMap, seen, paths, minDist, minPath};
+    return { distMap, preMap, seen, paths, minDist, minPath };
   }
 
   /**
@@ -657,7 +662,12 @@ export abstract class AbstractGraph<
    * 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 | null,
+    getMinDist?: boolean,
+    genPaths?: boolean
+  ): DijkstraResult<VO> {
     if (getMinDist === undefined) getMinDist = false;
     if (genPaths === undefined) genPaths = false;
 
@@ -681,8 +691,8 @@ export abstract class AbstractGraph<
       if (vertexOrKey instanceof AbstractVertex) distMap.set(vertexOrKey, Infinity);
     }
 
-    const heap = new PriorityQueue<{key: number; value: VO}>({comparator: (a, b) => a.key - b.key});
-    heap.add({key: 0, value: srcVertex});
+    const heap = new PriorityQueue<{ key: number; value: VO }>({ comparator: (a, b) => a.key - b.key });
+    heap.add({ key: 0, value: srcVertex });
 
     distMap.set(srcVertex, 0);
     preMap.set(srcVertex, null);
@@ -723,7 +733,7 @@ export abstract class AbstractGraph<
             if (genPaths) {
               getPaths(destVertex);
             }
-            return {distMap, preMap, seen, paths, minDist, minPath};
+            return { distMap, preMap, seen, paths, minDist, minPath };
           }
           const neighbors = this.getNeighbors(cur);
           for (const neighbor of neighbors) {
@@ -733,7 +743,7 @@ export abstract class AbstractGraph<
                 const distSrcToNeighbor = distMap.get(neighbor);
                 if (distSrcToNeighbor) {
                   if (dist + weight < distSrcToNeighbor) {
-                    heap.add({key: dist + weight, value: neighbor});
+                    heap.add({ key: dist + weight, value: neighbor });
                     preMap.set(neighbor, cur);
                     distMap.set(neighbor, dist + weight);
                   }
@@ -760,7 +770,7 @@ export abstract class AbstractGraph<
       getPaths(minDest);
     }
 
-    return {distMap, preMap, seen, paths, minDist, minPath};
+    return { distMap, preMap, seen, paths, minDist, minPath };
   }
 
   /**
@@ -800,7 +810,7 @@ export abstract class AbstractGraph<
     // TODO
     let hasNegativeCycle: boolean | undefined;
     if (scanNegativeCycle) hasNegativeCycle = false;
-    if (!srcVertex) return {hasNegativeCycle, distMap, preMap, paths, min, minPath};
+    if (!srcVertex) return { hasNegativeCycle, distMap, preMap, paths, min, minPath };
 
     const vertices = this._vertices;
     const numOfVertices = vertices.size;
@@ -872,7 +882,7 @@ export abstract class AbstractGraph<
       }
     }
 
-    return {hasNegativeCycle, distMap, preMap, paths, min, minPath};
+    return { hasNegativeCycle, distMap, preMap, paths, min, minPath };
   }
 
   /**
@@ -913,7 +923,7 @@ export abstract class AbstractGraph<
    * `predecessor` property is a 2D array of vertices (or `null`) representing the predecessor vertices in the shortest
    * path between vertices in the
    */
-  floydWarshall(): {costs: number[][]; predecessor: (VO | null)[][]} {
+  floydWarshall(): { costs: number[][]; predecessor: (VO | null)[][] } {
     const idAndVertices = [...this._vertices];
     const n = idAndVertices.length;
 
@@ -945,7 +955,7 @@ export abstract class AbstractGraph<
         }
       }
     }
-    return {costs, predecessor};
+    return { costs, predecessor };
   }
 
   /**
@@ -982,7 +992,12 @@ export abstract class AbstractGraph<
    * are arrays of vertices that form cycles within the SCCs.
    * @returns The function `tarjan` returns an object with the following properties:
    */
-  tarjan(needCutVertexes: boolean = false, needBridges: boolean = false, needSCCs: boolean = true, needCycles: boolean = false) {
+  tarjan(
+    needCutVertexes: boolean = false,
+    needBridges: boolean = false,
+    needSCCs: boolean = true,
+    needCycles: boolean = false
+  ) {
     // !! in undirected graph we will not let child visit parent when dfs
     // !! articulation point(in dfs search tree not in graph): (cur !== root && cur.has(child)) && (low(child) >= dfn(cur)) || (cur === root && cur.children() >= 2)
     // !! bridge: low(child) > dfn(cur)
@@ -1081,7 +1096,7 @@ export abstract class AbstractGraph<
       });
     }
 
-    return {dfnMap, lowMap, bridges, cutVertexes, SCCs, cycles};
+    return { dfnMap, lowMap, bridges, cutVertexes, SCCs, cycles };
   }
 
   /**

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

@@ -5,10 +5,10 @@
  * @copyright Copyright (c) 2022 Tyler Zeng <zrwusa@gmail.com>
  * @license MIT License
  */
-import {arrayRemove} from '../../utils';
-import {AbstractEdge, AbstractGraph, AbstractVertex} from './abstract-graph';
-import type {TopologicalStatus, VertexKey} from '../../types';
-import {IGraph} from '../../interfaces';
+import { arrayRemove } from '../../utils';
+import { AbstractEdge, AbstractGraph, AbstractVertex } from './abstract-graph';
+import type { TopologicalStatus, VertexKey } from '../../types';
+import { IGraph } from '../../interfaces';
 
 export class DirectedVertex<V = any> extends AbstractVertex<V> {
   /**
@@ -45,7 +45,12 @@ export class DirectedEdge<E = any> extends AbstractEdge<E> {
   }
 }
 
-export class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V> = DirectedVertex<V>, EO extends DirectedEdge<E> = DirectedEdge<E>>
+export class DirectedGraph<
+  V = any,
+  E = any,
+  VO extends DirectedVertex<V> = DirectedVertex<V>,
+  EO extends DirectedEdge<E> = DirectedEdge<E>
+>
   extends AbstractGraph<V, E, VO, EO>
   implements IGraph<V, E, VO, EO> {
   /**

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

@@ -1,5 +1,5 @@
-import {MapGraphCoordinate, VertexKey} from '../../types';
-import {DirectedEdge, DirectedGraph, DirectedVertex} from './directed-graph';
+import { MapGraphCoordinate, VertexKey } from '../../types';
+import { DirectedEdge, DirectedGraph, DirectedVertex } from './directed-graph';
 
 export class MapVertex<V = any> extends DirectedVertex<V> {
   lat: number;
@@ -40,12 +40,12 @@ export class MapEdge<E = any> extends DirectedEdge<E> {
   }
 }
 
-export class MapGraph<V = any, E = any, VO extends MapVertex<V> = MapVertex<V>, EO extends MapEdge<E> = MapEdge<E>> extends DirectedGraph<
-  V,
-  E,
-  VO,
-  EO
-> {
+export class MapGraph<
+  V = any,
+  E = any,
+  VO extends MapVertex<V> = MapVertex<V>,
+  EO extends MapEdge<E> = MapEdge<E>
+> extends DirectedGraph<V, E, VO, EO> {
   /**
    * The constructor function initializes the origin and bottomRight properties of a MapGraphCoordinate object.
    * @param {MapGraphCoordinate} origin - The `origin` parameter is a `MapGraphCoordinate` object that represents the