@graphty/algorithms 1.2.0 → 1.4.2

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

@@ -0,0 +1 @@
+{"version":3,"file":"math-utilities.js","sourceRoot":"","sources":["../../../src/utils/math-utilities.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,OAAO,YAAY;IAMrB;;;OAGG;IACH,YAAY,IAAY;QARP,MAAC,GAAG,UAAU,CAAC,CAAC,QAAQ;QACxB,MAAC,GAAG,UAAU,CAAC;QACf,MAAC,GAAG,KAAK,CAAC;QAOvB,kCAAkC;QAClC,IAAI,CAAC,IAAI,GAAG,CAAC,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;IACpD,CAAC;IAED;;;OAGG;IACH,IAAI;QACA,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,IAAI,GAAG,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,CAAC,CAAC;QACnD,OAAO,IAAI,CAAC,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACpC,CAAC;IAED;;;;OAIG;IACH,MAAM,CAAC,eAAe,CAAC,IAAY;QAC/B,MAAM,GAAG,GAAG,IAAI,YAAY,CAAC,IAAI,CAAC,CAAC;QACnC,OAAO,GAAG,EAAE,CAAC,GAAG,CAAC,IAAI,EAAE,CAAC;IAC5B,CAAC;CACJ;AAED;;;;;GAKG;AACH,MAAM,UAAU,OAAO,CAAI,KAAU,EAAE,MAAoB,IAAI,CAAC,MAAM;IAClE,KAAK,IAAI,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,MAAM,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,KAAK,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACvB,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAC5C,KAAK,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACjB,KAAK,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACpB,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;;;;;GAMG;AACH,MAAM,UAAU,iBAAiB,CAAC,CAAW,EAAE,CAAW;IACtD,IAAI,CAAC,CAAC,MAAM,KAAK,CAAC,CAAC,MAAM,EAAE,CAAC;QACxB,MAAM,IAAI,KAAK,CAAC,+BAA+B,CAAC,CAAC;IACrD,CAAC;IAED,IAAI,GAAG,GAAG,CAAC,CAAC;IACZ,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAChC,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,MAAM,IAAI,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAClB,IAAI,IAAI,KAAK,SAAS,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YAC3C,MAAM,IAAI,GAAG,IAAI,GAAG,IAAI,CAAC;YACzB,GAAG,IAAI,IAAI,GAAG,IAAI,CAAC;QACvB,CAAC;IACL,CAAC;IACD,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;AAC1B,CAAC;AAED,MAAM,CAAC,MAAM,SAAS,GAAG;IACrB;;;OAGG;IACH,MAAM,CAAC,MAA2B;QAC9B,MAAM,IAAI,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QACzC,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAC9B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,IAAI,CAAC,CAAC;QAC9B,MAAM,KAAK,GAAG,GAAG,GAAG,GAAG,CAAC;QAExB,IAAI,KAAK,KAAK,CAAC,EAAE,CAAC;YACd,OAAO;QACX,CAAC;QAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,CAAC,KAAK,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,CAAC;QAC3C,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,KAAK,CAAC,MAA2B;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;QACzC,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACZ,OAAO;QACX,CAAC;QAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,GAAG,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,MAA2B;QAC9B,MAAM,UAAU,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;QACxF,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,UAAU,CAAC,CAAC;QAEnC,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC;YACb,OAAO;QACX,CAAC;QAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,IAAI,CAAC,CAAC;QAClC,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,QAAQ,CAAC,MAA2B;QAChC,MAAM,GAAG,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,EAAE,CAAC,GAAG,GAAG,GAAG,EAAE,CAAC,CAAC,CAAC;QAE3E,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;YACZ,OAAO;QACX,CAAC;QAED,KAAK,MAAM,CAAC,GAAG,EAAE,KAAK,CAAC,IAAI,MAAM,EAAE,CAAC;YAChC,MAAM,CAAC,GAAG,CAAC,GAAG,EAAE,KAAK,GAAG,GAAG,CAAC,CAAC;QACjC,CAAC;IACL,CAAC;CACJ,CAAC"}

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

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

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

@@ -0,0 +1 @@
+{"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

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

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

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

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

@@ -0,0 +1,42 @@
+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

@@ -0,0 +1 @@
+{"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

@@ -0,0 +1,59 @@
+/**
+ * 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

@@ -0,0 +1 @@
+{"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/dist/src/utils/priorityQueue.d.ts

@@ -4,6 +4,10 @@
 export declare class MinPriorityQueue<T> {
     private heap;
     private compare;
+    /**
+     * Creates a new MinPriorityQueue instance.
+     * @param compareFunction - Custom comparison function. Returns negative if a has higher priority than b.
+     */
     constructor(compareFunction?: (a: T, b: T) => number);
     private defaultCompare;
     private parent;
@@ -12,10 +16,30 @@ export declare class MinPriorityQueue<T> {
     private swap;
     private heapifyUp;
     private heapifyDown;
+    /**
+     * Insert a value into the priority queue.
+     * @param value - The value to insert
+     */
     insert(value: T): void;
+    /**
+     * Remove and return the minimum value from the priority queue.
+     * @returns The minimum value, or undefined if the queue is empty
+     */
     extractMin(): T | undefined;
+    /**
+     * View the minimum value without removing it.
+     * @returns The minimum value, or undefined if the queue is empty
+     */
     peek(): T | undefined;
+    /**
+     * Check if the priority queue is empty.
+     * @returns True if the queue has no items, false otherwise
+     */
     isEmpty(): boolean;
+    /**
+     * Get the number of items in the priority queue.
+     * @returns The number of items currently in the queue
+     */
     size(): number;
 }
 //# sourceMappingURL=priorityQueue.d.ts.map

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

@@ -1 +1 @@
-{"version":3,"file":"priorityQueue.d.ts","sourceRoot":"","sources":["../../../src/utils/priorityQueue.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,qBAAa,gBAAgB,CAAC,CAAC;IAC3B,OAAO,CAAC,IAAI,CAAW;IACvB,OAAO,CAAC,OAAO,CAAyB;gBAE5B,eAAe,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM;IAIpD,OAAO,CAAC,cAAc;IAWtB,OAAO,CAAC,MAAM;IAId,OAAO,CAAC,SAAS;IAIjB,OAAO,CAAC,UAAU;IAIlB,OAAO,CAAC,IAAI;IASZ,OAAO,CAAC,SAAS;IAcjB,OAAO,CAAC,WAAW;IA2BnB,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAKtB,UAAU,IAAI,CAAC,GAAG,SAAS;IAmB3B,IAAI,IAAI,CAAC,GAAG,SAAS;IAIrB,OAAO,IAAI,OAAO;IAIlB,IAAI,IAAI,MAAM;CAGjB"}
+{"version":3,"file":"priorityQueue.d.ts","sourceRoot":"","sources":["../../../src/utils/priorityQueue.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,qBAAa,gBAAgB,CAAC,CAAC;IAC3B,OAAO,CAAC,IAAI,CAAW;IACvB,OAAO,CAAC,OAAO,CAAyB;IAExC;;;OAGG;gBACS,eAAe,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,MAAM;IAIpD,OAAO,CAAC,cAAc;IAWtB,OAAO,CAAC,MAAM;IAId,OAAO,CAAC,SAAS;IAIjB,OAAO,CAAC,UAAU;IAIlB,OAAO,CAAC,IAAI;IASZ,OAAO,CAAC,SAAS;IAcjB,OAAO,CAAC,WAAW;IAqCnB;;;OAGG;IACH,MAAM,CAAC,KAAK,EAAE,CAAC,GAAG,IAAI;IAKtB;;;OAGG;IACH,UAAU,IAAI,CAAC,GAAG,SAAS;IAmB3B;;;OAGG;IACH,IAAI,IAAI,CAAC,GAAG,SAAS;IAIrB;;;OAGG;IACH,OAAO,IAAI,OAAO;IAIlB;;;OAGG;IACH,IAAI,IAAI,MAAM;CAGjB"}

package/dist/src/utils/priorityQueue.js

@@ -2,6 +2,10 @@
  * Min Priority Queue implementation for graph algorithms
  */
 export class MinPriorityQueue {
+    /**
+     * Creates a new MinPriorityQueue instance.
+     * @param compareFunction - Custom comparison function. Returns negative if a has higher priority than b.
+     */
     constructor(compareFunction) {
         this.heap = [];
         this.compare = compareFunction ?? ((a, b) => this.defaultCompare(a, b));
@@ -18,10 +22,10 @@ export class MinPriorityQueue {
         return Math.floor((i - 1) / 2);
     }
     leftChild(i) {
-        return (2 * i) + 1;
+        return 2 * i + 1;
     }
     rightChild(i) {
-        return (2 * i) + 2;
+        return 2 * i + 2;
     }
     swap(i, j) {
         const temp = this.heap[i];
@@ -52,12 +56,18 @@ export class MinPriorityQueue {
             const right = this.rightChild(index);
             const leftItem = this.heap[left];
             const minItem = this.heap[minIndex];
-            if (left < this.heap.length && leftItem !== undefined && minItem !== undefined && this.compare(leftItem, minItem) < 0) {
+            if (left < this.heap.length &&
+                leftItem !== undefined &&
+                minItem !== undefined &&
+                this.compare(leftItem, minItem) < 0) {
                 minIndex = left;
             }
             const rightItem = this.heap[right];
             const newMinItem = this.heap[minIndex];
-            if (right < this.heap.length && rightItem !== undefined && newMinItem !== undefined && this.compare(rightItem, newMinItem) < 0) {
+            if (right < this.heap.length &&
+                rightItem !== undefined &&
+                newMinItem !== undefined &&
+                this.compare(rightItem, newMinItem) < 0) {
                 minIndex = right;
             }
             if (minIndex !== index) {
@@ -69,10 +79,18 @@ export class MinPriorityQueue {
             }
         }
     }
+    /**
+     * Insert a value into the priority queue.
+     * @param value - The value to insert
+     */
     insert(value) {
         this.heap.push(value);
         this.heapifyUp(this.heap.length - 1);
     }
+    /**
+     * Remove and return the minimum value from the priority queue.
+     * @returns The minimum value, or undefined if the queue is empty
+     */
     extractMin() {
         if (this.heap.length === 0) {
             return undefined;
@@ -88,12 +106,24 @@ export class MinPriorityQueue {
         }
         return min;
     }
+    /**
+     * View the minimum value without removing it.
+     * @returns The minimum value, or undefined if the queue is empty
+     */
     peek() {
         return this.heap[0];
     }
+    /**
+     * Check if the priority queue is empty.
+     * @returns True if the queue has no items, false otherwise
+     */
     isEmpty() {
         return this.heap.length === 0;
     }
+    /**
+     * Get the number of items in the priority queue.
+     * @returns The number of items currently in the queue
+     */
     size() {
         return this.heap.length;
     }

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

@@ -1 +1 @@
-{"version":3,"file":"priorityQueue.js","sourceRoot":"","sources":["../../../src/utils/priorityQueue.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,OAAO,gBAAgB;IAIzB,YAAY,eAAwC;QAH5C,SAAI,GAAQ,EAAE,CAAC;QAInB,IAAI,CAAC,OAAO,GAAG,eAAe,IAAI,CAAC,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC;IAEO,cAAc,CAAC,CAAI,EAAE,CAAI;QAC7B,MAAM,aAAa,GAAG,CAA4B,CAAC;QACnD,MAAM,aAAa,GAAG,CAA4B,CAAC;QAEnD,IAAI,aAAa,CAAC,QAAQ,KAAK,SAAS,IAAI,aAAa,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/E,OAAO,aAAa,CAAC,QAAQ,GAAG,aAAa,CAAC,QAAQ,CAAC;QAC3D,CAAC;QAED,OAAO,CAAC,CAAC;IACb,CAAC;IAEO,MAAM,CAAC,CAAS;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,CAAC;IAEO,SAAS,CAAC,CAAS;QACvB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAEO,UAAU,CAAC,CAAS;QACxB,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;IACvB,CAAC;IAEO,IAAI,CAAC,CAAS,EAAE,CAAS;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAC5C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACxB,CAAC;IACL,CAAC;IAEO,SAAS,CAAC,KAAa;QAC3B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACf,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACvC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACtC,IAAI,OAAO,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrF,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;gBAC9B,KAAK,GAAG,WAAW,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACJ,MAAM;YACV,CAAC;QACL,CAAC;IACL,CAAC;IAEO,WAAW,CAAC,KAAa;QAC7B,OAAO,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAErC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpC,IAAI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,QAAQ,KAAK,SAAS,IAAI,OAAO,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC;gBACpH,QAAQ,GAAG,IAAI,CAAC;YACpB,CAAC;YAED,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvC,IAAI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,IAAI,SAAS,KAAK,SAAS,IAAI,UAAU,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,UAAU,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC7H,QAAQ,GAAG,KAAK,CAAC;YACrB,CAAC;YAED,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;gBACrB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAC3B,KAAK,GAAG,QAAQ,CAAC;YACrB,CAAC;iBAAM,CAAC;gBACJ,MAAM;YACV,CAAC;QACL,CAAC;IACL,CAAC;IAED,MAAM,CAAC,KAAQ;QACX,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACzC,CAAC;IAED,UAAU;QACN,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QAC3B,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACpB,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAED,IAAI;QACA,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IAED,OAAO;QACH,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAClC,CAAC;IAED,IAAI;QACA,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC5B,CAAC;CACJ"}
+{"version":3,"file":"priorityQueue.js","sourceRoot":"","sources":["../../../src/utils/priorityQueue.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,OAAO,gBAAgB;IAIzB;;;OAGG;IACH,YAAY,eAAwC;QAP5C,SAAI,GAAQ,EAAE,CAAC;QAQnB,IAAI,CAAC,OAAO,GAAG,eAAe,IAAI,CAAC,CAAC,CAAI,EAAE,CAAI,EAAE,EAAE,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAClF,CAAC;IAEO,cAAc,CAAC,CAAI,EAAE,CAAI;QAC7B,MAAM,aAAa,GAAG,CAA8B,CAAC;QACrD,MAAM,aAAa,GAAG,CAA8B,CAAC;QAErD,IAAI,aAAa,CAAC,QAAQ,KAAK,SAAS,IAAI,aAAa,CAAC,QAAQ,KAAK,SAAS,EAAE,CAAC;YAC/E,OAAO,aAAa,CAAC,QAAQ,GAAG,aAAa,CAAC,QAAQ,CAAC;QAC3D,CAAC;QAED,OAAO,CAAC,CAAC;IACb,CAAC;IAEO,MAAM,CAAC,CAAS;QACpB,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;IACnC,CAAC;IAEO,SAAS,CAAC,CAAS;QACvB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAEO,UAAU,CAAC,CAAS;QACxB,OAAO,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;IACrB,CAAC;IAEO,IAAI,CAAC,CAAS,EAAE,CAAS;QAC7B,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC1B,MAAM,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3B,IAAI,IAAI,KAAK,SAAS,IAAI,KAAK,KAAK,SAAS,EAAE,CAAC;YAC5C,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,KAAK,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;QACxB,CAAC;IACL,CAAC;IAEO,SAAS,CAAC,KAAa;QAC3B,OAAO,KAAK,GAAG,CAAC,EAAE,CAAC;YACf,MAAM,WAAW,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;YACvC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACjC,MAAM,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,WAAW,CAAC,CAAC;YACtC,IAAI,OAAO,KAAK,SAAS,IAAI,MAAM,KAAK,SAAS,IAAI,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,MAAM,CAAC,GAAG,CAAC,EAAE,CAAC;gBACrF,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,WAAW,CAAC,CAAC;gBAC9B,KAAK,GAAG,WAAW,CAAC;YACxB,CAAC;iBAAM,CAAC;gBACJ,MAAM;YACV,CAAC;QACL,CAAC;IACL,CAAC;IAEO,WAAW,CAAC,KAAa;QAC7B,OAAO,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC;YAC9B,IAAI,QAAQ,GAAG,KAAK,CAAC;YACrB,MAAM,IAAI,GAAG,IAAI,CAAC,SAAS,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,KAAK,GAAG,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC,CAAC;YAErC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACjC,MAAM,OAAO,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACpC,IACI,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM;gBACvB,QAAQ,KAAK,SAAS;gBACtB,OAAO,KAAK,SAAS;gBACrB,IAAI,CAAC,OAAO,CAAC,QAAQ,EAAE,OAAO,CAAC,GAAG,CAAC,EACrC,CAAC;gBACC,QAAQ,GAAG,IAAI,CAAC;YACpB,CAAC;YAED,MAAM,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACnC,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvC,IACI,KAAK,GAAG,IAAI,CAAC,IAAI,CAAC,MAAM;gBACxB,SAAS,KAAK,SAAS;gBACvB,UAAU,KAAK,SAAS;gBACxB,IAAI,CAAC,OAAO,CAAC,SAAS,EAAE,UAAU,CAAC,GAAG,CAAC,EACzC,CAAC;gBACC,QAAQ,GAAG,KAAK,CAAC;YACrB,CAAC;YAED,IAAI,QAAQ,KAAK,KAAK,EAAE,CAAC;gBACrB,IAAI,CAAC,IAAI,CAAC,KAAK,EAAE,QAAQ,CAAC,CAAC;gBAC3B,KAAK,GAAG,QAAQ,CAAC;YACrB,CAAC;iBAAM,CAAC;gBACJ,MAAM;YACV,CAAC;QACL,CAAC;IACL,CAAC;IAED;;;OAGG;IACH,MAAM,CAAC,KAAQ;QACX,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACtB,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;IACzC,CAAC;IAED;;;OAGG;IACH,UAAU;QACN,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,SAAS,CAAC;QACrB,CAAC;QAED,IAAI,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QAC3B,CAAC;QAED,MAAM,GAAG,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACzB,MAAM,IAAI,GAAG,IAAI,CAAC,IAAI,CAAC,GAAG,EAAE,CAAC;QAC7B,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;YACrB,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC;YACpB,IAAI,CAAC,WAAW,CAAC,CAAC,CAAC,CAAC;QACxB,CAAC;QAED,OAAO,GAAG,CAAC;IACf,CAAC;IAED;;;OAGG;IACH,IAAI;QACA,OAAO,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACxB,CAAC;IAED;;;OAGG;IACH,OAAO;QACH,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,KAAK,CAAC,CAAC;IAClC,CAAC;IAED;;;OAGG;IACH,IAAI;QACA,OAAO,IAAI,CAAC,IAAI,CAAC,MAAM,CAAC;IAC5B,CAAC;CACJ"}

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@graphty/algorithms",
-  "version": "1.2.0",
+  "version": "1.4.2",
   "description": "Graph algorithms library for browser environments implemented in TypeScript",
   "author": "Adam Powers <apowers@ato.ms>",
   "main": "dist/algorithms.js",
@@ -21,36 +21,10 @@
   "directories": {
     "example": "examples"
   },
-  "scripts": {
-    "test": "vitest",
-    "test:ui": "vitest --ui",
-    "test:run": "vitest run --project=default",
-    "test:coverage": "vitest run --coverage",
-    "test:browser": "vitest --project=browser",
-    "test:all": "vitest run --project=default --project=browser",
-    "lint": "eslint && tsc --noEmit",
-    "lint:fix": "eslint --fix",
-    "lint:pkg": "knip",
-    "lint:all": "npm run lint && npm run lint:pkg",
-    "typecheck": "tsc --noEmit",
-    "prepare": "husky",
-    "build": "tsc",
-    "build:bundle": "node scripts/build-bundle.js",
-    "build:all": "npm run build && npm run build:bundle",
-    "build:gh-pages": "npm run build:bundle && node scripts/build-gh-pages.js",
-    "build:watch": "tsc --watch",
-    "dev": "tsc --watch",
-    "examples": "node examples/run-all-examples.js",
-    "examples:run": "node examples/run-all-examples.js",
-    "examples:html": "npm run build:bundle && vite",
-    "serve": "npm run build:bundle && vite",
-    "commit": "cz",
-    "ready:commit": "npm run build && npm run lint && npm run test:all",
-    "watch": "tsc --watch"
-  },
   "repository": {
     "type": "git",
-    "url": "git+https://github.com/graphty-org/algorithms.git"
+    "url": "git+https://github.com/graphty-org/graphty-monorepo.git",
+    "directory": "algorithms"
   },
   "keywords": [
     "graph",
@@ -70,9 +44,9 @@
     "provenance": true
   },
   "bugs": {
-    "url": "https://github.com/graphty-org/algorithms/issues"
+    "url": "https://github.com/graphty-org/graphty-monorepo/issues"
   },
-  "homepage": "https://github.com/graphty-org/algorithms#readme",
+  "homepage": "https://github.com/graphty-org/graphty-monorepo/tree/master/algorithms#readme",
   "engines": {
     "node": ">=18.19.0"
   },
@@ -82,30 +56,75 @@
     }
   },
   "devDependencies": {
-    "@commitlint/cli": "^19.8.1",
-    "@commitlint/config-conventional": "^19.8.1",
     "@eslint/js": "^9.29.0",
     "@semantic-release/changelog": "^6.0.3",
     "@semantic-release/git": "^10.0.1",
-    "@stylistic/eslint-plugin": "^4.4.1",
-    "@types/node": "^20.19.2",
+    "@types/benchmark": "^2.1.5",
+    "@types/node": "^20.19.9",
     "@vitest/browser": "^3.2.4",
     "@vitest/coverage-v8": "^3.2.4",
     "@vitest/ui": "^3.2.4",
-    "cz-conventional-changelog": "^3.3.0",
+    "benchmark": "^2.1.4",
     "eslint": "^9.29.0",
     "eslint-plugin-simple-import-sort": "^12.1.1",
+    "gh-pages": "^6.3.0",
     "globals": "^15.12.0",
     "happy-dom": "^18.0.1",
-    "husky": "^9.1.7",
     "knip": "^5.61.3",
     "playwright": "^1.53.0",
-    "semantic-release": "^24.2.7",
+    "semantic-release": "^25.0.2",
     "ts-node": "^10.9.2",
     "tsx": "^4.20.3",
     "typescript": "^5.8.3",
     "typescript-eslint": "^8.34.1",
     "vite": "^7.0.5",
     "vitest": "^3.2.4"
+  },
+  "dependencies": {
+    "pupt": "^1.3.2",
+    "typedfastbitset": "^0.6.1"
+  },
+  "scripts": {
+    "test": "vitest",
+    "test:ui": "vitest --ui",
+    "test:run": "vitest run --project=default",
+    "test:coverage": "vitest run --coverage",
+    "coverage": "npm run coverage:shards && npm run coverage:merge",
+    "coverage:merge": "./scripts/coverage-merge.sh",
+    "coverage:shards": "npm run coverage:shards:clean && npm run coverage:shards:run",
+    "coverage:shards:clean": "rm -rf .coverage-parts",
+    "coverage:shards:run": "npm run coverage:shard:default && npm run coverage:shard:browser",
+    "coverage:shard:default": "COVERAGE_DIR=.coverage-parts/default vitest run --project=default --coverage",
+    "coverage:shard:browser": "COVERAGE_DIR=.coverage-parts/browser vitest run --project=browser --coverage",
+    "coverage:fast": "vitest run --project=default --coverage",
+    "coverage:preview": "npx serve coverage -p 9051",
+    "test:browser": "vitest --project=browser",
+    "test:all": "vitest run --project=default --project=browser",
+    "test:performance": "tsx test/helpers/run-performance-regression.ts",
+    "test:performance:update": "tsx test/helpers/run-performance-regression.ts --update-baselines",
+    "benchmark": "tsx src/benchmark-all-algorithms.ts",
+    "benchmark:quick": "tsx src/benchmark-all-algorithms.ts --quick",
+    "benchmark:report": "tsx scripts/generate-performance-report.ts",
+    "benchmark:validation": "tsx src/optimized/benchmark-validation.ts",
+    "benchmark:comprehensive": "tsx src/optimized/benchmark-comprehensive.ts",
+    "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",
+    "typecheck": "tsc --noEmit",
+    "build": "tsc",
+    "build:bundle": "node scripts/build-bundle.js",
+    "build:all": "npm run build && npm run build:bundle",
+    "build:gh-pages": "npm run build:bundle && node scripts/build-gh-pages.js",
+    "build:watch": "tsc --watch",
+    "dev": "tsc --watch",
+    "examples": "node examples/run-all-examples.js",
+    "examples:run": "node examples/run-all-examples.js",
+    "examples:html": "npm run build:bundle && vite",
+    "serve": "npm run build:bundle && vite",
+    "commit": "cz",
+    "ready:commit": "npm run build && npm run lint && npm run test:all",
+    "watch": "tsc --watch"
   }
-}
+}