@graphty/algorithms 1.0.1

package/dist/src/algorithms/components/connected.d.ts

@@ -0,0 +1,58 @@
+import type { Graph } from "../../core/graph.js";
+import type { NodeId } from "../../types/index.js";
+/**
+ * Connected components algorithms
+ *
+ * Finds connected components in undirected graphs and strongly connected
+ * components in directed graphs using various efficient algorithms.
+ */
+/**
+ * Find connected components in an undirected graph using Union-Find
+ */
+export declare function connectedComponents(graph: Graph): NodeId[][];
+/**
+ * Find connected components using DFS (alternative implementation)
+ */
+export declare function connectedComponentsDFS(graph: Graph): NodeId[][];
+/**
+ * Find the number of connected components
+ */
+export declare function numberOfConnectedComponents(graph: Graph): number;
+/**
+ * Check if the graph is connected (has exactly one connected component)
+ */
+export declare function isConnected(graph: Graph): boolean;
+/**
+ * Find the largest connected component
+ */
+export declare function largestConnectedComponent(graph: Graph): NodeId[];
+/**
+ * Get the connected component containing a specific node
+ */
+export declare function getConnectedComponent(graph: Graph, nodeId: NodeId): NodeId[];
+/**
+ * Find strongly connected components using Tarjan's algorithm
+ */
+export declare function stronglyConnectedComponents(graph: Graph): NodeId[][];
+/**
+ * Check if a directed graph is strongly connected
+ */
+export declare function isStronglyConnected(graph: Graph): boolean;
+/**
+ * Find weakly connected components in a directed graph
+ * (treat the graph as undirected for connectivity)
+ */
+export declare function weaklyConnectedComponents(graph: Graph): NodeId[][];
+/**
+ * Check if a directed graph is weakly connected
+ */
+export declare function isWeaklyConnected(graph: Graph): boolean;
+/**
+ * Find condensation graph (quotient graph of strongly connected components)
+ */
+export declare function condensationGraph(graph: Graph): {
+    condensedGraph: Graph;
+    componentMap: Map<NodeId, number>;
+    components: NodeId[][];
+};
+//# sourceMappingURL=connected.d.ts.map

package/dist/src/algorithms/components/connected.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"connected.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/components/connected.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,qBAAqB,CAAC;AAE/C,OAAO,KAAK,EAAC,MAAM,EAAC,MAAM,sBAAsB,CAAC;AAEjD;;;;;GAKG;AAEH;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,EAAE,EAAE,CAmB5D;AAED;;GAEG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,EAAE,EAAE,CAiB/D;AAqBD;;GAEG;AACH,wBAAgB,2BAA2B,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,CAEhE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAEjD;AAED;;GAEG;AACH,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,EAAE,CAUhE;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,KAAK,EAAE,KAAK,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,CAe5E;AAED;;GAEG;AACH,wBAAgB,2BAA2B,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,EAAE,EAAE,CAoEpE;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAOzD;AAED;;;GAGG;AACH,wBAAgB,yBAAyB,CAAC,KAAK,EAAE,KAAK,GAAG,MAAM,EAAE,EAAE,CAmBlE;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CAMvD;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,KAAK,GAAG;IAC7C,cAAc,EAAE,KAAK,CAAC;IACtB,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAClC,UAAU,EAAE,MAAM,EAAE,EAAE,CAAC;CAC1B,CA4CA"}

package/dist/src/algorithms/components/connected.js

@@ -0,0 +1,234 @@
+import { UnionFind } from "../../data-structures/union-find.js";
+/**
+ * Connected components algorithms
+ *
+ * Finds connected components in undirected graphs and strongly connected
+ * components in directed graphs using various efficient algorithms.
+ */
+/**
+ * Find connected components in an undirected graph using Union-Find
+ */
+export function connectedComponents(graph) {
+    if (graph.isDirected) {
+        throw new Error("Connected components algorithm requires an undirected graph. Use stronglyConnectedComponents for directed graphs.");
+    }
+    const nodes = Array.from(graph.nodes()).map((node) => node.id);
+    if (nodes.length === 0) {
+        return [];
+    }
+    const unionFind = new UnionFind(nodes);
+    // Union connected nodes
+    for (const edge of graph.edges()) {
+        unionFind.union(edge.source, edge.target);
+    }
+    return unionFind.getAllComponents();
+}
+/**
+ * Find connected components using DFS (alternative implementation)
+ */
+export function connectedComponentsDFS(graph) {
+    if (graph.isDirected) {
+        throw new Error("Connected components algorithm requires an undirected graph");
+    }
+    const visited = new Set();
+    const components = [];
+    for (const node of graph.nodes()) {
+        if (!visited.has(node.id)) {
+            const component = [];
+            dfsComponent(graph, node.id, visited, component);
+            components.push(component);
+        }
+    }
+    return components;
+}
+/**
+ * DFS helper for connected components
+ */
+function dfsComponent(graph, nodeId, visited, component) {
+    visited.add(nodeId);
+    component.push(nodeId);
+    for (const neighbor of graph.neighbors(nodeId)) {
+        if (!visited.has(neighbor)) {
+            dfsComponent(graph, neighbor, visited, component);
+        }
+    }
+}
+/**
+ * Find the number of connected components
+ */
+export function numberOfConnectedComponents(graph) {
+    return connectedComponents(graph).length;
+}
+/**
+ * Check if the graph is connected (has exactly one connected component)
+ */
+export function isConnected(graph) {
+    return numberOfConnectedComponents(graph) <= 1;
+}
+/**
+ * Find the largest connected component
+ */
+export function largestConnectedComponent(graph) {
+    const components = connectedComponents(graph);
+    if (components.length === 0) {
+        return [];
+    }
+    return components.reduce((largest, current) => current.length > largest.length ? current : largest);
+}
+/**
+ * Get the connected component containing a specific node
+ */
+export function getConnectedComponent(graph, nodeId) {
+    if (!graph.hasNode(nodeId)) {
+        throw new Error(`Node ${String(nodeId)} not found in graph`);
+    }
+    if (graph.isDirected) {
+        throw new Error("Connected components algorithm requires an undirected graph");
+    }
+    const visited = new Set();
+    const component = [];
+    dfsComponent(graph, nodeId, visited, component);
+    return component;
+}
+/**
+ * Find strongly connected components using Tarjan's algorithm
+ */
+export function stronglyConnectedComponents(graph) {
+    if (!graph.isDirected) {
+        throw new Error("Strongly connected components require a directed graph");
+    }
+    const nodes = Array.from(graph.nodes()).map((node) => node.id);
+    const components = [];
+    const indices = new Map();
+    const lowLinks = new Map();
+    const onStack = new Set();
+    const stack = [];
+    let index = 0;
+    function tarjanSCC(nodeId) {
+        // Set the depth index for this node
+        indices.set(nodeId, index);
+        lowLinks.set(nodeId, index);
+        index++;
+        stack.push(nodeId);
+        onStack.add(nodeId);
+        // Consider successors
+        for (const neighbor of graph.neighbors(nodeId)) {
+            if (!indices.has(neighbor)) {
+                // Successor has not yet been visited; recurse on it
+                tarjanSCC(neighbor);
+                const nodeLL = lowLinks.get(nodeId) ?? 0;
+                const neighborLL = lowLinks.get(neighbor) ?? 0;
+                lowLinks.set(nodeId, Math.min(nodeLL, neighborLL));
+            }
+            else if (onStack.has(neighbor)) {
+                // Successor is in stack and hence in the current SCC
+                const nodeLL = lowLinks.get(nodeId) ?? 0;
+                const neighborIndex = indices.get(neighbor) ?? 0;
+                lowLinks.set(nodeId, Math.min(nodeLL, neighborIndex));
+            }
+        }
+        // If nodeId is a root node, pop the stack and create an SCC
+        const nodeIndex = indices.get(nodeId) ?? 0;
+        const nodeLowLink = lowLinks.get(nodeId) ?? 0;
+        if (nodeLowLink === nodeIndex) {
+            const component = [];
+            let w;
+            do {
+                const popped = stack.pop();
+                if (popped === undefined) {
+                    break;
+                }
+                w = popped;
+                onStack.delete(w);
+                component.push(w);
+            } while (w !== nodeId);
+            components.push(component);
+        }
+    }
+    for (const nodeId of nodes) {
+        if (!indices.has(nodeId)) {
+            tarjanSCC(nodeId);
+        }
+    }
+    return components;
+}
+/**
+ * Check if a directed graph is strongly connected
+ */
+export function isStronglyConnected(graph) {
+    if (!graph.isDirected) {
+        throw new Error("Strong connectivity check requires a directed graph");
+    }
+    const components = stronglyConnectedComponents(graph);
+    return components.length <= 1;
+}
+/**
+ * Find weakly connected components in a directed graph
+ * (treat the graph as undirected for connectivity)
+ */
+export function weaklyConnectedComponents(graph) {
+    if (!graph.isDirected) {
+        throw new Error("Weakly connected components are for directed graphs. Use connectedComponents for undirected graphs.");
+    }
+    const nodes = Array.from(graph.nodes()).map((node) => node.id);
+    if (nodes.length === 0) {
+        return [];
+    }
+    const unionFind = new UnionFind(nodes);
+    // Union nodes connected by edges (ignore direction)
+    for (const edge of graph.edges()) {
+        unionFind.union(edge.source, edge.target);
+    }
+    return unionFind.getAllComponents();
+}
+/**
+ * Check if a directed graph is weakly connected
+ */
+export function isWeaklyConnected(graph) {
+    if (!graph.isDirected) {
+        throw new Error("Weak connectivity check requires a directed graph");
+    }
+    return weaklyConnectedComponents(graph).length <= 1;
+}
+/**
+ * Find condensation graph (quotient graph of strongly connected components)
+ */
+export function condensationGraph(graph) {
+    if (!graph.isDirected) {
+        throw new Error("Condensation graph requires a directed graph");
+    }
+    const components = stronglyConnectedComponents(graph);
+    const componentMap = new Map();
+    const condensedGraph = new graph.constructor({ directed: true });
+    // Map each node to its component index
+    for (let i = 0; i < components.length; i++) {
+        const component = components[i];
+        if (component) {
+            for (const nodeId of component) {
+                componentMap.set(nodeId, i);
+            }
+            // Add component as a node in condensed graph
+            condensedGraph.addNode(i);
+        }
+    }
+    // Add edges between components
+    const addedEdges = new Set();
+    for (const edge of graph.edges()) {
+        const sourceComponent = componentMap.get(edge.source);
+        const targetComponent = componentMap.get(edge.target);
+        if (sourceComponent !== undefined && targetComponent !== undefined &&
+            sourceComponent !== targetComponent) {
+            const edgeKey = `${sourceComponent}-${targetComponent}`;
+            if (!addedEdges.has(edgeKey)) {
+                condensedGraph.addEdge(sourceComponent, targetComponent);
+                addedEdges.add(edgeKey);
+            }
+        }
+    }
+    return {
+        condensedGraph,
+        componentMap,
+        components,
+    };
+}
+//# sourceMappingURL=connected.js.map

package/dist/src/algorithms/components/connected.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"connected.js","sourceRoot":"","sources":["../../../../src/algorithms/components/connected.ts"],"names":[],"mappings":"AACA,OAAO,EAAC,SAAS,EAAC,MAAM,qCAAqC,CAAC;AAG9D;;;;;GAKG;AAEH;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAY;IAC5C,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,mHAAmH,CAAC,CAAC;IACzI,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAE/D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,EAAE,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC;IAEvC,wBAAwB;IACxB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO,SAAS,CAAC,gBAAgB,EAAE,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAY;IAC/C,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;IACnF,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,UAAU,GAAe,EAAE,CAAC;IAElC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,YAAY,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;YACjD,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/B,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CACjB,KAAY,EACZ,MAAc,EACd,OAAoB,EACpB,SAAmB;IAEnB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACpB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;IAEvB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;QAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzB,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QACtD,CAAC;IACL,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,2BAA2B,CAAC,KAAY;IACpD,OAAO,mBAAmB,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC;AAC7C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,KAAY;IACpC,OAAO,2BAA2B,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;AACnD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,yBAAyB,CAAC,KAAY;IAClD,MAAM,UAAU,GAAG,mBAAmB,CAAC,KAAK,CAAC,CAAC;IAE9C,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC1B,OAAO,EAAE,CAAC;IACd,CAAC;IAED,OAAO,UAAU,CAAC,MAAM,CAAC,CAAC,OAAO,EAAE,OAAO,EAAE,EAAE,CAC1C,OAAO,CAAC,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,OAAO,CACtD,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,qBAAqB,CAAC,KAAY,EAAE,MAAc;IAC9D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,QAAQ,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;IACjE,CAAC;IAED,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;QACnB,MAAM,IAAI,KAAK,CAAC,6DAA6D,CAAC,CAAC;IACnF,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,SAAS,GAAa,EAAE,CAAC;IAE/B,YAAY,CAAC,KAAK,EAAE,MAAM,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;IAEhD,OAAO,SAAS,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,2BAA2B,CAAC,KAAY;IACpD,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;IAC9E,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAC/D,MAAM,UAAU,GAAe,EAAE,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,IAAI,KAAK,GAAG,CAAC,CAAC;IAEd,SAAS,SAAS,CAAC,MAAc;QAC7B,oCAAoC;QACpC,OAAO,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC3B,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC5B,KAAK,EAAE,CAAC;QACR,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACnB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAEpB,sBAAsB;QACtB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YAC7C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBACzB,oDAAoD;gBACpD,SAAS,CAAC,QAAQ,CAAC,CAAC;gBACpB,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACzC,MAAM,UAAU,GAAG,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBAC/C,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,UAAU,CAAC,CAAC,CAAC;YACvD,CAAC;iBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC/B,qDAAqD;gBACrD,MAAM,MAAM,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBACzC,MAAM,aAAa,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;gBACjD,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,GAAG,CAAC,MAAM,EAAE,aAAa,CAAC,CAAC,CAAC;YAC1D,CAAC;QACL,CAAC;QAED,4DAA4D;QAC5D,MAAM,SAAS,GAAG,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC3C,MAAM,WAAW,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAE9C,IAAI,WAAW,KAAK,SAAS,EAAE,CAAC;YAC5B,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,IAAI,CAAS,CAAC;YAEd,GAAG,CAAC;gBACA,MAAM,MAAM,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;gBAC3B,IAAI,MAAM,KAAK,SAAS,EAAE,CAAC;oBACvB,MAAM;gBACV,CAAC;gBAED,CAAC,GAAG,MAAM,CAAC;gBAEX,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC;gBAClB,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YACtB,CAAC,QAAQ,CAAC,KAAK,MAAM,EAAE;YAEvB,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/B,CAAC;IACL,CAAC;IAED,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;YACvB,SAAS,CAAC,MAAM,CAAC,CAAC;QACtB,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,mBAAmB,CAAC,KAAY;IAC5C,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,qDAAqD,CAAC,CAAC;IAC3E,CAAC;IAED,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;IACtD,OAAO,UAAU,CAAC,MAAM,IAAI,CAAC,CAAC;AAClC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,yBAAyB,CAAC,KAAY;IAClD,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,qGAAqG,CAAC,CAAC;IAC3H,CAAC;IAED,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAE/D,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,EAAE,CAAC;IACd,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,SAAS,CAAC,KAAK,CAAC,CAAC;IAEvC,oDAAoD;IACpD,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,SAAS,CAAC,KAAK,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,CAAC,CAAC;IAC9C,CAAC;IAED,OAAO,SAAS,CAAC,gBAAgB,EAAE,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAY;IAC1C,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,mDAAmD,CAAC,CAAC;IACzE,CAAC;IAED,OAAO,yBAAyB,CAAC,KAAK,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;AACxD,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAY;IAK1C,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,8CAA8C,CAAC,CAAC;IACpE,CAAC;IAED,MAAM,UAAU,GAAG,2BAA2B,CAAC,KAAK,CAAC,CAAC;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC/C,MAAM,cAAc,GAAG,IAAK,KAAK,CAAC,WAA0D,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;IAE/G,uCAAuC;IACvC,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,UAAU,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACzC,MAAM,SAAS,GAAG,UAAU,CAAC,CAAC,CAAC,CAAC;QAChC,IAAI,SAAS,EAAE,CAAC;YACZ,KAAK,MAAM,MAAM,IAAI,SAAS,EAAE,CAAC;gBAC7B,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;YAChC,CAAC;YACD,6CAA6C;YAC7C,cAAc,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC;QAC9B,CAAC;IACL,CAAC;IAED,+BAA+B;IAC/B,MAAM,UAAU,GAAG,IAAI,GAAG,EAAU,CAAC;IAErC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACtD,MAAM,eAAe,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAEtD,IAAI,eAAe,KAAK,SAAS,IAAI,eAAe,KAAK,SAAS;YAC9D,eAAe,KAAK,eAAe,EAAE,CAAC;YACtC,MAAM,OAAO,GAAG,GAAG,eAAe,IAAI,eAAe,EAAE,CAAC;YAExD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;gBAC3B,cAAc,CAAC,OAAO,CAAC,eAAe,EAAE,eAAe,CAAC,CAAC;gBACzD,UAAU,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;YAC5B,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO;QACH,cAAc;QACd,YAAY;QACZ,UAAU;KACb,CAAC;AACN,CAAC"}

package/dist/src/algorithms/components/index.d.ts

@@ -0,0 +1,5 @@
+/**
+ * Connected components algorithms
+ */
+export { condensationGraph, connectedComponents, connectedComponentsDFS, getConnectedComponent, isConnected, isStronglyConnected, isWeaklyConnected, largestConnectedComponent, numberOfConnectedComponents, stronglyConnectedComponents, weaklyConnectedComponents, } from "./connected.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/src/algorithms/components/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/components/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EACH,iBAAiB,EACjB,mBAAmB,EACnB,sBAAsB,EACtB,qBAAqB,EACrB,WAAW,EACX,mBAAmB,EACnB,iBAAiB,EACjB,yBAAyB,EACzB,2BAA2B,EAC3B,2BAA2B,EAC3B,yBAAyB,GAC5B,MAAM,gBAAgB,CAAC"}

package/dist/src/algorithms/components/index.js

@@ -0,0 +1,5 @@
+/**
+ * Connected components algorithms
+ */
+export { condensationGraph, connectedComponents, connectedComponentsDFS, getConnectedComponent, isConnected, isStronglyConnected, isWeaklyConnected, largestConnectedComponent, numberOfConnectedComponents, stronglyConnectedComponents, weaklyConnectedComponents, } from "./connected.js";
+//# sourceMappingURL=index.js.map

package/dist/src/algorithms/components/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/algorithms/components/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EACH,iBAAiB,EACjB,mBAAmB,EACnB,sBAAsB,EACtB,qBAAqB,EACrB,WAAW,EACX,mBAAmB,EACnB,iBAAiB,EACjB,yBAAyB,EACzB,2BAA2B,EAC3B,2BAA2B,EAC3B,yBAAyB,GAC5B,MAAM,gBAAgB,CAAC"}

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

@@ -0,0 +1,8 @@
+/**
+ * Graph algorithms collection
+ */
+export * from "./traversal/index.js";
+export * from "./shortest-path/index.js";
+export * from "./centrality/index.js";
+export * from "./components/index.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,cAAc,sBAAsB,CAAC;AAGrC,cAAc,0BAA0B,CAAC;AAGzC,cAAc,uBAAuB,CAAC;AAGtC,cAAc,uBAAuB,CAAC"}

package/dist/src/algorithms/index.js

@@ -0,0 +1,12 @@
+/**
+ * Graph algorithms collection
+ */
+// Traversal algorithms
+export * from "./traversal/index.js";
+// Shortest path algorithms
+export * from "./shortest-path/index.js";
+// Centrality algorithms
+export * from "./centrality/index.js";
+// Connected components algorithms
+export * from "./components/index.js";
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,uBAAuB;AACvB,cAAc,sBAAsB,CAAC;AAErC,2BAA2B;AAC3B,cAAc,0BAA0B,CAAC;AAEzC,wBAAwB;AACxB,cAAc,uBAAuB,CAAC;AAEtC,kCAAkC;AAClC,cAAc,uBAAuB,CAAC"}

package/dist/src/algorithms/shortest-path/bellman-ford.d.ts

@@ -0,0 +1,52 @@
+import type { Graph } from "../../core/graph.js";
+import type { NodeId, ShortestPathResult } from "../../types/index.js";
+/**
+ * Bellman-Ford algorithm implementation for single-source shortest paths
+ *
+ * Finds shortest paths from a source node to all other nodes in a weighted graph.
+ * Unlike Dijkstra's algorithm, it can handle negative edge weights and detect
+ * negative cycles.
+ */
+/**
+ * Bellman-Ford algorithm options
+ */
+export interface BellmanFordOptions {
+    /**
+     * Target node for early termination (optional)
+     */
+    target?: NodeId;
+}
+/**
+ * Result of Bellman-Ford algorithm
+ */
+export interface BellmanFordResult {
+    /**
+     * Distance from source to each reachable node
+     */
+    distances: Map<NodeId, number>;
+    /**
+     * Predecessor of each node in shortest path tree
+     */
+    predecessors: Map<NodeId, NodeId | null>;
+    /**
+     * Whether a negative cycle was detected
+     */
+    hasNegativeCycle: boolean;
+    /**
+     * Nodes involved in negative cycle (if any)
+     */
+    negativeCycleNodes: NodeId[];
+}
+/**
+ * Find shortest paths from source using Bellman-Ford algorithm
+ */
+export declare function bellmanFord(graph: Graph, source: NodeId, options?: BellmanFordOptions): BellmanFordResult;
+/**
+ * Find shortest path between two specific nodes using Bellman-Ford
+ */
+export declare function bellmanFordPath(graph: Graph, source: NodeId, target: NodeId): ShortestPathResult | null;
+/**
+ * Check if graph has negative cycles using Bellman-Ford
+ */
+export declare function hasNegativeCycle(graph: Graph): boolean;
+//# sourceMappingURL=bellman-ford.d.ts.map

package/dist/src/algorithms/shortest-path/bellman-ford.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bellman-ford.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/shortest-path/bellman-ford.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,qBAAqB,CAAC;AAC/C,OAAO,KAAK,EAAC,MAAM,EAAE,kBAAkB,EAAC,MAAM,sBAAsB,CAAC;AAErE;;;;;;GAMG;AAEH;;GAEG;AACH,MAAM,WAAW,kBAAkB;IAC/B;;OAEG;IACH,MAAM,CAAC,EAAE,MAAM,CAAC;CACnB;AAED;;GAEG;AACH,MAAM,WAAW,iBAAiB;IAC9B;;OAEG;IACH,SAAS,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;IAC/B;;OAEG;IACH,YAAY,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,GAAG,IAAI,CAAC,CAAC;IACzC;;OAEG;IACH,gBAAgB,EAAE,OAAO,CAAC;IAC1B;;OAEG;IACH,kBAAkB,EAAE,MAAM,EAAE,CAAC;CAChC;AAED;;GAEG;AACH,wBAAgB,WAAW,CACvB,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,kBAAuB,GACjC,iBAAiB,CA6EnB;AAED;;GAEG;AACH,wBAAgB,eAAe,CAC3B,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,GACf,kBAAkB,GAAG,IAAI,CA6B3B;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,KAAK,GAAG,OAAO,CA4BtD"}

package/dist/src/algorithms/shortest-path/bellman-ford.js

@@ -0,0 +1,131 @@
+/**
+ * Find shortest paths from source using Bellman-Ford algorithm
+ */
+export function bellmanFord(graph, source, options = {}) {
+    if (!graph.hasNode(source)) {
+        throw new Error(`Source node ${String(source)} not found in graph`);
+    }
+    const distances = new Map();
+    const predecessors = new Map();
+    const nodes = Array.from(graph.nodes()).map((node) => node.id);
+    // Initialize distances
+    for (const nodeId of nodes) {
+        distances.set(nodeId, nodeId === source ? 0 : Infinity);
+        predecessors.set(nodeId, null);
+    }
+    // Relax edges |V| - 1 times
+    for (let i = 0; i < nodes.length - 1; i++) {
+        let updated = false;
+        for (const edge of graph.edges()) {
+            const u = edge.source;
+            const v = edge.target;
+            const weight = edge.weight ?? 1;
+            const distanceU = distances.get(u);
+            const distanceV = distances.get(v);
+            if (distanceU !== undefined && distanceV !== undefined && distanceU !== Infinity) {
+                const newDistance = distanceU + weight;
+                if (newDistance < distanceV) {
+                    distances.set(v, newDistance);
+                    predecessors.set(v, u);
+                    updated = true;
+                    // Early termination if target reached
+                    if (options.target && v === options.target) {
+                        break;
+                    }
+                }
+            }
+        }
+        // If no update in this iteration, we can stop early
+        if (!updated) {
+            break;
+        }
+    }
+    // Check for negative cycles
+    const negativeCycleNodes = [];
+    let hasNegativeCycle = false;
+    for (const edge of graph.edges()) {
+        const u = edge.source;
+        const v = edge.target;
+        const weight = edge.weight ?? 1;
+        const distanceU = distances.get(u);
+        const distanceV = distances.get(v);
+        if (distanceU !== undefined && distanceV !== undefined && distanceU !== Infinity) {
+            const newDistance = distanceU + weight;
+            if (newDistance < distanceV) {
+                hasNegativeCycle = true;
+                negativeCycleNodes.push(v);
+            }
+        }
+    }
+    return {
+        distances,
+        predecessors,
+        hasNegativeCycle,
+        negativeCycleNodes,
+    };
+}
+/**
+ * Find shortest path between two specific nodes using Bellman-Ford
+ */
+export function bellmanFordPath(graph, source, target) {
+    if (!graph.hasNode(source)) {
+        throw new Error(`Source node ${String(source)} not found in graph`);
+    }
+    if (!graph.hasNode(target)) {
+        throw new Error(`Target node ${String(target)} not found in graph`);
+    }
+    const result = bellmanFord(graph, source, { target });
+    if (result.hasNegativeCycle) {
+        throw new Error("Graph contains a negative cycle");
+    }
+    const distance = result.distances.get(target);
+    if (distance === undefined || distance === Infinity) {
+        return null; // No path exists
+    }
+    // Reconstruct path
+    const path = reconstructPath(target, result.predecessors);
+    return {
+        distance,
+        path,
+        predecessor: result.predecessors,
+    };
+}
+/**
+ * Check if graph has negative cycles using Bellman-Ford
+ */
+export function hasNegativeCycle(graph) {
+    const nodes = Array.from(graph.nodes());
+    if (nodes.length === 0) {
+        return false;
+    }
+    // Need to check from multiple sources in case of disconnected components
+    const checked = new Set();
+    for (const node of nodes) {
+        if (!checked.has(node.id)) {
+            const result = bellmanFord(graph, node.id);
+            if (result.hasNegativeCycle) {
+                return true;
+            }
+            // Mark all reachable nodes as checked
+            for (const [nodeId, distance] of result.distances) {
+                if (distance !== Infinity) {
+                    checked.add(nodeId);
+                }
+            }
+        }
+    }
+    return false;
+}
+/**
+ * Reconstruct path from predecessor map
+ */
+function reconstructPath(target, predecessors) {
+    const path = [];
+    let current = target;
+    while (current !== null) {
+        path.unshift(current);
+        current = predecessors.get(current) ?? null;
+    }
+    return path;
+}
+//# sourceMappingURL=bellman-ford.js.map

package/dist/src/algorithms/shortest-path/bellman-ford.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bellman-ford.js","sourceRoot":"","sources":["../../../../src/algorithms/shortest-path/bellman-ford.ts"],"names":[],"mappings":"AA2CA;;GAEG;AACH,MAAM,UAAU,WAAW,CACvB,KAAY,EACZ,MAAc,EACd,UAA8B,EAAE;IAEhC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,eAAe,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;IACxE,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC5C,MAAM,YAAY,GAAG,IAAI,GAAG,EAAyB,CAAC;IACtD,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAE/D,uBAAuB;IACvB,KAAK,MAAM,MAAM,IAAI,KAAK,EAAE,CAAC;QACzB,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,MAAM,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC;QACxD,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IACnC,CAAC;IAED,4BAA4B;IAC5B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QACxC,IAAI,OAAO,GAAG,KAAK,CAAC;QAEpB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;YAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YACtB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;YACtB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;YAEhC,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YACnC,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;YAEnC,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,QAAQ,EAAE,CAAC;gBAC/E,MAAM,WAAW,GAAG,SAAS,GAAG,MAAM,CAAC;gBAEvC,IAAI,WAAW,GAAG,SAAS,EAAE,CAAC;oBAC1B,SAAS,CAAC,GAAG,CAAC,CAAC,EAAE,WAAW,CAAC,CAAC;oBAC9B,YAAY,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;oBACvB,OAAO,GAAG,IAAI,CAAC;oBAEf,sCAAsC;oBACtC,IAAI,OAAO,CAAC,MAAM,IAAI,CAAC,KAAK,OAAO,CAAC,MAAM,EAAE,CAAC;wBACzC,MAAM;oBACV,CAAC;gBACL,CAAC;YACL,CAAC;QACL,CAAC;QAED,oDAAoD;QACpD,IAAI,CAAC,OAAO,EAAE,CAAC;YACX,MAAM;QACV,CAAC;IACL,CAAC;IAED,4BAA4B;IAC5B,MAAM,kBAAkB,GAAa,EAAE,CAAC;IACxC,IAAI,gBAAgB,GAAG,KAAK,CAAC;IAE7B,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,MAAM,CAAC,GAAG,IAAI,CAAC,MAAM,CAAC;QACtB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,CAAC,CAAC;QAEhC,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QACnC,MAAM,SAAS,GAAG,SAAS,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC;QAEnC,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,SAAS,IAAI,SAAS,KAAK,QAAQ,EAAE,CAAC;YAC/E,MAAM,WAAW,GAAG,SAAS,GAAG,MAAM,CAAC;YAEvC,IAAI,WAAW,GAAG,SAAS,EAAE,CAAC;gBAC1B,gBAAgB,GAAG,IAAI,CAAC;gBACxB,kBAAkB,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;YAC/B,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO;QACH,SAAS;QACT,YAAY;QACZ,gBAAgB;QAChB,kBAAkB;KACrB,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAC3B,KAAY,EACZ,MAAc,EACd,MAAc;IAEd,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,eAAe,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;IACxE,CAAC;IAED,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QACzB,MAAM,IAAI,KAAK,CAAC,eAAe,MAAM,CAAC,MAAM,CAAC,qBAAqB,CAAC,CAAC;IACxE,CAAC;IAED,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,MAAM,EAAE,EAAC,MAAM,EAAC,CAAC,CAAC;IAEpD,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;QAC1B,MAAM,IAAI,KAAK,CAAC,iCAAiC,CAAC,CAAC;IACvD,CAAC;IAED,MAAM,QAAQ,GAAG,MAAM,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IAE9C,IAAI,QAAQ,KAAK,SAAS,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAClD,OAAO,IAAI,CAAC,CAAC,iBAAiB;IAClC,CAAC;IAED,mBAAmB;IACnB,MAAM,IAAI,GAAG,eAAe,CAAC,MAAM,EAAE,MAAM,CAAC,YAAY,CAAC,CAAC;IAE1D,OAAO;QACH,QAAQ;QACR,IAAI;QACJ,WAAW,EAAE,MAAM,CAAC,YAAY;KACnC,CAAC;AACN,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAY;IACzC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;IAExC,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,KAAK,CAAC;IACjB,CAAC;IAED,yEAAyE;IACzE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACxB,MAAM,MAAM,GAAG,WAAW,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC;YAE3C,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;gBAC1B,OAAO,IAAI,CAAC;YAChB,CAAC;YAED,sCAAsC;YACtC,KAAK,MAAM,CAAC,MAAM,EAAE,QAAQ,CAAC,IAAI,MAAM,CAAC,SAAS,EAAE,CAAC;gBAChD,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;oBACxB,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;gBACxB,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,MAAc,EAAE,YAAwC;IAC7E,MAAM,IAAI,GAAa,EAAE,CAAC;IAC1B,IAAI,OAAO,GAAkB,MAAM,CAAC;IAEpC,OAAO,OAAO,KAAK,IAAI,EAAE,CAAC;QACtB,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;QACtB,OAAO,GAAG,YAAY,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;IAChD,CAAC;IAED,OAAO,IAAI,CAAC;AAChB,CAAC"}

package/dist/src/algorithms/shortest-path/dijkstra.d.ts

@@ -0,0 +1,26 @@
+import type { Graph } from "../../core/graph.js";
+import type { DijkstraOptions, NodeId, ShortestPathResult } from "../../types/index.js";
+/**
+ * Dijkstra's algorithm implementation for single-source shortest paths
+ *
+ * Finds shortest paths from a source node to all other nodes in a weighted graph
+ * with non-negative edge weights using a priority queue for efficiency.
+ */
+/**
+ * Find shortest paths from source to all reachable nodes using Dijkstra's algorithm
+ */
+export declare function dijkstra(graph: Graph, source: NodeId, options?: DijkstraOptions): Map<NodeId, ShortestPathResult>;
+/**
+ * Find shortest path between two specific nodes using Dijkstra's algorithm
+ */
+export declare function dijkstraPath(graph: Graph, source: NodeId, target: NodeId): ShortestPathResult | null;
+/**
+ * Single-source shortest paths with early termination optimization
+ */
+export declare function singleSourceShortestPath(graph: Graph, source: NodeId, cutoff?: number): Map<NodeId, number>;
+/**
+ * All-pairs shortest paths using repeated Dijkstra
+ * Note: For dense graphs, consider Floyd-Warshall algorithm instead
+ */
+export declare function allPairsShortestPath(graph: Graph): Map<NodeId, Map<NodeId, number>>;
+//# sourceMappingURL=dijkstra.d.ts.map

package/dist/src/algorithms/shortest-path/dijkstra.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dijkstra.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/shortest-path/dijkstra.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,KAAK,EAAC,MAAM,qBAAqB,CAAC;AAE/C,OAAO,KAAK,EAAC,eAAe,EAAE,MAAM,EAAE,kBAAkB,EAAC,MAAM,sBAAsB,CAAC;AAEtF;;;;;GAKG;AAEH;;GAEG;AACH,wBAAgB,QAAQ,CACpB,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,OAAO,GAAE,eAAoB,GAC9B,GAAG,CAAC,MAAM,EAAE,kBAAkB,CAAC,CA8FjC;AAED;;GAEG;AACH,wBAAgB,YAAY,CACxB,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,MAAM,EAAE,MAAM,GACf,kBAAkB,GAAG,IAAI,CAoB3B;AAED;;GAEG;AACH,wBAAgB,wBAAwB,CACpC,KAAK,EAAE,KAAK,EACZ,MAAM,EAAE,MAAM,EACd,MAAM,CAAC,EAAE,MAAM,GAChB,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CA2ErB;AAED;;;GAGG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,KAAK,GAAG,GAAG,CAAC,MAAM,EAAE,GAAG,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC,CASnF"}