@graphty/algorithms 1.7.0 → 1.7.2

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@graphty/algorithms",
-  "version": "1.7.0",
+  "version": "1.7.2",
   "description": "Graph algorithms library for browser environments implemented in TypeScript",
   "author": "Adam Powers <apowers@ato.ms>",
   "main": "dist/algorithms.js",
@@ -88,7 +88,6 @@
     "vitest": "^3.2.4"
   },
   "dependencies": {
-    "pupt": "^1.3.2",
     "typedfastbitset": "^0.6.1"
   },
   "scripts": {
@@ -117,8 +116,7 @@
     "memory:profile": "tsx test/helpers/memory-profiler.ts",
     "lint": "eslint && tsc --noEmit",
     "lint:fix": "eslint --fix",
-    "lint:pkg": "knip",
-    "lint:all": "npm run lint && npm run lint:pkg",
+    "lint:knip": "cd .. && pnpm run lint:knip -- --workspace algorithms",
     "typecheck": "tsc --noEmit",
     "build": "tsc",
     "build:bundle": "node scripts/build-bundle.js",

package/src/algorithms/community/louvain-optimized.ts

@@ -13,7 +13,7 @@ import type { CommunityResult, NodeId } from "../../types/index.js";
  * Expected speedup: 2-5x on large graphs with many leaf nodes
  */
 
-export interface OptimizedLouvainOptions {
+interface OptimizedLouvainOptions {
     /**
      * Resolution parameter (default: 1.0)
      */

package/src/clustering/spectral.ts

@@ -1,6 +1,6 @@
 import type { Graph } from "../core/graph.js";
 import type { NodeId } from "../types/index.js";
-import { euclideanDistance } from "../utils/math-utilities.js";
+import { euclideanDistance, SeededRandom } from "../utils/math-utilities.js";
 
 /**
  * Spectral Clustering implementation
@@ -17,6 +17,7 @@ export interface SpectralClusteringOptions {
     laplacianType?: "unnormalized" | "normalized" | "randomWalk"; // Type of Laplacian
     maxIterations?: number; // Max iterations for k-means (default: 100)
     tolerance?: number; // Convergence tolerance (default: 1e-4)
+    seed?: number; // Random seed for reproducible results
 }
 
 export interface SpectralClusteringResult {
@@ -41,7 +42,10 @@ export interface SpectralClusteringResult {
  * @returns Spectral clustering result with communities and cluster assignments
  */
 export function spectralClustering(graph: Graph, options: SpectralClusteringOptions): SpectralClusteringResult {
-    const { k, laplacianType = "normalized", maxIterations = 100, tolerance = 1e-4 } = options;
+    const { k, laplacianType = "normalized", maxIterations = 100, tolerance = 1e-4, seed } = options;
+
+    // Create random function - use seeded PRNG if seed provided, otherwise Math.random
+    const random = seed !== undefined ? SeededRandom.createGenerator(seed) : Math.random;
 
     // Input validation
     if (k < 1 || !Number.isInteger(k)) {
@@ -67,7 +71,7 @@ export function spectralClustering(graph: Graph, options: SpectralClusteringOpti
     const laplacianMatrix = buildLaplacianMatrix(adjacencyMatrix, laplacianType);
 
     // Find k smallest eigenvectors
-    const eigenResult = findSmallestEigenvectors(laplacianMatrix, k);
+    const eigenResult = findSmallestEigenvectors(laplacianMatrix, k, random);
 
     // Perform k-means clustering on the eigenvectors
     // For spectral clustering, we need to transpose the eigenvector matrix
@@ -89,7 +93,7 @@ export function spectralClustering(graph: Graph, options: SpectralClusteringOpti
         normalizeRows(dataPoints);
     }
 
-    const kmeans = kMeansClustering(dataPoints, k, maxIterations, tolerance);
+    const kmeans = kMeansClustering(dataPoints, k, maxIterations, tolerance, random);
 
     // Build communities
     const communities: NodeId[][] = Array.from({ length: k }, () => []);
@@ -293,11 +297,13 @@ function buildLaplacianMatrix(adjacency: number[][], type: string): number[][] {
  * This is a simplified implementation - in practice, you'd use LAPACK or similar
  * @param matrix - The Laplacian matrix for eigendecomposition
  * @param k - Number of smallest eigenvectors to find
+ * @param random - Random number generator function
  * @returns Object containing eigenvalues and corresponding eigenvectors
  */
 function findSmallestEigenvectors(
     matrix: number[][],
     k: number,
+    random: () => number,
 ): {
     eigenvalues: number[];
     eigenvectors: number[][];
@@ -318,7 +324,7 @@ function findSmallestEigenvectors(
     // For spectral clustering, we need proper eigenvectors
     // Special handling for small k values which are common in clustering
     if (k <= 3 && n > k) {
-        return computeSmallestEigenvectorsSimple(matrix, k, n);
+        return computeSmallestEigenvectorsSimple(matrix, k, n, random);
     }
 
     // For larger k, use power iteration
@@ -330,7 +336,7 @@ function findSmallestEigenvectors(
         // Initialize random vector
         let vector = Array(n)
             .fill(0)
-            .map(() => Math.random() - 0.5);
+            .map(() => random() - 0.5);
 
         // Normalize initial vector
         const initNorm = Math.sqrt(vector.reduce((sum, val) => sum + val * val, 0));
@@ -447,6 +453,7 @@ function normalizeRows(matrix: number[][]): void {
  * @param k - Number of clusters to form
  * @param maxIterations - Maximum number of iterations
  * @param tolerance - Convergence tolerance for centroid movement
+ * @param random - Random number generator function
  * @returns Object containing cluster assignments and final centroids
  */
 function kMeansClustering(
@@ -454,6 +461,7 @@ function kMeansClustering(
     k: number,
     maxIterations: number,
     tolerance = 1e-4,
+    random: () => number = Math.random,
 ): { assignments: number[]; centroids: number[][] } {
     const n = data.length;
     const d = data[0]?.length ?? 0;
@@ -476,7 +484,7 @@ function kMeansClustering(
     const selectedIndices = new Set<number>();
 
     while (centroids.length < k && selectedIndices.size < n) {
-        const idx = Math.floor(Math.random() * n);
+        const idx = Math.floor(random() * n);
         if (!selectedIndices.has(idx) && data[idx]) {
             selectedIndices.add(idx);
             centroids.push([...data[idx]]);
@@ -487,7 +495,7 @@ function kMeansClustering(
     while (centroids.length < k) {
         const centroid = Array(d).fill(0) as number[];
         for (let j = 0; j < d; j++) {
-            centroid[j] = Math.random() - 0.5;
+            centroid[j] = random() - 0.5;
         }
         centroids.push(centroid);
     }
@@ -611,12 +619,14 @@ function kMeansClustering(
  * @param matrix - The Laplacian matrix
  * @param k - Number of eigenvectors to compute (1-3)
  * @param n - Size of the matrix
+ * @param random - Random number generator function
  * @returns Object containing eigenvalues and eigenvectors
  */
 function computeSmallestEigenvectorsSimple(
     matrix: number[][],
     k: number,
     n: number,
+    random: () => number,
 ): {
     eigenvalues: number[];
     eigenvectors: number[][];
@@ -635,7 +645,7 @@ function computeSmallestEigenvectorsSimple(
         const maxEig = 2; // For normalized Laplacian, max eigenvalue <= 2
         let vector = Array(n)
             .fill(0)
-            .map(() => Math.random() - 0.5);
+            .map(() => random() - 0.5);
 
         // Make orthogonal to first eigenvector
         const dot1 = vector.reduce((sum, val) => sum + val / Math.sqrt(n), 0);
@@ -681,7 +691,7 @@ function computeSmallestEigenvectorsSimple(
     if (k >= 3) {
         let vector = Array(n)
             .fill(0)
-            .map(() => Math.random() - 0.5);
+            .map(() => random() - 0.5);
 
         // Orthogonalize against previous eigenvectors
         for (const prev of eigenvectors) {

package/src/optimized/direction-optimized-bfs.ts

@@ -5,7 +5,7 @@ import { CSRGraph } from "./csr-graph.js";
 /**
  * Options for Direction-Optimized BFS
  */
-export interface DirectionOptimizedBFSOptions {
+interface DirectionOptimizedBFSOptions {
     alpha?: number; // Default: 15 - Controls top-down to bottom-up switch
     beta?: number; // Default: 18 - Controls bottom-up to top-down switch
 }
@@ -13,7 +13,7 @@ export interface DirectionOptimizedBFSOptions {
 /**
  * Result of BFS traversal
  */
-export interface BFSResult<TNodeId> {
+interface BFSResult<TNodeId> {
     distances: Map<TNodeId, number>;
     parents: Map<TNodeId, TNodeId | null>;
     visitedCount: number;
@@ -293,18 +293,3 @@ export function directionOptimizedBFS<TNodeId = NodeId>(
     return bfs.search(source);
 }
 
-/**
- * Convenience function for multi-source BFS.
- * @param graph - The CSR graph to perform BFS on
- * @param sources - Array of source node IDs to start the BFS from
- * @param options - Optional configuration for switching thresholds
- * @returns The BFS result containing distances and parent pointers
- */
-export function directionOptimizedBFSMultiple<TNodeId = NodeId>(
-    graph: CSRGraph<TNodeId>,
-    sources: TNodeId[],
-    options?: DirectionOptimizedBFSOptions,
-): BFSResult<TNodeId> {
-    const bfs = new DirectionOptimizedBFS(graph, options);
-    return bfs.searchMultiple(sources);
-}

package/dist/src/utils/algorithm-utilities.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=algorithm-utilities.d.ts.map

package/dist/src/utils/algorithm-utilities.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"algorithm-utilities.d.ts","sourceRoot":"","sources":["../../../src/utils/algorithm-utilities.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC"}

package/dist/src/utils/algorithm-utilities.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=algorithm-utilities.js.map

package/dist/src/utils/algorithm-utilities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"algorithm-utilities.js","sourceRoot":"","sources":["../../../src/utils/algorithm-utilities.ts"],"names":[],"mappings":""}

package/dist/src/utils/index.d.ts

@@ -1,5 +0,0 @@
-export * from "./algorithm-utilities.js";
-export * from "./graph-utilities.js";
-export * from "./math-utilities.js";
-export * from "./matrix-utilities.js";
-//# sourceMappingURL=index.d.ts.map

package/dist/src/utils/index.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,0BAA0B,CAAC;AACzC,cAAc,sBAAsB,CAAC;AACrC,cAAc,qBAAqB,CAAC;AACpC,cAAc,uBAAuB,CAAC"}

package/dist/src/utils/index.js

@@ -1,5 +0,0 @@
-export * from "./algorithm-utilities.js";
-export * from "./graph-utilities.js";
-export * from "./math-utilities.js";
-export * from "./matrix-utilities.js";
-//# sourceMappingURL=index.js.map

package/dist/src/utils/index.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/utils/index.ts"],"names":[],"mappings":"AAAA,cAAc,0BAA0B,CAAC;AACzC,cAAc,sBAAsB,CAAC;AACrC,cAAc,qBAAqB,CAAC;AACpC,cAAc,uBAAuB,CAAC"}

package/dist/src/utils/matrix-utilities.d.ts

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=matrix-utilities.d.ts.map

package/dist/src/utils/matrix-utilities.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"matrix-utilities.d.ts","sourceRoot":"","sources":["../../../src/utils/matrix-utilities.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,CAAC"}

package/dist/src/utils/matrix-utilities.js

@@ -1,2 +0,0 @@
-export {};
-//# sourceMappingURL=matrix-utilities.js.map

package/dist/src/utils/matrix-utilities.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"matrix-utilities.js","sourceRoot":"","sources":["../../../src/utils/matrix-utilities.ts"],"names":[],"mappings":""}

package/dist/src/utils/optimization-helpers.d.ts

@@ -1,42 +0,0 @@
-import type { Graph } from "../core/graph.js";
-/**
- * Common interface for algorithm options with optimization support
- */
-export interface OptimizableOptions {
-    /**
-     * Whether to use optimized implementations
-     * - true: Force use of optimizations
-     * - false: Disable optimizations
-     * - "auto": Automatically decide based on graph size (default)
-     */
-    optimized?: boolean | "auto";
-}
-/**
- * Determine if optimizations should be used for a given graph
- * @param graph - The graph to check for optimization eligibility
- * @param options - Options containing the optimization preference
- * @returns True if optimizations should be used for this graph
- */
-export declare function shouldOptimize(graph: Graph, options?: OptimizableOptions): boolean;
-/**
- * Merge optimization options with algorithm-specific options
- * @param graph - The graph to determine optimization settings for
- * @param options - Algorithm options that may include optimization settings
- * @returns The options with resolved optimization boolean flag
- */
-export declare function mergeOptimizationOptions<T extends Record<string, unknown>>(graph: Graph, options: T & OptimizableOptions): T & {
-    optimized?: boolean;
-};
-/**
- * Create an optimized version of an algorithm
- * @param algorithm - The algorithm function to wrap with optimization support
- * @param optionsTransformer - Optional function to transform options before passing to the algorithm
- * @returns A wrapped version of the algorithm that applies optimization transformations
- * @example
- * const optimizedBetweenness = createOptimizedAlgorithm(
- *     betweennessCentrality,
- *     (graph, options) => ({...options, optimized: true})
- * );
- */
-export declare function createOptimizedAlgorithm<TArgs extends [Graph, ...unknown[]], TResult>(algorithm: (...args: TArgs) => TResult, optionsTransformer?: (graph: Graph, options: unknown) => unknown): (...args: TArgs) => TResult;
-//# sourceMappingURL=optimization-helpers.d.ts.map

package/dist/src/utils/optimization-helpers.d.ts.map

@@ -1 +0,0 @@
-{"version":3,"file":"optimization-helpers.d.ts","sourceRoot":"","sources":["../../../src/utils/optimization-helpers.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,KAAK,EAAE,MAAM,kBAAkB,CAAC;AAE9C;;GAEG;AACH,MAAM,WAAW,kBAAkB;IAC/B;;;;;OAKG;IACH,SAAS,CAAC,EAAE,OAAO,GAAG,MAAM,CAAC;CAChC;AAaD;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,GAAE,kBAAuB,GAAG,OAAO,CAStF;AAED;;;;;GAKG;AACH,wBAAgB,wBAAwB,CAAC,CAAC,SAAS,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,EACtE,KAAK,EAAE,KAAK,EACZ,OAAO,EAAE,CAAC,GAAG,kBAAkB,GAChC,CAAC,GAAG;IAAE,SAAS,CAAC,EAAE,OAAO,CAAA;CAAE,CAO7B;AAED;;;;;;;;;;GAUG;AACH,wBAAgB,wBAAwB,CAAC,KAAK,SAAS,CAAC,KAAK,EAAE,GAAG,OAAO,EAAE,CAAC,EAAE,OAAO,EACjF,SAAS,EAAE,CAAC,GAAG,IAAI,EAAE,KAAK,KAAK,OAAO,EACtC,kBAAkB,CAAC,EAAE,CAAC,KAAK,EAAE,KAAK,EAAE,OAAO,EAAE,OAAO,KAAK,OAAO,GACjE,CAAC,GAAG,IAAI,EAAE,KAAK,KAAK,OAAO,CAW7B"}

package/dist/src/utils/optimization-helpers.js

@@ -1,59 +0,0 @@
-/**
- * Check if a graph should use optimizations based on its size
- * @param nodeCount - The number of nodes in the graph
- * @param edgeCount - The number of edges in the graph
- * @returns True if the graph is large enough to benefit from optimizations
- */
-function shouldUseOptimizations(nodeCount, edgeCount) {
-    // Use optimizations for graphs with more than 10k nodes or 100k edges
-    return nodeCount > 10000 || edgeCount > 100000;
-}
-/**
- * Determine if optimizations should be used for a given graph
- * @param graph - The graph to check for optimization eligibility
- * @param options - Options containing the optimization preference
- * @returns True if optimizations should be used for this graph
- */
-export function shouldOptimize(graph, options = {}) {
-    const { optimized = "auto" } = options;
-    if (optimized === "auto") {
-        // Check graph size
-        return shouldUseOptimizations(graph.nodeCount, graph.totalEdgeCount);
-    }
-    return optimized;
-}
-/**
- * Merge optimization options with algorithm-specific options
- * @param graph - The graph to determine optimization settings for
- * @param options - Algorithm options that may include optimization settings
- * @returns The options with resolved optimization boolean flag
- */
-export function mergeOptimizationOptions(graph, options) {
-    const { optimized: userOptimized, ...rest } = options;
-    return {
-        ...rest,
-        optimized: shouldOptimize(graph, userOptimized !== undefined ? { optimized: userOptimized } : {}),
-    };
-}
-/**
- * Create an optimized version of an algorithm
- * @param algorithm - The algorithm function to wrap with optimization support
- * @param optionsTransformer - Optional function to transform options before passing to the algorithm
- * @returns A wrapped version of the algorithm that applies optimization transformations
- * @example
- * const optimizedBetweenness = createOptimizedAlgorithm(
- *     betweennessCentrality,
- *     (graph, options) => ({...options, optimized: true})
- * );
- */
-export function createOptimizedAlgorithm(algorithm, optionsTransformer) {
-    return (...args) => {
-        const [graph, options, ...rest] = args;
-        if (optionsTransformer && options !== undefined) {
-            const transformedOptions = optionsTransformer(graph, options);
-            return algorithm(...[graph, transformedOptions, ...rest]);
-        }
-        return algorithm(...args);
-    };
-}
-//# sourceMappingURL=optimization-helpers.js.map

package/dist/src/utils/optimization-helpers.js.map

@@ -1 +0,0 @@
-{"version":3,"file":"optimization-helpers.js","sourceRoot":"","sources":["../../../src/utils/optimization-helpers.ts"],"names":[],"mappings":"AAeA;;;;;GAKG;AACH,SAAS,sBAAsB,CAAC,SAAiB,EAAE,SAAiB;IAChE,sEAAsE;IACtE,OAAO,SAAS,GAAG,KAAK,IAAI,SAAS,GAAG,MAAM,CAAC;AACnD,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,cAAc,CAAC,KAAY,EAAE,UAA8B,EAAE;IACzE,MAAM,EAAE,SAAS,GAAG,MAAM,EAAE,GAAG,OAAO,CAAC;IAEvC,IAAI,SAAS,KAAK,MAAM,EAAE,CAAC;QACvB,mBAAmB;QACnB,OAAO,sBAAsB,CAAC,KAAK,CAAC,SAAS,EAAE,KAAK,CAAC,cAAc,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;;;;GAKG;AACH,MAAM,UAAU,wBAAwB,CACpC,KAAY,EACZ,OAA+B;IAE/B,MAAM,EAAE,SAAS,EAAE,aAAa,EAAE,GAAG,IAAI,EAAE,GAAG,OAAO,CAAC;IAEtD,OAAO;QACH,GAAG,IAAI;QACP,SAAS,EAAE,cAAc,CAAC,KAAK,EAAE,aAAa,KAAK,SAAS,CAAC,CAAC,CAAC,EAAE,SAAS,EAAE,aAAa,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;KACrE,CAAC;AACrC,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,wBAAwB,CACpC,SAAsC,EACtC,kBAAgE;IAEhE,OAAO,CAAC,GAAG,IAAW,EAAW,EAAE;QAC/B,MAAM,CAAC,KAAK,EAAE,OAAO,EAAE,GAAG,IAAI,CAAC,GAAG,IAAI,CAAC;QAEvC,IAAI,kBAAkB,IAAI,OAAO,KAAK,SAAS,EAAE,CAAC;YAC9C,MAAM,kBAAkB,GAAG,kBAAkB,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;YAC9D,OAAO,SAAS,CAAC,GAAI,CAAC,KAAK,EAAE,kBAAkB,EAAE,GAAG,IAAI,CAAsB,CAAC,CAAC;QACpF,CAAC;QAED,OAAO,SAAS,CAAC,GAAG,IAAI,CAAC,CAAC;IAC9B,CAAC,CAAC;AACN,CAAC"}

package/src/utils/algorithm-utilities.ts

@@ -1,2 +0,0 @@
-// Algorithm utility functions will be added here
-export {};

package/src/utils/index.ts

@@ -1,4 +0,0 @@
-export * from "./algorithm-utilities.js";
-export * from "./graph-utilities.js";
-export * from "./math-utilities.js";
-export * from "./matrix-utilities.js";

package/src/utils/matrix-utilities.ts

@@ -1,2 +0,0 @@
-// Matrix utility functions will be added here
-export {};

package/src/utils/optimization-helpers.ts

@@ -1,87 +0,0 @@
-import type { Graph } from "../core/graph.js";
-
-/**
- * Common interface for algorithm options with optimization support
- */
-export interface OptimizableOptions {
-    /**
-     * Whether to use optimized implementations
-     * - true: Force use of optimizations
-     * - false: Disable optimizations
-     * - "auto": Automatically decide based on graph size (default)
-     */
-    optimized?: boolean | "auto";
-}
-
-/**
- * Check if a graph should use optimizations based on its size
- * @param nodeCount - The number of nodes in the graph
- * @param edgeCount - The number of edges in the graph
- * @returns True if the graph is large enough to benefit from optimizations
- */
-function shouldUseOptimizations(nodeCount: number, edgeCount: number): boolean {
-    // Use optimizations for graphs with more than 10k nodes or 100k edges
-    return nodeCount > 10000 || edgeCount > 100000;
-}
-
-/**
- * Determine if optimizations should be used for a given graph
- * @param graph - The graph to check for optimization eligibility
- * @param options - Options containing the optimization preference
- * @returns True if optimizations should be used for this graph
- */
-export function shouldOptimize(graph: Graph, options: OptimizableOptions = {}): boolean {
-    const { optimized = "auto" } = options;
-
-    if (optimized === "auto") {
-        // Check graph size
-        return shouldUseOptimizations(graph.nodeCount, graph.totalEdgeCount);
-    }
-
-    return optimized;
-}
-
-/**
- * Merge optimization options with algorithm-specific options
- * @param graph - The graph to determine optimization settings for
- * @param options - Algorithm options that may include optimization settings
- * @returns The options with resolved optimization boolean flag
- */
-export function mergeOptimizationOptions<T extends Record<string, unknown>>(
-    graph: Graph,
-    options: T & OptimizableOptions,
-): T & { optimized?: boolean } {
-    const { optimized: userOptimized, ...rest } = options;
-
-    return {
-        ...rest,
-        optimized: shouldOptimize(graph, userOptimized !== undefined ? { optimized: userOptimized } : {}),
-    } as T & { optimized?: boolean };
-}
-
-/**
- * Create an optimized version of an algorithm
- * @param algorithm - The algorithm function to wrap with optimization support
- * @param optionsTransformer - Optional function to transform options before passing to the algorithm
- * @returns A wrapped version of the algorithm that applies optimization transformations
- * @example
- * const optimizedBetweenness = createOptimizedAlgorithm(
- *     betweennessCentrality,
- *     (graph, options) => ({...options, optimized: true})
- * );
- */
-export function createOptimizedAlgorithm<TArgs extends [Graph, ...unknown[]], TResult>(
-    algorithm: (...args: TArgs) => TResult,
-    optionsTransformer?: (graph: Graph, options: unknown) => unknown,
-): (...args: TArgs) => TResult {
-    return (...args: TArgs): TResult => {
-        const [graph, options, ...rest] = args;
-
-        if (optionsTransformer && options !== undefined) {
-            const transformedOptions = optionsTransformer(graph, options);
-            return algorithm(...([graph, transformedOptions, ...rest] as unknown as TArgs));
-        }
-
-        return algorithm(...args);
-    };
-}