data-structure-typed 2.5.0 → 2.5.1

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

@@ -131,7 +131,7 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * @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;
     /**
      * Delete a vertex and its incident edges.
      * @param vertexOrKey - Vertex or key.
@@ -252,13 +252,13 @@ export declare abstract class AbstractGraph<V = any, E = any, VO extends Abstrac
      * @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;
     /**
      * Preserve the old behavior: return filtered entries as an array.
      * @remarks Time O(V), Space O(V)
      */
-    filterEntries(predicate: EntryCallback<VertexKey, V | undefined, boolean>, thisArg?: any): [VertexKey, V | undefined][];
-    map<T>(callback: EntryCallback<VertexKey, V | undefined, T>, thisArg?: any): T[];
+    filterEntries(predicate: EntryCallback<VertexKey, V | undefined, boolean>, thisArg?: unknown): [VertexKey, V | undefined][];
+    map<T>(callback: EntryCallback<VertexKey, V | undefined, T>, thisArg?: unknown): T[];
     /**
      * Create a deep clone of the graph with the same species.
      * @remarks Time O(V + E), Space O(V + E)

package/dist/types/data-structures/graph/directed-graph.d.ts

@@ -164,6 +164,26 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Get edge between vertices
@@ -199,6 +219,26 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // DirectedGraph deleteEdge and vertex operations
@@ -236,6 +276,26 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
     * @example
  * // Remove a vertex
@@ -261,6 +321,26 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Get incoming edges
@@ -285,6 +365,26 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Get outgoing edges
@@ -337,6 +437,26 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // DirectedGraph topologicalSort for task scheduling
@@ -371,6 +491,26 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
     * @example
  * // Get all edges
@@ -391,6 +531,26 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
     * @example
  * // Get outgoing neighbors
@@ -438,6 +598,26 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Find strongly connected components
@@ -481,6 +661,26 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Get strongly connected components

package/dist/types/data-structures/graph/undirected-graph.d.ts

@@ -181,6 +181,26 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Get edge between vertices
@@ -215,6 +235,26 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // UndirectedGraph deleteEdge and vertex operations
@@ -257,6 +297,26 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Remove vertex and edges
@@ -293,6 +353,26 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Get all edges
@@ -315,6 +395,26 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
    
     * @example
  * // UndirectedGraph connectivity and neighbors
@@ -384,6 +484,26 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Find articulation points and bridges
@@ -421,6 +541,26 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Detect cycle
@@ -446,6 +586,26 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Find bridge edges
@@ -470,6 +630,26 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
      
       * @example
    * // Find articulation points