@graphty/algorithms 1.0.1

package/dist/src/algorithms/traversal/dfs.js

@@ -0,0 +1,259 @@
+import { Graph } from "../../core/graph.js";
+/**
+ * Perform depth-first search starting from a given node
+ */
+export function depthFirstSearch(graph, startNode, options = {}) {
+    if (!graph.hasNode(startNode)) {
+        throw new Error(`Start node ${String(startNode)} not found in graph`);
+    }
+    const visited = new Set();
+    const order = [];
+    const tree = new Map();
+    if (options.recursive) {
+        dfsRecursive(graph, startNode, visited, order, tree, options, 0);
+    }
+    else {
+        dfsIterative(graph, startNode, visited, order, tree, options);
+    }
+    return { visited, order, tree };
+}
+/**
+ * Iterative DFS implementation (safer for browsers)
+ */
+function dfsIterative(graph, startNode, visited, order, tree, options) {
+    if (options.preOrder === false) {
+        // For post-order, use a simpler recursive approach to ensure correctness
+        dfsRecursive(graph, startNode, visited, order, tree, options, 0, null);
+        return;
+    }
+    const stack = [];
+    stack.push({ node: startNode, parent: null, depth: 0 });
+    while (stack.length > 0) {
+        const current = stack.pop();
+        if (!current) {
+            break;
+        }
+        if (!visited.has(current.node)) {
+            visited.add(current.node);
+            tree.set(current.node, current.parent);
+            // Pre-order processing
+            order.push(current.node);
+            // Call visitor callback if provided
+            if (options.visitCallback) {
+                options.visitCallback(current.node, current.depth);
+            }
+            // Early termination if target found
+            if (options.targetNode && current.node === options.targetNode) {
+                break;
+            }
+            // Add neighbors to stack in reverse order to maintain left-to-right traversal
+            const neighbors = Array.from(graph.neighbors(current.node));
+            for (let i = neighbors.length - 1; i >= 0; i--) {
+                const neighbor = neighbors[i];
+                if (neighbor !== undefined && !visited.has(neighbor)) {
+                    stack.push({ node: neighbor, parent: current.node, depth: current.depth + 1 });
+                }
+            }
+        }
+    }
+}
+/**
+ * Recursive DFS implementation
+ */
+function dfsRecursive(graph, node, visited, order, tree, options, depth, parent = null) {
+    visited.add(node);
+    tree.set(node, parent);
+    // Pre-order processing
+    if (options.preOrder !== false) {
+        order.push(node);
+        if (options.visitCallback) {
+            options.visitCallback(node, depth);
+        }
+        // Early termination if target found
+        if (options.targetNode && node === options.targetNode) {
+            return;
+        }
+    }
+    // Recursively visit neighbors
+    for (const neighbor of graph.neighbors(node)) {
+        if (!visited.has(neighbor)) {
+            dfsRecursive(graph, neighbor, visited, order, tree, options, depth + 1, node);
+        }
+    }
+    // Post-order processing
+    if (options.preOrder === false) {
+        order.push(node);
+        if (options.visitCallback) {
+            options.visitCallback(node, depth);
+        }
+    }
+}
+/**
+ * Detect cycles in a graph using DFS
+ */
+export function hasCycleDFS(graph) {
+    const visited = new Set();
+    // Check each unvisited node for cycles
+    for (const node of graph.nodes()) {
+        if (!visited.has(node.id)) {
+            if (graph.isDirected) {
+                const recursionStack = new Set();
+                if (hasCycleUtilDirected(graph, node.id, visited, recursionStack)) {
+                    return true;
+                }
+            }
+            else {
+                if (hasCycleUtilUndirected(graph, node.id, visited, null)) {
+                    return true;
+                }
+            }
+        }
+    }
+    return false;
+}
+/**
+ * Utility function for cycle detection in directed graphs
+ */
+function hasCycleUtilDirected(graph, node, visited, recursionStack) {
+    visited.add(node);
+    recursionStack.add(node);
+    // Check all neighbors
+    for (const neighbor of graph.neighbors(node)) {
+        if (!visited.has(neighbor)) {
+            if (hasCycleUtilDirected(graph, neighbor, visited, recursionStack)) {
+                return true;
+            }
+        }
+        else if (recursionStack.has(neighbor)) {
+            // Back edge found - cycle detected
+            return true;
+        }
+    }
+    recursionStack.delete(node);
+    return false;
+}
+/**
+ * Utility function for cycle detection in undirected graphs
+ */
+function hasCycleUtilUndirected(graph, node, visited, parent) {
+    visited.add(node);
+    // Check all neighbors
+    for (const neighbor of graph.neighbors(node)) {
+        if (!visited.has(neighbor)) {
+            if (hasCycleUtilUndirected(graph, neighbor, visited, node)) {
+                return true;
+            }
+        }
+        else if (neighbor !== parent) {
+            // Found a visited node that's not the parent - cycle detected
+            return true;
+        }
+    }
+    return false;
+}
+/**
+ * Topological sorting using DFS (for directed acyclic graphs)
+ */
+export function topologicalSort(graph) {
+    if (!graph.isDirected) {
+        throw new Error("Topological sort requires a directed graph");
+    }
+    // First check if graph has cycles
+    if (hasCycleDFS(graph)) {
+        return null; // Cannot topologically sort a graph with cycles
+    }
+    const visited = new Set();
+    const stack = [];
+    // Perform DFS from each unvisited node
+    for (const node of graph.nodes()) {
+        if (!visited.has(node.id)) {
+            topologicalSortUtil(graph, node.id, visited, stack);
+        }
+    }
+    // Return nodes in reverse order of finishing times
+    return stack.reverse();
+}
+/**
+ * Utility function for topological sorting
+ */
+function topologicalSortUtil(graph, node, visited, stack) {
+    visited.add(node);
+    // Visit all neighbors first
+    for (const neighbor of graph.neighbors(node)) {
+        if (!visited.has(neighbor)) {
+            topologicalSortUtil(graph, neighbor, visited, stack);
+        }
+    }
+    // Add current node to stack after visiting all neighbors
+    stack.push(node);
+}
+/**
+ * Find strongly connected components using DFS (for directed graphs)
+ */
+export function findStronglyConnectedComponents(graph) {
+    if (!graph.isDirected) {
+        throw new Error("Strongly connected components require a directed graph");
+    }
+    const visited = new Set();
+    const finishOrder = [];
+    // Step 1: Get nodes in order of finishing times
+    for (const node of graph.nodes()) {
+        if (!visited.has(node.id)) {
+            dfsFinishOrder(graph, node.id, visited, finishOrder);
+        }
+    }
+    // Step 2: Create transpose graph (reverse all edges)
+    const transposeGraph = createTransposeGraph(graph);
+    // Step 3: DFS on transpose graph in reverse finish order
+    const visited2 = new Set();
+    const components = [];
+    for (let i = finishOrder.length - 1; i >= 0; i--) {
+        const node = finishOrder[i];
+        if (node !== undefined && !visited2.has(node)) {
+            const component = [];
+            dfsCollectComponent(transposeGraph, node, visited2, component);
+            components.push(component);
+        }
+    }
+    return components;
+}
+/**
+ * DFS to record finish order
+ */
+function dfsFinishOrder(graph, node, visited, finishOrder) {
+    visited.add(node);
+    for (const neighbor of graph.neighbors(node)) {
+        if (!visited.has(neighbor)) {
+            dfsFinishOrder(graph, neighbor, visited, finishOrder);
+        }
+    }
+    finishOrder.push(node);
+}
+/**
+ * DFS to collect nodes in a component
+ */
+function dfsCollectComponent(graph, node, visited, component) {
+    visited.add(node);
+    component.push(node);
+    for (const neighbor of graph.neighbors(node)) {
+        if (!visited.has(neighbor)) {
+            dfsCollectComponent(graph, neighbor, visited, component);
+        }
+    }
+}
+/**
+ * Create transpose (reverse) of a directed graph
+ */
+function createTransposeGraph(graph) {
+    const transpose = new Graph({ directed: true });
+    // Add all nodes
+    for (const node of graph.nodes()) {
+        transpose.addNode(node.id, node.data);
+    }
+    // Add reverse edges
+    for (const edge of graph.edges()) {
+        transpose.addEdge(edge.target, edge.source, edge.weight, edge.data);
+    }
+    return transpose;
+}
+//# sourceMappingURL=dfs.js.map

package/dist/src/algorithms/traversal/dfs.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dfs.js","sourceRoot":"","sources":["../../../../src/algorithms/traversal/dfs.ts"],"names":[],"mappings":"AAAA,OAAO,EAAC,KAAK,EAAC,MAAM,qBAAqB,CAAC;AAkB1C;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAC5B,KAAY,EACZ,SAAiB,EACjB,UAAsB,EAAE;IAExB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,SAAS,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,KAAK,CAAC,cAAc,MAAM,CAAC,SAAS,CAAC,qBAAqB,CAAC,CAAC;IAC1E,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;IAE9C,IAAI,OAAO,CAAC,SAAS,EAAE,CAAC;QACpB,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,CAAC,CAAC;IACrE,CAAC;SAAM,CAAC;QACJ,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,CAAC,CAAC;IAClE,CAAC;IAED,OAAO,EAAC,OAAO,EAAE,KAAK,EAAE,IAAI,EAAC,CAAC;AAClC,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CACjB,KAAY,EACZ,SAAiB,EACjB,OAAoB,EACpB,KAAe,EACf,IAAgC,EAChC,OAAmB;IAEnB,IAAI,OAAO,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;QAC7B,yEAAyE;QACzE,YAAY,CAAC,KAAK,EAAE,SAAS,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,CAAC,EAAE,IAAI,CAAC,CAAC;QACvE,OAAO;IACX,CAAC;IAED,MAAM,KAAK,GAA2D,EAAE,CAAC;IACzE,KAAK,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,SAAS,EAAE,MAAM,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC,EAAC,CAAC,CAAC;IAEtD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACtB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO,EAAE,CAAC;YACX,MAAM;QACV,CAAC;QAED,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,CAAC;YAC7B,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAC1B,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,MAAM,CAAC,CAAC;YAEvC,uBAAuB;YACvB,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;YAEzB,oCAAoC;YACpC,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;gBACxB,OAAO,CAAC,aAAa,CAAC,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC,KAAK,CAAC,CAAC;YACvD,CAAC;YAED,oCAAoC;YACpC,IAAI,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,IAAI,KAAK,OAAO,CAAC,UAAU,EAAE,CAAC;gBAC5D,MAAM;YACV,CAAC;YAED,8EAA8E;YAC9E,MAAM,SAAS,GAAG,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC;YAC5D,KAAK,IAAI,CAAC,GAAG,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;gBAC7C,MAAM,QAAQ,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;gBAC9B,IAAI,QAAQ,KAAK,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;oBACnD,KAAK,CAAC,IAAI,CAAC,EAAC,IAAI,EAAE,QAAQ,EAAE,MAAM,EAAE,OAAO,CAAC,IAAI,EAAE,KAAK,EAAE,OAAO,CAAC,KAAK,GAAG,CAAC,EAAC,CAAC,CAAC;gBACjF,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;AACL,CAAC;AAED;;GAEG;AACH,SAAS,YAAY,CACjB,KAAY,EACZ,IAAY,EACZ,OAAoB,EACpB,KAAe,EACf,IAAgC,EAChC,OAAmB,EACnB,KAAa,EACb,SAAwB,IAAI;IAE5B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClB,IAAI,CAAC,GAAG,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;IAEvB,uBAAuB;IACvB,IAAI,OAAO,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEjB,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;YACxB,OAAO,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACvC,CAAC;QAED,oCAAoC;QACpC,IAAI,OAAO,CAAC,UAAU,IAAI,IAAI,KAAK,OAAO,CAAC,UAAU,EAAE,CAAC;YACpD,OAAO;QACX,CAAC;IACL,CAAC;IAED,8BAA8B;IAC9B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzB,YAAY,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,EAAE,IAAI,EAAE,OAAO,EAAE,KAAK,GAAG,CAAC,EAAE,IAAI,CAAC,CAAC;QAClF,CAAC;IACL,CAAC;IAED,wBAAwB;IACxB,IAAI,OAAO,CAAC,QAAQ,KAAK,KAAK,EAAE,CAAC;QAC7B,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEjB,IAAI,OAAO,CAAC,aAAa,EAAE,CAAC;YACxB,OAAO,CAAC,aAAa,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;QACvC,CAAC;IACL,CAAC;AACL,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,KAAY;IACpC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAElC,uCAAuC;IACvC,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,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;gBACnB,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;gBACzC,IAAI,oBAAoB,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,cAAc,CAAC,EAAE,CAAC;oBAChE,OAAO,IAAI,CAAC;gBAChB,CAAC;YACL,CAAC;iBAAM,CAAC;gBACJ,IAAI,sBAAsB,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;oBACxD,OAAO,IAAI,CAAC;gBAChB,CAAC;YACL,CAAC;QACL,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CACzB,KAAY,EACZ,IAAY,EACZ,OAAoB,EACpB,cAA2B;IAE3B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClB,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAEzB,sBAAsB;IACtB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzB,IAAI,oBAAoB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,cAAc,CAAC,EAAE,CAAC;gBACjE,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;aAAM,IAAI,cAAc,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACtC,mCAAmC;YACnC,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED,cAAc,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IAC5B,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,SAAS,sBAAsB,CAC3B,KAAY,EACZ,IAAY,EACZ,OAAoB,EACpB,MAAqB;IAErB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAElB,sBAAsB;IACtB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzB,IAAI,sBAAsB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC;gBACzD,OAAO,IAAI,CAAC;YAChB,CAAC;QACL,CAAC;aAAM,IAAI,QAAQ,KAAK,MAAM,EAAE,CAAC;YAC7B,8DAA8D;YAC9D,OAAO,IAAI,CAAC;QAChB,CAAC;IACL,CAAC;IAED,OAAO,KAAK,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAAC,KAAY;IACxC,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,4CAA4C,CAAC,CAAC;IAClE,CAAC;IAED,kCAAkC;IAClC,IAAI,WAAW,CAAC,KAAK,CAAC,EAAE,CAAC;QACrB,OAAO,IAAI,CAAC,CAAC,gDAAgD;IACjE,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,uCAAuC;IACvC,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,mBAAmB,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QACxD,CAAC;IACL,CAAC;IAED,mDAAmD;IACnD,OAAO,KAAK,CAAC,OAAO,EAAE,CAAC;AAC3B,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CACxB,KAAY,EACZ,IAAY,EACZ,OAAoB,EACpB,KAAe;IAEf,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAElB,4BAA4B;IAC5B,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzB,mBAAmB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,KAAK,CAAC,CAAC;QACzD,CAAC;IACL,CAAC;IAED,yDAAyD;IACzD,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AACrB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,+BAA+B,CAAC,KAAY;IACxD,IAAI,CAAC,KAAK,CAAC,UAAU,EAAE,CAAC;QACpB,MAAM,IAAI,KAAK,CAAC,wDAAwD,CAAC,CAAC;IAC9E,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,WAAW,GAAa,EAAE,CAAC;IAEjC,gDAAgD;IAChD,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,cAAc,CAAC,KAAK,EAAE,IAAI,CAAC,EAAE,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;QACzD,CAAC;IACL,CAAC;IAED,qDAAqD;IACrD,MAAM,cAAc,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAEnD,yDAAyD;IACzD,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IACnC,MAAM,UAAU,GAAe,EAAE,CAAC;IAElC,KAAK,IAAI,CAAC,GAAG,WAAW,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC;QAC/C,MAAM,IAAI,GAAG,WAAW,CAAC,CAAC,CAAC,CAAC;QAC5B,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAC5C,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,mBAAmB,CAAC,cAAc,EAAE,IAAI,EAAE,QAAQ,EAAE,SAAS,CAAC,CAAC;YAC/D,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/B,CAAC;IACL,CAAC;IAED,OAAO,UAAU,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CACnB,KAAY,EACZ,IAAY,EACZ,OAAoB,EACpB,WAAqB;IAErB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAElB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzB,cAAc,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,WAAW,CAAC,CAAC;QAC1D,CAAC;IACL,CAAC;IAED,WAAW,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;AAC3B,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CACxB,KAAY,EACZ,IAAY,EACZ,OAAoB,EACpB,SAAmB;IAEnB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;IAClB,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAErB,KAAK,MAAM,QAAQ,IAAI,KAAK,CAAC,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC;QAC3C,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;YACzB,mBAAmB,CAAC,KAAK,EAAE,QAAQ,EAAE,OAAO,EAAE,SAAS,CAAC,CAAC;QAC7D,CAAC;IACL,CAAC;AACL,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,KAAY;IACtC,MAAM,SAAS,GAAG,IAAI,KAAK,CAAC,EAAC,QAAQ,EAAE,IAAI,EAAC,CAAC,CAAC;IAE9C,gBAAgB;IAChB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1C,CAAC;IAED,oBAAoB;IACpB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,EAAE,CAAC;QAC/B,SAAS,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,MAAM,EAAE,IAAI,CAAC,IAAI,CAAC,CAAC;IACxE,CAAC;IAED,OAAO,SAAS,CAAC;AACrB,CAAC"}

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

@@ -0,0 +1,7 @@
+/**
+ * Graph traversal algorithms
+ */
+export { breadthFirstSearch, isBipartite, shortestPathBFS, singleSourceShortestPathBFS } from "./bfs.js";
+export type { DFSOptions } from "./dfs.js";
+export { depthFirstSearch, findStronglyConnectedComponents, hasCycleDFS, topologicalSort } from "./dfs.js";
+//# sourceMappingURL=index.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../../../src/algorithms/traversal/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAC,kBAAkB,EAAE,WAAW,EAAE,eAAe,EAAE,2BAA2B,EAAC,MAAM,UAAU,CAAC;AACvG,YAAY,EAAC,UAAU,EAAC,MAAM,UAAU,CAAC;AACzC,OAAO,EAAC,gBAAgB,EAAE,+BAA+B,EAAE,WAAW,EAAE,eAAe,EAAC,MAAM,UAAU,CAAC"}

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

@@ -0,0 +1,6 @@
+/**
+ * Graph traversal algorithms
+ */
+export { breadthFirstSearch, isBipartite, shortestPathBFS, singleSourceShortestPathBFS } from "./bfs.js";
+export { depthFirstSearch, findStronglyConnectedComponents, hasCycleDFS, topologicalSort } from "./dfs.js";
+//# sourceMappingURL=index.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../../../src/algorithms/traversal/index.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,EAAC,kBAAkB,EAAE,WAAW,EAAE,eAAe,EAAE,2BAA2B,EAAC,MAAM,UAAU,CAAC;AAEvG,OAAO,EAAC,gBAAgB,EAAE,+BAA+B,EAAE,WAAW,EAAE,eAAe,EAAC,MAAM,UAAU,CAAC"}

package/dist/src/core/graph.d.ts

@@ -0,0 +1,100 @@
+import type { Edge, GraphConfig, Node, NodeId } from "../types/index.js";
+/**
+ * Core Graph data structure for the Graphty Algorithms library
+ *
+ * Provides efficient graph representation with support for both directed and undirected graphs.
+ * Uses adjacency lists for optimal performance with sparse graphs.
+ */
+export declare class Graph {
+    private nodeMap;
+    private adjacencyList;
+    private incomingEdges;
+    private config;
+    private edgeCount;
+    constructor(config?: Partial<GraphConfig>);
+    /**
+     * Add a node to the graph
+     */
+    addNode(id: NodeId, data?: Record<string, unknown>): void;
+    /**
+     * Remove a node from the graph
+     */
+    removeNode(id: NodeId): boolean;
+    /**
+     * Add an edge to the graph
+     */
+    addEdge(source: NodeId, target: NodeId, weight?: number, data?: Record<string, unknown>): void;
+    /**
+     * Remove an edge from the graph
+     */
+    removeEdge(source: NodeId, target: NodeId): boolean;
+    /**
+     * Check if a node exists in the graph
+     */
+    hasNode(id: NodeId): boolean;
+    /**
+     * Check if an edge exists in the graph
+     */
+    hasEdge(source: NodeId, target: NodeId): boolean;
+    /**
+     * Get a node by ID
+     */
+    getNode(id: NodeId): Node | undefined;
+    /**
+     * Get an edge by source and target
+     */
+    getEdge(source: NodeId, target: NodeId): Edge | undefined;
+    /**
+     * Get the number of nodes in the graph
+     */
+    get nodeCount(): number;
+    /**
+     * Get the number of edges in the graph
+     */
+    get totalEdgeCount(): number;
+    /**
+     * Check if the graph is directed
+     */
+    get isDirected(): boolean;
+    /**
+     * Get all nodes in the graph
+     */
+    nodes(): IterableIterator<Node>;
+    /**
+     * Get all edges in the graph
+     */
+    edges(): IterableIterator<Edge>;
+    /**
+     * Get neighbors of a node (outgoing edges)
+     */
+    neighbors(nodeId: NodeId): IterableIterator<NodeId>;
+    /**
+     * Get incoming neighbors of a node (directed graphs only)
+     */
+    inNeighbors(nodeId: NodeId): IterableIterator<NodeId>;
+    /**
+     * Get outgoing neighbors of a node
+     */
+    outNeighbors(nodeId: NodeId): IterableIterator<NodeId>;
+    /**
+     * Get the degree of a node
+     */
+    degree(nodeId: NodeId): number;
+    /**
+     * Get the in-degree of a node
+     */
+    inDegree(nodeId: NodeId): number;
+    /**
+     * Get the out-degree of a node
+     */
+    outDegree(nodeId: NodeId): number;
+    /**
+     * Create a copy of the graph
+     */
+    clone(): Graph;
+    /**
+     * Get graph configuration
+     */
+    getConfig(): GraphConfig;
+}
+//# sourceMappingURL=graph.d.ts.map

package/dist/src/core/graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph.d.ts","sourceRoot":"","sources":["../../../src/core/graph.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAC,IAAI,EAAE,WAAW,EAAE,IAAI,EAAE,MAAM,EAAC,MAAM,mBAAmB,CAAC;AAEvE;;;;;GAKG;AACH,qBAAa,KAAK;IACd,OAAO,CAAC,OAAO,CAAoB;IACnC,OAAO,CAAC,aAAa,CAAiC;IACtD,OAAO,CAAC,aAAa,CAAiC;IACtD,OAAO,CAAC,MAAM,CAAc;IAC5B,OAAO,CAAC,SAAS,CAAS;gBAEd,MAAM,GAAE,OAAO,CAAC,WAAW,CAAM;IAa7C;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IAWzD;;OAEG;IACH,UAAU,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAwC/B;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,SAAI,EAAE,IAAI,CAAC,EAAE,MAAM,CAAC,MAAM,EAAE,OAAO,CAAC,GAAG,IAAI;IA8CzF;;OAEG;IACH,UAAU,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO;IAyBnD;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO;IAI5B;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,OAAO;IAKhD;;OAEG;IACH,OAAO,CAAC,EAAE,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAIrC;;OAEG;IACH,OAAO,CAAC,MAAM,EAAE,MAAM,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,GAAG,SAAS;IAKzD;;OAEG;IACH,IAAI,SAAS,IAAI,MAAM,CAEtB;IAED;;OAEG;IACH,IAAI,cAAc,IAAI,MAAM,CAE3B;IAED;;OAEG;IACH,IAAI,UAAU,IAAI,OAAO,CAExB;IAED;;OAEG;IACH,KAAK,IAAI,gBAAgB,CAAC,IAAI,CAAC;IAI/B;;OAEG;IACF,KAAK,IAAI,gBAAgB,CAAC,IAAI,CAAC;IAahC;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC;IAKnD;;OAEG;IACH,WAAW,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC;IASrD;;OAEG;IACH,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,gBAAgB,CAAC,MAAM,CAAC;IAItD;;OAEG;IACH,MAAM,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAS9B;;OAEG;IACH,QAAQ,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAShC;;OAEG;IACH,SAAS,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM;IAKjC;;OAEG;IACH,KAAK,IAAI,KAAK;IAqBd;;OAEG;IACH,SAAS,IAAI,WAAW;CAG3B"}

package/dist/src/core/graph.js

@@ -0,0 +1,276 @@
+/**
+ * Core Graph data structure for the Graphty Algorithms library
+ *
+ * Provides efficient graph representation with support for both directed and undirected graphs.
+ * Uses adjacency lists for optimal performance with sparse graphs.
+ */
+export class Graph {
+    nodeMap;
+    adjacencyList;
+    incomingEdges; // For directed graphs
+    config;
+    edgeCount;
+    constructor(config = {}) {
+        this.config = {
+            directed: false,
+            allowSelfLoops: true,
+            allowParallelEdges: false,
+            ...config,
+        };
+        this.nodeMap = new Map();
+        this.adjacencyList = new Map();
+        this.incomingEdges = new Map();
+        this.edgeCount = 0;
+    }
+    /**
+     * Add a node to the graph
+     */
+    addNode(id, data) {
+        if (!this.nodeMap.has(id)) {
+            this.nodeMap.set(id, { id, data });
+            this.adjacencyList.set(id, new Map());
+            if (this.config.directed) {
+                this.incomingEdges.set(id, new Map());
+            }
+        }
+    }
+    /**
+     * Remove a node from the graph
+     */
+    removeNode(id) {
+        if (!this.nodeMap.has(id)) {
+            return false;
+        }
+        // Remove all edges connected to this node
+        const outgoingEdges = this.adjacencyList.get(id);
+        if (outgoingEdges) {
+            for (const targetId of outgoingEdges.keys()) {
+                this.removeEdge(id, targetId);
+            }
+        }
+        if (this.config.directed) {
+            const incomingEdges = this.incomingEdges.get(id);
+            if (incomingEdges) {
+                for (const sourceId of incomingEdges.keys()) {
+                    this.removeEdge(sourceId, id);
+                }
+            }
+        }
+        else {
+            // For undirected graphs, also remove edges where this node is the target
+            for (const [nodeId, edges] of this.adjacencyList) {
+                if (edges.has(id)) {
+                    this.removeEdge(nodeId, id);
+                }
+            }
+        }
+        // Remove the node itself
+        this.nodeMap.delete(id);
+        this.adjacencyList.delete(id);
+        if (this.config.directed) {
+            this.incomingEdges.delete(id);
+        }
+        return true;
+    }
+    /**
+     * Add an edge to the graph
+     */
+    addEdge(source, target, weight = 1, data) {
+        // Ensure both nodes exist
+        this.addNode(source);
+        this.addNode(target);
+        // Check self-loops
+        if (!this.config.allowSelfLoops && source === target) {
+            throw new Error("Self-loops are not allowed in this graph");
+        }
+        // Check parallel edges
+        if (!this.config.allowParallelEdges && this.hasEdge(source, target)) {
+            throw new Error("Parallel edges are not allowed in this graph");
+        }
+        const edge = { source, target, weight, data };
+        // Add to adjacency list
+        const sourceAdjacency = this.adjacencyList.get(source);
+        if (sourceAdjacency) {
+            sourceAdjacency.set(target, edge);
+        }
+        if (this.config.directed) {
+            // For directed graphs, add to incoming edges list
+            const targetIncoming = this.incomingEdges.get(target);
+            if (targetIncoming) {
+                targetIncoming.set(source, edge);
+            }
+        }
+        else {
+            // For undirected graphs, add the reverse edge
+            if (source !== target) {
+                const reverseEdge = { source: target, target: source, weight, data };
+                const targetAdjacency = this.adjacencyList.get(target);
+                if (targetAdjacency) {
+                    targetAdjacency.set(source, reverseEdge);
+                }
+            }
+        }
+        this.edgeCount++;
+    }
+    /**
+     * Remove an edge from the graph
+     */
+    removeEdge(source, target) {
+        const sourceEdges = this.adjacencyList.get(source);
+        if (!sourceEdges?.has(target)) {
+            return false;
+        }
+        sourceEdges.delete(target);
+        if (this.config.directed) {
+            const targetIncoming = this.incomingEdges.get(target);
+            if (targetIncoming) {
+                targetIncoming.delete(source);
+            }
+        }
+        else {
+            // For undirected graphs, remove the reverse edge
+            const targetEdges = this.adjacencyList.get(target);
+            if (targetEdges) {
+                targetEdges.delete(source);
+            }
+        }
+        this.edgeCount--;
+        return true;
+    }
+    /**
+     * Check if a node exists in the graph
+     */
+    hasNode(id) {
+        return this.nodeMap.has(id);
+    }
+    /**
+     * Check if an edge exists in the graph
+     */
+    hasEdge(source, target) {
+        const sourceEdges = this.adjacencyList.get(source);
+        return sourceEdges ? sourceEdges.has(target) : false;
+    }
+    /**
+     * Get a node by ID
+     */
+    getNode(id) {
+        return this.nodeMap.get(id);
+    }
+    /**
+     * Get an edge by source and target
+     */
+    getEdge(source, target) {
+        const sourceEdges = this.adjacencyList.get(source);
+        return sourceEdges ? sourceEdges.get(target) : undefined;
+    }
+    /**
+     * Get the number of nodes in the graph
+     */
+    get nodeCount() {
+        return this.nodeMap.size;
+    }
+    /**
+     * Get the number of edges in the graph
+     */
+    get totalEdgeCount() {
+        return this.edgeCount;
+    }
+    /**
+     * Check if the graph is directed
+     */
+    get isDirected() {
+        return this.config.directed;
+    }
+    /**
+     * Get all nodes in the graph
+     */
+    nodes() {
+        return this.nodeMap.values();
+    }
+    /**
+     * Get all edges in the graph
+     */
+    *edges() {
+        for (const [source, edges] of this.adjacencyList) {
+            for (const edge of edges.values()) {
+                // For undirected graphs, only yield each edge once
+                if (!this.config.directed && source > edge.target) {
+                    continue;
+                }
+                yield edge;
+            }
+        }
+    }
+    /**
+     * Get neighbors of a node (outgoing edges)
+     */
+    neighbors(nodeId) {
+        const edges = this.adjacencyList.get(nodeId);
+        return edges ? edges.keys() : new Map().keys();
+    }
+    /**
+     * Get incoming neighbors of a node (directed graphs only)
+     */
+    inNeighbors(nodeId) {
+        if (!this.config.directed) {
+            return this.neighbors(nodeId);
+        }
+        const edges = this.incomingEdges.get(nodeId);
+        return edges ? edges.keys() : new Map().keys();
+    }
+    /**
+     * Get outgoing neighbors of a node
+     */
+    outNeighbors(nodeId) {
+        return this.neighbors(nodeId);
+    }
+    /**
+     * Get the degree of a node
+     */
+    degree(nodeId) {
+        if (this.config.directed) {
+            return this.inDegree(nodeId) + this.outDegree(nodeId);
+        }
+        const edges = this.adjacencyList.get(nodeId);
+        return edges ? edges.size : 0;
+    }
+    /**
+     * Get the in-degree of a node
+     */
+    inDegree(nodeId) {
+        if (!this.config.directed) {
+            return this.degree(nodeId);
+        }
+        const edges = this.incomingEdges.get(nodeId);
+        return edges ? edges.size : 0;
+    }
+    /**
+     * Get the out-degree of a node
+     */
+    outDegree(nodeId) {
+        const edges = this.adjacencyList.get(nodeId);
+        return edges ? edges.size : 0;
+    }
+    /**
+     * Create a copy of the graph
+     */
+    clone() {
+        const cloned = new Graph(this.config);
+        // Copy nodes
+        for (const node of this.nodeMap.values()) {
+            cloned.addNode(node.id, node.data ? { ...node.data } : undefined);
+        }
+        // Copy edges
+        for (const edge of this.edges()) {
+            cloned.addEdge(edge.source, edge.target, edge.weight, edge.data ? { ...edge.data } : undefined);
+        }
+        return cloned;
+    }
+    /**
+     * Get graph configuration
+     */
+    getConfig() {
+        return { ...this.config };
+    }
+}
+//# sourceMappingURL=graph.js.map