data-structure-typed 2.5.0 → 2.5.2

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

@@ -8,7 +8,7 @@
 
 import type { DijkstraResult, EntryCallback, GraphOptions, VertexKey } from '../../types';
 import { uuidV4 } from '../../utils';
-import { ERR } from '../../common';
+import { ERR, raise } from '../../common';
 import { IterableEntryBase } from '../base';
 import { IGraph } from '../../interfaces';
 import { Heap } from '../heap';
@@ -212,7 +212,7 @@ export abstract class AbstractGraph<
    * @returns `true` if string/number; else `false`.
    * @remarks Time O(1), Space O(1)
    */
-  isVertexKey(potentialKey: any): potentialKey is VertexKey {
+  isVertexKey(potentialKey: unknown): potentialKey is VertexKey {
     const potentialKeyType = typeof potentialKey;
     return potentialKeyType === 'string' || potentialKeyType === 'number';
   }
@@ -275,7 +275,7 @@ export abstract class AbstractGraph<
         const newEdge = this.createEdge(srcOrEdge, dest, weight, value);
         return this._addEdge(newEdge);
       } else {
-        throw new TypeError(ERR.invalidArgument('dest must be a Vertex or vertex key when srcOrEdge is an Edge.', 'Graph'));
+        raise(TypeError, ERR.invalidArgument('dest must be a Vertex or vertex key when srcOrEdge is an Edge.', 'Graph'));
       }
     }
   }
@@ -894,7 +894,7 @@ export abstract class AbstractGraph<
    * @returns A new graph of the same concrete class (`this` type).
    * @remarks Time O(V + E), Space O(V + E)
    */
-  filter(predicate: EntryCallback<VertexKey, V | undefined, boolean>, thisArg?: any): this {
+  filter(predicate: EntryCallback<VertexKey, V | undefined, boolean>, thisArg?: unknown): this {
     const filtered: [VertexKey, V | undefined][] = [];
     let index = 0;
     for (const [key, value] of this) {
@@ -912,7 +912,7 @@ export abstract class AbstractGraph<
    */
   filterEntries(
     predicate: EntryCallback<VertexKey, V | undefined, boolean>,
-    thisArg?: any
+    thisArg?: unknown
   ): [VertexKey, V | undefined][] {
     const filtered: [VertexKey, V | undefined][] = [];
     let index = 0;
@@ -925,7 +925,7 @@ export abstract class AbstractGraph<
     return filtered;
   }
 
-  map<T>(callback: EntryCallback<VertexKey, V | undefined, T>, thisArg?: any): T[] {
+  map<T>(callback: EntryCallback<VertexKey, V | undefined, T>, thisArg?: unknown): T[] {
     const mapped: T[] = [];
     let index = 0;
     for (const [key, value] of this) {

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

@@ -226,6 +226,29 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get edge between vertices
  *  const g = new DirectedGraph();
@@ -298,6 +321,29 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // DirectedGraph deleteEdge and vertex operations
  *  const graph = new DirectedGraph<string>();
@@ -365,6 +411,29 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Remove a vertex
  *  const g = new DirectedGraph();
@@ -432,6 +501,29 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get incoming edges
  *  const g = new DirectedGraph();
@@ -464,6 +556,29 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get outgoing edges
  *  const g = new DirectedGraph();
@@ -568,6 +683,29 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // DirectedGraph topologicalSort for task scheduling
  *  const graph = new DirectedGraph<string>();
@@ -639,6 +777,29 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get all edges
  *  const g = new DirectedGraph();
@@ -667,6 +828,29 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get outgoing neighbors
  *  const g = new DirectedGraph();
@@ -753,6 +937,29 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Find strongly connected components
  *  const g = new DirectedGraph();
@@ -849,6 +1056,29 @@ export class DirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get strongly connected components
  *  const g = new DirectedGraph();

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

@@ -235,6 +235,29 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get edge between vertices
  *  const g = new UndirectedGraph();
@@ -303,6 +326,29 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // UndirectedGraph deleteEdge and vertex operations
  *  const graph = new UndirectedGraph<string>();
@@ -366,6 +412,29 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Remove vertex and edges
  *  const g = new UndirectedGraph();
@@ -453,6 +522,29 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get all edges
  *  const g = new UndirectedGraph();
@@ -485,6 +577,29 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // UndirectedGraph connectivity and neighbors
  *  const graph = new UndirectedGraph<string>();
@@ -591,6 +706,29 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Find articulation points and bridges
  *  const g = new UndirectedGraph();
@@ -741,6 +879,29 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Detect cycle
  *  const g = new UndirectedGraph();
@@ -789,6 +950,29 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Find bridge edges
  *  const g = new UndirectedGraph();
@@ -817,6 +1001,29 @@ export class UndirectedGraph<
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Find articulation points
  *  const g = new UndirectedGraph();