binary-tree-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

@@ -165,6 +165,27 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Get edge between vertices
    *  const g = new DirectedGraph();
@@ -200,6 +221,27 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // DirectedGraph deleteEdge and vertex operations
    *  const graph = new DirectedGraph<string>();
@@ -237,6 +279,27 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Remove a vertex
  *  const g = new DirectedGraph();
@@ -262,6 +325,27 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Get incoming edges
    *  const g = new DirectedGraph();
@@ -286,6 +370,27 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Get outgoing edges
    *  const g = new DirectedGraph();
@@ -338,6 +443,27 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // DirectedGraph topologicalSort for task scheduling
    *  const graph = new DirectedGraph<string>();
@@ -372,6 +498,27 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get all edges
  *  const g = new DirectedGraph();
@@ -392,6 +539,27 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // Get outgoing neighbors
  *  const g = new DirectedGraph();
@@ -439,6 +607,27 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Find strongly connected components
    *  const g = new DirectedGraph();
@@ -482,6 +671,27 @@ export declare class DirectedGraph<V = any, E = any, VO extends DirectedVertex<V
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Get strongly connected components
    *  const g = new DirectedGraph();

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

@@ -182,6 +182,27 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Get edge between vertices
    *  const g = new UndirectedGraph();
@@ -216,6 +237,27 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // UndirectedGraph deleteEdge and vertex operations
    *  const graph = new UndirectedGraph<string>();
@@ -258,6 +300,27 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Remove vertex and edges
    *  const g = new UndirectedGraph();
@@ -294,6 +357,27 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Get all edges
    *  const g = new UndirectedGraph();
@@ -316,6 +400,27 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
    
    
    
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
+   
     * @example
  * // UndirectedGraph connectivity and neighbors
  *  const graph = new UndirectedGraph<string>();
@@ -385,6 +490,27 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Find articulation points and bridges
    *  const g = new UndirectedGraph();
@@ -422,6 +548,27 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Detect cycle
    *  const g = new UndirectedGraph();
@@ -447,6 +594,27 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Find bridge edges
    *  const g = new UndirectedGraph();
@@ -471,6 +639,27 @@ export declare class UndirectedGraph<V = any, E = any, VO extends UndirectedVert
      
      
      
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
+     
       * @example
    * // Find articulation points
    *  const g = new UndirectedGraph();