@graphty/algorithms 1.0.1 → 1.1.0

package/dist/src/pathfinding/astar.js

@@ -0,0 +1,180 @@
+import { MinPriorityQueue } from "../utils/priorityQueue.js";
+import { pathfindingUtils } from "./utils.js";
+/**
+ * A* pathfinding algorithm
+ * Finds the shortest path from start to goal using a heuristic function
+ *
+ * @param graph - The graph represented as an adjacency list
+ * @param start - The starting node
+ * @param goal - The goal node
+ * @param heuristic - Heuristic function that estimates distance from node to goal
+ * @returns Object containing the shortest path and its cost, or null if no path exists
+ *
+ * Time Complexity: O(E) with good heuristic, O(b^d) worst case
+ * Space Complexity: O(V)
+ */
+export function astar(graph, start, goal, heuristic) {
+    if (!graph.has(start) || !graph.has(goal)) {
+        return null;
+    }
+    // Priority queue ordered by f(n) = g(n) + h(n)
+    const openSet = new MinPriorityQueue();
+    const gScore = new Map(); // Cost from start to node
+    const fScore = new Map(); // Estimated total cost
+    const cameFrom = new Map();
+    const closedSet = new Set();
+    // Initialize start node
+    gScore.set(start, 0);
+    fScore.set(start, heuristic(start, goal));
+    const startFScore = fScore.get(start);
+    if (startFScore === undefined) {
+        return null;
+    }
+    openSet.insert({ node: start, distance: startFScore });
+    while (!openSet.isEmpty()) {
+        const current = openSet.extractMin();
+        if (!current) {
+            break;
+        }
+        const currentNode = current.node;
+        if (currentNode === goal) {
+            // Reconstruct path
+            const path = pathfindingUtils.reconstructPath(cameFrom, goal);
+            const goalCost = gScore.get(goal);
+            if (goalCost === undefined) {
+                return null;
+            }
+            return { path, cost: goalCost };
+        }
+        closedSet.add(currentNode);
+        const neighbors = graph.get(currentNode);
+        if (!neighbors) {
+            continue;
+        }
+        for (const [neighbor, weight] of neighbors) {
+            if (closedSet.has(neighbor)) {
+                continue;
+            }
+            const currentNodeGScore = gScore.get(currentNode);
+            if (currentNodeGScore === undefined) {
+                continue;
+            }
+            const tentativeGScore = currentNodeGScore + weight;
+            const currentGScore = gScore.get(neighbor) ?? Infinity;
+            if (tentativeGScore < currentGScore) {
+                // This path to neighbor is better
+                cameFrom.set(neighbor, currentNode);
+                gScore.set(neighbor, tentativeGScore);
+                fScore.set(neighbor, tentativeGScore + heuristic(neighbor, goal));
+                // Add to open set if not already there
+                const neighborFScore = fScore.get(neighbor);
+                if (neighborFScore !== undefined) {
+                    openSet.insert({ node: neighbor, distance: neighborFScore });
+                }
+            }
+        }
+    }
+    return null; // No path found
+}
+/**
+ * A* pathfinding with path reconstruction details
+ * Returns detailed information about the search process
+ */
+export function astarWithDetails(graph, start, goal, heuristic) {
+    const openSet = new MinPriorityQueue();
+    const gScore = new Map();
+    const fScore = new Map();
+    const cameFrom = new Map();
+    const closedSet = new Set();
+    gScore.set(start, 0);
+    fScore.set(start, heuristic(start, goal));
+    const startFScore = fScore.get(start);
+    if (startFScore === undefined) {
+        return {
+            path: null,
+            cost: Infinity,
+            visited: new Set(),
+            gScores: new Map(),
+            fScores: new Map(),
+        };
+    }
+    openSet.insert({ node: start, distance: startFScore });
+    while (!openSet.isEmpty()) {
+        const current = openSet.extractMin();
+        if (!current) {
+            break;
+        }
+        const currentNode = current.node;
+        if (currentNode === goal) {
+            const path = pathfindingUtils.reconstructPath(cameFrom, goal);
+            return {
+                path,
+                cost: gScore.get(goal) ?? Infinity,
+                visited: closedSet,
+                gScores: gScore,
+                fScores: fScore,
+            };
+        }
+        closedSet.add(currentNode);
+        const neighbors = graph.get(currentNode);
+        if (!neighbors) {
+            continue;
+        }
+        for (const [neighbor, weight] of neighbors) {
+            if (closedSet.has(neighbor)) {
+                continue;
+            }
+            const currentNodeGScore = gScore.get(currentNode);
+            if (currentNodeGScore === undefined) {
+                continue;
+            }
+            const tentativeGScore = currentNodeGScore + weight;
+            const currentGScore = gScore.get(neighbor) ?? Infinity;
+            if (tentativeGScore < currentGScore) {
+                cameFrom.set(neighbor, currentNode);
+                gScore.set(neighbor, tentativeGScore);
+                fScore.set(neighbor, tentativeGScore + heuristic(neighbor, goal));
+                const neighborFScore = fScore.get(neighbor);
+                if (neighborFScore !== undefined) {
+                    openSet.insert({ node: neighbor, distance: neighborFScore });
+                }
+            }
+        }
+    }
+    return {
+        path: null,
+        cost: Infinity,
+        visited: closedSet,
+        gScores: gScore,
+        fScores: fScore,
+    };
+}
+/**
+ * Common heuristic functions for A*
+ */
+export const heuristics = {
+    /**
+   * Manhattan distance heuristic for grid-based graphs
+   */
+    manhattan: (a, b) => {
+        return Math.abs(a[0] - b[0]) + Math.abs(a[1] - b[1]);
+    },
+    /**
+   * Euclidean distance heuristic
+   */
+    euclidean: (a, b) => {
+        return Math.sqrt(Math.pow(a[0] - b[0], 2) + Math.pow(a[1] - b[1], 2));
+    },
+    /**
+   * Chebyshev distance heuristic (diagonal movement allowed)
+   */
+    chebyshev: (a, b) => {
+        return Math.max(Math.abs(a[0] - b[0]), Math.abs(a[1] - b[1]));
+    },
+    /**
+   * Zero heuristic (makes A* behave like Dijkstra)
+   */
+    // eslint-disable-next-line @typescript-eslint/no-unused-vars
+    zero: (_a, _b) => 0,
+};
+//# sourceMappingURL=astar.js.map

package/dist/src/pathfinding/astar.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"astar.js","sourceRoot":"","sources":["../../../src/pathfinding/astar.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,gBAAgB,EAAC,MAAM,2BAA2B,CAAC;AAC3D,OAAO,EAAC,gBAAgB,EAAC,MAAM,YAAY,CAAC;AAE5C;;;;;;;;;;;;GAYG;AACH,MAAM,UAAU,KAAK,CACjB,KAA6B,EAC7B,KAAQ,EACR,IAAO,EACP,SAAuC;IAEvC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;QACxC,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,+CAA+C;IAC/C,MAAM,OAAO,GAAG,IAAI,gBAAgB,EAAgB,CAAC;IACrD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAa,CAAC,CAAC,0BAA0B;IAC/D,MAAM,MAAM,GAAG,IAAI,GAAG,EAAa,CAAC,CAAC,uBAAuB;IAC5D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAQ,CAAC;IACjC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAK,CAAC;IAE/B,wBAAwB;IACxB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO,IAAI,CAAC;IAChB,CAAC;IAED,OAAO,CAAC,MAAM,CAAC,EAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAC,CAAC,CAAC;IAErD,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACrC,IAAI,CAAC,OAAO,EAAE,CAAC;YACX,MAAM;QACV,CAAC;QAED,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;QAEjC,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;YACvB,mBAAmB;YACnB,MAAM,IAAI,GAAG,gBAAgB,CAAC,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC9D,MAAM,QAAQ,GAAG,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;YAClC,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBACzB,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,OAAO,EAAC,IAAI,EAAE,IAAI,EAAE,QAAQ,EAAC,CAAC;QAClC,CAAC;QAED,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAE3B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACzC,IAAI,CAAC,SAAS,EAAE,CAAC;YACb,SAAS;QACb,CAAC;QAED,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YACzC,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1B,SAAS;YACb,CAAC;YAED,MAAM,iBAAiB,GAAG,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAClD,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;gBAClC,SAAS;YACb,CAAC;YAED,MAAM,eAAe,GAAG,iBAAiB,GAAG,MAAM,CAAC;YACnD,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC;YAEvD,IAAI,eAAe,GAAG,aAAa,EAAE,CAAC;gBAClC,kCAAkC;gBAClC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;gBACpC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;gBACtC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,eAAe,GAAG,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;gBAElE,uCAAuC;gBACvC,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC5C,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;oBAC/B,OAAO,CAAC,MAAM,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,EAAC,CAAC,CAAC;gBAC/D,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,IAAI,CAAC,CAAC,gBAAgB;AACjC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAC5B,KAA6B,EAC7B,KAAQ,EACR,IAAO,EACP,SAAuC;IAQvC,MAAM,OAAO,GAAG,IAAI,gBAAgB,EAAgB,CAAC;IACrD,MAAM,MAAM,GAAG,IAAI,GAAG,EAAa,CAAC;IACpC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAa,CAAC;IACpC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAQ,CAAC;IACjC,MAAM,SAAS,GAAG,IAAI,GAAG,EAAK,CAAC;IAE/B,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IACrB,MAAM,CAAC,GAAG,CAAC,KAAK,EAAE,SAAS,CAAC,KAAK,EAAE,IAAI,CAAC,CAAC,CAAC;IAC1C,MAAM,WAAW,GAAG,MAAM,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;QAC5B,OAAO;YACH,IAAI,EAAE,IAAI;YACV,IAAI,EAAE,QAAQ;YACd,OAAO,EAAE,IAAI,GAAG,EAAE;YAClB,OAAO,EAAE,IAAI,GAAG,EAAE;YAClB,OAAO,EAAE,IAAI,GAAG,EAAE;SACrB,CAAC;IACN,CAAC;IAED,OAAO,CAAC,MAAM,CAAC,EAAC,IAAI,EAAE,KAAK,EAAE,QAAQ,EAAE,WAAW,EAAC,CAAC,CAAC;IAErD,OAAO,CAAC,OAAO,CAAC,OAAO,EAAE,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,OAAO,CAAC,UAAU,EAAE,CAAC;QACrC,IAAI,CAAC,OAAO,EAAE,CAAC;YACX,MAAM;QACV,CAAC;QAED,MAAM,WAAW,GAAG,OAAO,CAAC,IAAI,CAAC;QAEjC,IAAI,WAAW,KAAK,IAAI,EAAE,CAAC;YACvB,MAAM,IAAI,GAAG,gBAAgB,CAAC,eAAe,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC9D,OAAO;gBACH,IAAI;gBACJ,IAAI,EAAE,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,QAAQ;gBAClC,OAAO,EAAE,SAAS;gBAClB,OAAO,EAAE,MAAM;gBACf,OAAO,EAAE,MAAM;aAClB,CAAC;QACN,CAAC;QAED,SAAS,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QAE3B,MAAM,SAAS,GAAG,KAAK,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;QACzC,IAAI,CAAC,SAAS,EAAE,CAAC;YACb,SAAS;QACb,CAAC;QAED,KAAK,MAAM,CAAC,QAAQ,EAAE,MAAM,CAAC,IAAI,SAAS,EAAE,CAAC;YACzC,IAAI,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1B,SAAS;YACb,CAAC;YAED,MAAM,iBAAiB,GAAG,MAAM,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;YAClD,IAAI,iBAAiB,KAAK,SAAS,EAAE,CAAC;gBAClC,SAAS;YACb,CAAC;YAED,MAAM,eAAe,GAAG,iBAAiB,GAAG,MAAM,CAAC;YACnD,MAAM,aAAa,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,QAAQ,CAAC;YAEvD,IAAI,eAAe,GAAG,aAAa,EAAE,CAAC;gBAClC,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,WAAW,CAAC,CAAC;gBACpC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,eAAe,CAAC,CAAC;gBACtC,MAAM,CAAC,GAAG,CAAC,QAAQ,EAAE,eAAe,GAAG,SAAS,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC,CAAC;gBAClE,MAAM,cAAc,GAAG,MAAM,CAAC,GAAG,CAAC,QAAQ,CAAC,CAAC;gBAC5C,IAAI,cAAc,KAAK,SAAS,EAAE,CAAC;oBAC/B,OAAO,CAAC,MAAM,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAE,QAAQ,EAAE,cAAc,EAAC,CAAC,CAAC;gBAC/D,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO;QACH,IAAI,EAAE,IAAI;QACV,IAAI,EAAE,QAAQ;QACd,OAAO,EAAE,SAAS;QAClB,OAAO,EAAE,MAAM;QACf,OAAO,EAAE,MAAM;KAClB,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,MAAM,UAAU,GAAG;IACtB;;KAEC;IACD,SAAS,EAAE,CAAC,CAAmB,EAAE,CAAmB,EAAU,EAAE;QAC5D,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IACzD,CAAC;IAED;;KAEC;IACD,SAAS,EAAE,CAAC,CAAmB,EAAE,CAAmB,EAAU,EAAE;QAC5D,OAAO,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;IAC1E,CAAC;IAED;;KAEC;IACD,SAAS,EAAE,CAAC,CAAmB,EAAE,CAAmB,EAAU,EAAE;QAC5D,OAAO,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;IAClE,CAAC;IAED;;KAEC;IACD,6DAA6D;IAC7D,IAAI,EAAE,CAAI,EAAK,EAAE,EAAK,EAAU,EAAE,CAAC,CAAC;CACvC,CAAC"}

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

@@ -0,0 +1,3 @@
+export * from "./astar.js";
+export * from "./utils.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/pathfinding/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC"}

package/dist/src/pathfinding/index.js

@@ -0,0 +1,3 @@
+export * from "./astar.js";
+export * from "./utils.js";
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/pathfinding/index.ts"],"names":[],"mappings":"AAAA,cAAc,YAAY,CAAC;AAC3B,cAAc,YAAY,CAAC"}

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

@@ -0,0 +1,18 @@
+/**
+ * Utility functions for pathfinding algorithms
+ */
+export declare const pathfindingUtils: {
+    /**
+   * Reconstructs a path from start to goal using the cameFrom map
+   */
+    reconstructPath<T>(cameFrom: Map<T, T>, goal: T): T[];
+    /**
+   * Creates a grid graph for testing pathfinding algorithms
+   */
+    createGridGraph(width: number, height: number, obstacles?: Set<string>): Map<string, Map<string, number>>;
+    /**
+   * Parses a grid coordinate string
+   */
+    parseGridCoordinate(coord: string): [number, number];
+};
+//# sourceMappingURL=utils.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"utils.d.ts","sourceRoot":"","sources":["../../../src/pathfinding/utils.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,eAAO,MAAM,gBAAgB;IACzB;;KAEC;oBACe,CAAC,YAAY,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE;IAiBrD;;KAEC;2BAEU,MAAM,UACL,MAAM,4BAEf,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAwCnC;;KAEC;+BAC0B,MAAM,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC;CAUvD,CAAC"}

package/dist/src/pathfinding/utils.js

@@ -0,0 +1,68 @@
+/**
+ * Utility functions for pathfinding algorithms
+ */
+export const pathfindingUtils = {
+    /**
+   * Reconstructs a path from start to goal using the cameFrom map
+   */
+    reconstructPath(cameFrom, goal) {
+        const path = [goal];
+        let current = goal;
+        while (cameFrom.has(current)) {
+            const next = cameFrom.get(current);
+            if (next === undefined) {
+                break;
+            }
+            current = next;
+            path.unshift(current);
+        }
+        return path;
+    },
+    /**
+   * Creates a grid graph for testing pathfinding algorithms
+   */
+    createGridGraph(width, height, obstacles = new Set()) {
+        const graph = new Map();
+        for (let x = 0; x < width; x++) {
+            for (let y = 0; y < height; y++) {
+                const node = `${String(x)},${String(y)}`;
+                if (obstacles.has(node)) {
+                    continue;
+                }
+                const neighbors = new Map();
+                // Add 4-directional neighbors
+                const directions = [
+                    [0, 1], [1, 0], [0, -1], [-1, 0],
+                ];
+                for (const dir of directions) {
+                    const dx = dir[0];
+                    const dy = dir[1];
+                    if (dx === undefined || dy === undefined) {
+                        continue;
+                    }
+                    const nx = x + dx;
+                    const ny = y + dy;
+                    const neighbor = `${String(nx)},${String(ny)}`;
+                    if (nx >= 0 && nx < width && ny >= 0 && ny < height && !obstacles.has(neighbor)) {
+                        neighbors.set(neighbor, 1); // Unit cost for grid movement
+                    }
+                }
+                graph.set(node, neighbors);
+            }
+        }
+        return graph;
+    },
+    /**
+   * Parses a grid coordinate string
+   */
+    parseGridCoordinate(coord) {
+        const parts = coord.split(",").map(Number);
+        const x = parts[0];
+        const y = parts[1];
+        if (x === undefined || y === undefined) {
+            throw new Error(`Invalid coordinate: ${coord}`);
+        }
+        return [x, y];
+    },
+};
+//# sourceMappingURL=utils.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"utils.js","sourceRoot":"","sources":["../../../src/pathfinding/utils.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,MAAM,CAAC,MAAM,gBAAgB,GAAG;IAC5B;;KAEC;IACD,eAAe,CAAI,QAAmB,EAAE,IAAO;QAC3C,MAAM,IAAI,GAAQ,CAAC,IAAI,CAAC,CAAC;QACzB,IAAI,OAAO,GAAG,IAAI,CAAC;QAEnB,OAAO,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3B,MAAM,IAAI,GAAG,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YACnC,IAAI,IAAI,KAAK,SAAS,EAAE,CAAC;gBACrB,MAAM;YACV,CAAC;YAED,OAAO,GAAG,IAAI,CAAC;YACf,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QAC1B,CAAC;QAED,OAAO,IAAI,CAAC;IAChB,CAAC;IAED;;KAEC;IACD,eAAe,CACX,KAAa,EACb,MAAc,EACd,YAAY,IAAI,GAAG,EAAU;QAE7B,MAAM,KAAK,GAAG,IAAI,GAAG,EAA+B,CAAC;QAErD,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,EAAE,CAAC,EAAE,EAAE,CAAC;YAC7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC9B,MAAM,IAAI,GAAG,GAAG,MAAM,CAAC,CAAC,CAAC,IAAI,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC;gBACzC,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;oBACtB,SAAS;gBACb,CAAC;gBAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;gBAE5C,8BAA8B;gBAC9B,MAAM,UAAU,GAAG;oBACf,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;iBACnC,CAAC;gBAEF,KAAK,MAAM,GAAG,IAAI,UAAU,EAAE,CAAC;oBAC3B,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;oBAClB,MAAM,EAAE,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC;oBAClB,IAAI,EAAE,KAAK,SAAS,IAAI,EAAE,KAAK,SAAS,EAAE,CAAC;wBACvC,SAAS;oBACb,CAAC;oBAED,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;oBAClB,MAAM,EAAE,GAAG,CAAC,GAAG,EAAE,CAAC;oBAClB,MAAM,QAAQ,GAAG,GAAG,MAAM,CAAC,EAAE,CAAC,IAAI,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC;oBAE/C,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,KAAK,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE,GAAG,MAAM,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;wBAC9E,SAAS,CAAC,GAAG,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,CAAC,8BAA8B;oBAC9D,CAAC;gBACL,CAAC;gBAED,KAAK,CAAC,GAAG,CAAC,IAAI,EAAE,SAAS,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;QAED,OAAO,KAAK,CAAC;IACjB,CAAC;IAED;;KAEC;IACD,mBAAmB,CAAC,KAAa;QAC7B,MAAM,KAAK,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC3C,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,MAAM,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACnB,IAAI,CAAC,KAAK,SAAS,IAAI,CAAC,KAAK,SAAS,EAAE,CAAC;YACrC,MAAM,IAAI,KAAK,CAAC,uBAAuB,KAAK,EAAE,CAAC,CAAC;QACpD,CAAC;QAED,OAAO,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC;CACJ,CAAC"}

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

@@ -38,6 +38,15 @@ export interface ComponentResult {
     components: NodeId[][];
     componentMap: Map<NodeId, number>;
 }
+export interface MSTResult {
+    edges: Edge[];
+    totalWeight: number;
+}
+export interface FloydWarshallResult {
+    distances: Map<NodeId, Map<NodeId, number>>;
+    predecessors: Map<NodeId, Map<NodeId, NodeId | null>>;
+    hasNegativeCycle: boolean;
+}
 export interface TraversalOptions {
     targetNode?: NodeId;
     visitCallback?: (node: NodeId, level: number) => void;

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

@@ -1 +1 @@
-{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;AAGrC,MAAM,WAAW,IAAI;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;CAC9C;AAGD,MAAM,WAAW,IAAI;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;CAC9C;AAGD,MAAM,WAAW,WAAW;IACxB,QAAQ,EAAE,OAAO,CAAC;IAClB,cAAc,EAAE,OAAO,CAAC;IACxB,kBAAkB,EAAE,OAAO,CAAC;CAC/B;AAGD,MAAM,WAAW,kBAAkB;IAC/B,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;CAC3C;AAED,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEtD,MAAM,WAAW,eAAe;IAC5B,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;CACrC;AAED,MAAM,WAAW,eAAe;IAC5B,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,eAAe;IAC5B,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;IACvB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACrC;AAGD,MAAM,WAAW,gBAAgB;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;CACzD;AAED,MAAM,WAAW,eAAe;IAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,iBAAiB;IAC9B,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IACrC,gBAAgB,EAAE,OAAO,CAAC;IAC1B,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAC;CACjC;AAED,MAAM,WAAW,iBAAiB;IAC9B,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,IAAI,CAAC,EAAE,IAAI,GAAG,KAAK,GAAG,OAAO,CAAC;CACjC;AAED,MAAM,WAAW,eAAe;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,eAAe,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACzC;AAED,MAAM,WAAW,cAAc;IAC3B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,mBAAmB;IAChC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC7B"}
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/types/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,MAAM,MAAM,MAAM,GAAG,MAAM,GAAG,MAAM,CAAC;AAGrC,MAAM,WAAW,IAAI;IACjB,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,MAAM,CAAC;IAChB,EAAE,CAAC,EAAE,MAAM,CAAC;IACZ,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;CAC9C;AAGD,MAAM,WAAW,IAAI;IACjB,EAAE,EAAE,MAAM,CAAC;IACX,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,SAAS,CAAC;CAC9C;AAGD,MAAM,WAAW,WAAW;IACxB,QAAQ,EAAE,OAAO,CAAC;IAClB,cAAc,EAAE,OAAO,CAAC;IACxB,kBAAkB,EAAE,OAAO,CAAC;CAC/B;AAGD,MAAM,WAAW,kBAAkB;IAC/B,QAAQ,EAAE,MAAM,CAAC;IACjB,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,WAAW,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;CAC3C;AAED,MAAM,MAAM,gBAAgB,GAAG,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;AAEtD,MAAM,WAAW,eAAe;IAC5B,OAAO,EAAE,GAAG,CAAC,MAAM,CAAC,CAAC;IACrB,KAAK,EAAE,MAAM,EAAE,CAAC;IAChB,IAAI,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;CACrC;AAED,MAAM,WAAW,eAAe;IAC5B,WAAW,EAAE,MAAM,EAAE,EAAE,CAAC;IACxB,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,CAAC,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,eAAe;IAC5B,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;IACvB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACrC;AAED,MAAM,WAAW,SAAS;IACtB,KAAK,EAAE,IAAI,EAAE,CAAC;IACd,WAAW,EAAE,MAAM,CAAC;CACvB;AAED,MAAM,WAAW,mBAAmB;IAChC,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CAAC;IAC5C,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC,CAAC;IACtD,gBAAgB,EAAE,OAAO,CAAC;CAC7B;AAGD,MAAM,WAAW,gBAAgB;IAC7B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,CAAC,IAAI,EAAE,MAAM,EAAE,KAAK,EAAE,MAAM,KAAK,IAAI,CAAC;CACzD;AAED,MAAM,WAAW,eAAe;IAC5B,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED,MAAM,WAAW,iBAAiB;IAC9B,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B,QAAQ,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IACrC,gBAAgB,EAAE,OAAO,CAAC;IAC1B,kBAAkB,CAAC,EAAE,MAAM,EAAE,CAAC;CACjC;AAED,MAAM,WAAW,iBAAiB;IAC9B,UAAU,CAAC,EAAE,OAAO,CAAC;IACrB,SAAS,CAAC,EAAE,OAAO,CAAC;IACpB,IAAI,CAAC,EAAE,IAAI,GAAG,KAAK,GAAG,OAAO,CAAC;CACjC;AAED,MAAM,WAAW,eAAe;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;IACnB,eAAe,CAAC,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACzC;AAED,MAAM,WAAW,cAAc;IAC3B,UAAU,CAAC,EAAE,MAAM,CAAC;IACpB,aAAa,CAAC,EAAE,MAAM,CAAC;IACvB,SAAS,CAAC,EAAE,MAAM,CAAC;CACtB;AAED,MAAM,WAAW,mBAAmB;IAChC,cAAc,CAAC,EAAE,MAAM,CAAC;IACxB,gBAAgB,CAAC,EAAE,MAAM,CAAC;CAC7B"}

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

@@ -0,0 +1,8 @@
+/**
+ * Graph node interface for priority queue operations
+ */
+export interface graphNode<T> {
+    node: T;
+    distance: number;
+}
+//# sourceMappingURL=graphNode.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"graphNode.d.ts","sourceRoot":"","sources":["../../../src/utils/graphNode.ts"],"names":[],"mappings":"AAAA;;GAEG;AACH,MAAM,WAAW,SAAS,CAAC,CAAC;IACxB,IAAI,EAAE,CAAC,CAAC;IACR,QAAQ,EAAE,MAAM,CAAC;CACpB"}

package/dist/src/utils/graphNode.js

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

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

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

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

@@ -0,0 +1,21 @@
+/**
+ * Min Priority Queue implementation for graph algorithms
+ */
+export declare class MinPriorityQueue<T> {
+    private heap;
+    private compare;
+    constructor(compareFunction?: (a: T, b: T) => number);
+    private defaultCompare;
+    private parent;
+    private leftChild;
+    private rightChild;
+    private swap;
+    private heapifyUp;
+    private heapifyDown;
+    insert(value: T): void;
+    extractMin(): T | undefined;
+    peek(): T | undefined;
+    isEmpty(): boolean;
+    size(): number;
+}
+//# sourceMappingURL=priorityQueue.d.ts.map

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

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

package/dist/src/utils/priorityQueue.js

@@ -0,0 +1,101 @@
+/**
+ * Min Priority Queue implementation for graph algorithms
+ */
+export class MinPriorityQueue {
+    constructor(compareFunction) {
+        this.heap = [];
+        this.compare = compareFunction ?? ((a, b) => this.defaultCompare(a, b));
+    }
+    defaultCompare(a, b) {
+        const aWithDistance = a;
+        const bWithDistance = b;
+        if (aWithDistance.distance !== undefined && bWithDistance.distance !== undefined) {
+            return aWithDistance.distance - bWithDistance.distance;
+        }
+        return 0;
+    }
+    parent(i) {
+        return Math.floor((i - 1) / 2);
+    }
+    leftChild(i) {
+        return (2 * i) + 1;
+    }
+    rightChild(i) {
+        return (2 * i) + 2;
+    }
+    swap(i, j) {
+        const temp = this.heap[i];
+        const temp2 = this.heap[j];
+        if (temp !== undefined && temp2 !== undefined) {
+            this.heap[i] = temp2;
+            this.heap[j] = temp;
+        }
+    }
+    heapifyUp(index) {
+        while (index > 0) {
+            const parentIndex = this.parent(index);
+            const current = this.heap[index];
+            const parent = this.heap[parentIndex];
+            if (current !== undefined && parent !== undefined && this.compare(current, parent) < 0) {
+                this.swap(index, parentIndex);
+                index = parentIndex;
+            }
+            else {
+                break;
+            }
+        }
+    }
+    heapifyDown(index) {
+        while (index < this.heap.length) {
+            let minIndex = index;
+            const left = this.leftChild(index);
+            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) {
+                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) {
+                minIndex = right;
+            }
+            if (minIndex !== index) {
+                this.swap(index, minIndex);
+                index = minIndex;
+            }
+            else {
+                break;
+            }
+        }
+    }
+    insert(value) {
+        this.heap.push(value);
+        this.heapifyUp(this.heap.length - 1);
+    }
+    extractMin() {
+        if (this.heap.length === 0) {
+            return undefined;
+        }
+        if (this.heap.length === 1) {
+            return this.heap.pop();
+        }
+        const min = this.heap[0];
+        const last = this.heap.pop();
+        if (last !== undefined) {
+            this.heap[0] = last;
+            this.heapifyDown(0);
+        }
+        return min;
+    }
+    peek() {
+        return this.heap[0];
+    }
+    isEmpty() {
+        return this.heap.length === 0;
+    }
+    size() {
+        return this.heap.length;
+    }
+}
+//# sourceMappingURL=priorityQueue.js.map

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

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

package/package.json

@@ -1,6 +1,6 @@
 {
   "name": "@graphty/algorithms",
-  "version": "1.0.1",
+  "version": "1.1.0",
   "description": "Graph algorithms library for browser environments implemented in TypeScript",
   "author": "Adam Powers <apowers@ato.ms>",
   "main": "dist/algorithms.js",
@@ -93,6 +93,8 @@
     "knip": "^5.61.3",
     "playwright": "^1.53.0",
     "semantic-release": "^24.2.7",
+    "ts-node": "^10.9.2",
+    "tsx": "^4.20.3",
     "typescript": "^5.8.3",
     "typescript-eslint": "^8.34.1",
     "vitest": "^3.2.4"

package/src/algorithms/centrality/betweenness.ts

@@ -67,7 +67,7 @@ export function betweennessCentrality(
 
             stack.push(current);
 
-            for (const neighbor of graph.neighbors(current)) {
+            for (const neighbor of Array.from(graph.neighbors(current))) {
                 const currentDistance = distance.get(current);
                 let neighborDistance = distance.get(neighbor);
 
@@ -112,7 +112,17 @@ export function betweennessCentrality(
                 const vDelta = delta.get(v) ?? 0;
 
                 if (vSigma > 0 && wSigma > 0) {
-                    const contribution = (vSigma / wSigma) * (1 + wDelta);
+                    let contribution = (vSigma / wSigma) * (1 + wDelta);
+
+                    // Apply endpoints option: when false, exclude endpoint contributions
+                    if (!options.endpoints) {
+                        // For standard betweenness, don't count paths that only involve endpoints
+                        const isTargetEndpoint = predecessors.get(w)?.length === 0 && w !== source;
+                        if (isTargetEndpoint) {
+                            contribution = 0; // Exclude endpoint contributions
+                        }
+                    }
+
                     delta.set(v, vDelta + contribution);
                 }
             }
@@ -187,7 +197,7 @@ export function edgeBetweennessCentrality(
     const edgeCentrality = new Map<string, number>();
 
     // Initialize edge centrality scores
-    for (const edge of graph.edges()) {
+    for (const edge of Array.from(graph.edges())) {
         const edgeKey = `${String(edge.source)}-${String(edge.target)}`;
         edgeCentrality.set(edgeKey, 0);
     }
@@ -222,7 +232,7 @@ export function edgeBetweennessCentrality(
 
             stack.push(current);
 
-            for (const neighbor of graph.neighbors(current)) {
+            for (const neighbor of Array.from(graph.neighbors(current))) {
                 const currentDistance = distance.get(current);
                 let neighborDistance = distance.get(neighbor);
 
@@ -264,7 +274,15 @@ export function edgeBetweennessCentrality(
                 const vSigma = sigma.get(v) ?? 0;
 
                 if (vSigma > 0 && wSigma > 0) {
-                    const edgeContribution = vSigma / wSigma * (1 + wDelta);
+                    let edgeContribution = vSigma / wSigma * (1 + wDelta);
+
+                    // Apply endpoints option for edge betweenness
+                    if (!options.endpoints) {
+                        const isTargetEndpoint = predecessors.get(w)?.length === 0 && w !== source;
+                        if (isTargetEndpoint) {
+                            edgeContribution = 0; // Exclude endpoint contributions
+                        }
+                    }
 
                     // Update edge centrality
                     const edgeKey = `${String(v)}-${String(w)}`;
@@ -281,7 +299,7 @@ export function edgeBetweennessCentrality(
 
     // For undirected graphs, divide by 2 (each shortest path is counted twice)
     if (!graph.isDirected) {
-        for (const [edgeKey, centrality] of edgeCentrality) {
+        for (const [edgeKey, centrality] of Array.from(edgeCentrality)) {
             edgeCentrality.set(edgeKey, centrality / 2);
         }
     }
@@ -292,7 +310,7 @@ export function edgeBetweennessCentrality(
         const normalizationFactor = graph.isDirected ? (n - 1) * (n - 2) : ((n - 1) * (n - 2)) / 2;
 
         if (normalizationFactor > 0) {
-            for (const [edgeKey, centrality] of edgeCentrality) {
+            for (const [edgeKey, centrality] of Array.from(edgeCentrality)) {
                 edgeCentrality.set(edgeKey, centrality / normalizationFactor);
             }
         }

package/src/algorithms/centrality/closeness.ts

@@ -66,7 +66,7 @@ export function nodeClosenessCentrality(
 
     if (options.harmonic) {
         // Harmonic centrality: sum of reciprocals of distances
-        for (const [targetNode, distance] of distances) {
+        for (const [targetNode, distance] of Array.from(distances)) {
             if (targetNode !== node && distance > 0) {
                 centrality += 1 / distance;
             }
@@ -76,7 +76,7 @@ export function nodeClosenessCentrality(
         let totalDistance = 0;
         let reachableNodes = 0;
 
-        for (const [targetNode, distance] of distances) {
+        for (const [targetNode, distance] of Array.from(distances)) {
             if (targetNode !== node) {
                 totalDistance += distance;
                 reachableNodes++;
@@ -134,7 +134,7 @@ function singleSourceShortestPathLengths(
         }
 
         // Explore neighbors
-        for (const neighbor of graph.neighbors(current.node)) {
+        for (const neighbor of Array.from(graph.neighbors(current.node))) {
             if (!visited.has(neighbor)) {
                 const newDistance = current.distance + 1;
 
@@ -192,7 +192,7 @@ export function nodeWeightedClosenessCentrality(
 
     if (options.harmonic) {
         // Harmonic centrality: sum of reciprocals of distances
-        for (const [targetNode, distance] of distances) {
+        for (const [targetNode, distance] of Array.from(distances)) {
             if (targetNode !== node && distance > 0 && distance < Infinity) {
                 centrality += 1 / distance;
             }
@@ -202,7 +202,7 @@ export function nodeWeightedClosenessCentrality(
         let totalDistance = 0;
         let reachableNodes = 0;
 
-        for (const [targetNode, distance] of distances) {
+        for (const [targetNode, distance] of Array.from(distances)) {
             if (targetNode !== node && distance < Infinity) {
                 totalDistance += distance;
                 reachableNodes++;
@@ -244,7 +244,7 @@ function dijkstraDistances(
     const pq: {node: NodeId, distance: number}[] = [];
 
     // Initialize distances
-    for (const node of graph.nodes()) {
+    for (const node of Array.from(graph.nodes())) {
         distances.set(node.id, node.id === source ? 0 : Infinity);
     }
 
@@ -267,7 +267,7 @@ function dijkstraDistances(
         }
 
         // Explore neighbors
-        for (const neighbor of graph.neighbors(current.node)) {
+        for (const neighbor of Array.from(graph.neighbors(current.node))) {
             if (visited.has(neighbor)) {
                 continue;
             }