octie-cli 1.0.0

package/dist/core/graph/operations.js

@@ -0,0 +1,503 @@
+/**
+ * Graph manipulation operations
+ *
+ * Implements complex graph operations for task management:
+ * - Cut nodes from graph while reconnecting edges
+ * - Insert nodes between existing nodes
+ * - Move subtrees to new parents
+ * - Merge tasks together
+ *
+ * @module core/graph/operations
+ */
+import { TaskNode } from '../models/task-node.js';
+import { TaskNotFoundError, ValidationError } from '../../types/index.js';
+/**
+ * Cut a node from the graph, reconnecting its incoming edges to its outgoing edges
+ *
+ * Before: A -> B -> C
+ * After:  A -> C (B removed)
+ *
+ * Algorithm:
+ * 1. Get all incoming edges to the node
+ * 2. Get all outgoing edges from the node
+ * 3. For each incoming source, connect it to all outgoing targets
+ * 4. Update target blockers to reference new sources instead of deleted node
+ * 5. Remove the node from the graph
+ *
+ * Time Complexity: O(k * m) where k = incoming edges, m = outgoing edges
+ *
+ * @param graph - Task graph store
+ * @param nodeId - Task ID to cut
+ * @throws {TaskNotFoundError} If task not found
+ *
+ * @example
+ * ```ts
+ * // Graph: A -> B -> C
+ * cutNode(graph, 'B');
+ * // Result: A -> C (B removed, A now points directly to C)
+ * // Also: C.blockers updated from [B] to [A]
+ * ```
+ */
+export function cutNode(graph, nodeId) {
+    if (!graph.hasNode(nodeId)) {
+        throw new TaskNotFoundError(nodeId);
+    }
+    // Get all incoming and outgoing edges before removing the node
+    const incomingSources = graph.getIncomingEdges(nodeId);
+    const outgoingTargets = graph.getOutgoingEdges(nodeId);
+    // Reconnect: for each incoming source, connect to all outgoing targets
+    for (const sourceId of incomingSources) {
+        for (const targetId of outgoingTargets) {
+            // Only add edge if it doesn't already exist
+            if (!graph.hasEdge(sourceId, targetId)) {
+                graph.addEdge(sourceId, targetId);
+                // Update target's blockers array to include the new source
+                const targetNode = graph.getNode(targetId);
+                if (targetNode && !targetNode.blockers.includes(sourceId)) {
+                    targetNode.addBlocker(sourceId);
+                }
+            }
+        }
+    }
+    // Remove deleted nodeId from all targets' blockers arrays
+    for (const targetId of outgoingTargets) {
+        const targetNode = graph.getNode(targetId);
+        if (targetNode && targetNode.blockers.includes(nodeId)) {
+            targetNode.removeBlocker(nodeId);
+        }
+    }
+    // Remove the node (this also removes all its edges)
+    graph.removeNode(nodeId);
+}
+/**
+ * Insert a node between two existing nodes
+ *
+ * Before: A -> C
+ * After:  A -> B -> C
+ *
+ * Algorithm:
+ * 1. Verify both nodes exist
+ * 2. Verify edge exists from afterId to beforeId
+ * 3. Remove the existing edge
+ * 4. Add the new node to the graph
+ * 5. Create edges: afterId -> newNodeId -> beforeId
+ *
+ * Time Complexity: O(1) for edge operations
+ *
+ * @param graph - Task graph store
+ * @param newNode - Task node to insert
+ * @param afterId - Source node ID (edge comes from here)
+ * @param beforeId - Target node ID (edge goes to here)
+ * @throws {TaskNotFoundError} If afterId or beforeId not found
+ * @throws {ValidationError} If edge doesn't exist or would create duplicate
+ *
+ * @example
+ * ```ts
+ * // Graph: A -> C
+ * const newNode = createTaskNode({ title: 'B', ... });
+ * insertNodeBetween(graph, newNode, 'A', 'C');
+ * // Result: A -> B -> C
+ * ```
+ */
+export function insertNodeBetween(graph, newNode, afterId, beforeId) {
+    // Verify source and target nodes exist
+    if (!graph.hasNode(afterId)) {
+        throw new TaskNotFoundError(afterId);
+    }
+    if (!graph.hasNode(beforeId)) {
+        throw new TaskNotFoundError(beforeId);
+    }
+    // Verify edge exists
+    if (!graph.hasEdge(afterId, beforeId)) {
+        throw new ValidationError(`Edge from '${afterId}' to '${beforeId}' does not exist`, 'edges');
+    }
+    // Add the new node to the graph first
+    graph.addNode(newNode);
+    // Remove the existing edge
+    graph.removeEdge(afterId, beforeId);
+    // Add new edges: afterId -> newNodeId -> beforeId
+    graph.addEdge(afterId, newNode.id);
+    graph.addEdge(newNode.id, beforeId);
+}
+/**
+ * Move a subtree to a new parent
+ *
+ * Moves a task (and all its descendants) to be under a new parent.
+ * This is useful for reorganizing task hierarchies.
+ *
+ * Before:
+ *   A -> X
+ *   B -> Y
+ * After moveSubtree(graph, 'Y', 'A'):
+ *   A -> X -> Y
+ *   B
+ *
+ * Algorithm:
+ * 1. Get all current parents of the subtree root
+ * 2. Remove edges from all current parents
+ * 3. Add edge from new parent to subtree root
+ *
+ * Time Complexity: O(k) where k = number of current parents
+ *
+ * @param graph - Task graph store
+ * @param subtreeRootId - Root of the subtree to move
+ * @param newParentId - New parent task ID
+ * @throws {TaskNotFoundError} If subtreeRootId or newParentId not found
+ * @throws {ValidationError} If edge already exists or would create self-loop
+ *
+ * @example
+ * ```ts
+ * // Graph: A -> X, B -> Y
+ * moveSubtree(graph, 'Y', 'X');
+ * // Result: A -> X -> Y, B
+ * ```
+ */
+export function moveSubtree(graph, subtreeRootId, newParentId) {
+    // Verify both nodes exist
+    if (!graph.hasNode(subtreeRootId)) {
+        throw new TaskNotFoundError(subtreeRootId);
+    }
+    if (!graph.hasNode(newParentId)) {
+        throw new TaskNotFoundError(newParentId);
+    }
+    // Prevent self-loops
+    if (subtreeRootId === newParentId) {
+        throw new ValidationError('Cannot move subtree to be its own parent', 'subtreeRootId');
+    }
+    // Check if edge already exists
+    if (graph.hasEdge(newParentId, subtreeRootId)) {
+        throw new ValidationError(`Edge from '${newParentId}' to '${subtreeRootId}' already exists`, 'edges');
+    }
+    // Get all current parents (nodes that point to subtreeRootId)
+    const currentParents = graph.getIncomingEdges(subtreeRootId);
+    // Remove from all current parents
+    for (const parentId of currentParents) {
+        graph.removeEdge(parentId, subtreeRootId);
+    }
+    // Add to new parent
+    graph.addEdge(newParentId, subtreeRootId);
+}
+/**
+ * Merge two tasks into one
+ *
+ * Combines the source task into the target task by:
+ * 1. Merging all properties (description, success_criteria, deliverables, etc.)
+ * 2. Reconnecting all edges from source to point to target
+ * 3. Removing the source task
+ *
+ * Before:
+ *   A -> source -> C
+ *   B -> target -> D
+ * After mergeTasks(graph, 'source', 'target'):
+ *   A -> target -> C, D
+ *   B -> target -> C, D
+ *   (source is removed)
+ *
+ * Algorithm:
+ * 1. Get source and target tasks
+ * 2. Merge target properties with source properties
+ * 3. Get all incoming edges to source (except target)
+ * 4. Get all outgoing edges from source (except target)
+ * 5. Reconnect edges: incoming -> target, target -> outgoing
+ * 6. Remove source node
+ * 7. Return merge result
+ *
+ * Time Complexity: O(k + m) where k = incoming edges, m = outgoing edges
+ *
+ * @param graph - Task graph store
+ * @param sourceId - Source task ID (will be removed)
+ * @param targetId - Target task ID (will be kept and merged into)
+ * @returns Merge result with merged task and affected task IDs
+ * @throws {TaskNotFoundError} If source or target not found
+ * @throws {ValidationError} If source and target are the same
+ *
+ * @example
+ * ```ts
+ * const result = mergeTasks(graph, 'task-001', 'task-002');
+ * console.log('Merged task:', result.task.id);
+ * console.log('Removed tasks:', result.removedTasks);
+ * ```
+ */
+export function mergeTasks(graph, sourceId, targetId) {
+    // Verify both tasks exist
+    const source = graph.getNode(sourceId);
+    const target = graph.getNode(targetId);
+    if (!source) {
+        throw new TaskNotFoundError(sourceId);
+    }
+    if (!target) {
+        throw new TaskNotFoundError(targetId);
+    }
+    // Cannot merge a task with itself
+    if (sourceId === targetId) {
+        throw new ValidationError('Cannot merge a task with itself', 'sourceId');
+    }
+    // Merge properties into target task
+    // Merge descriptions with separator
+    const newDescription = target.description
+        ? `${target.description}\n\n--- Merged from "${source.title}" ---\n${source.description}`
+        : source.description;
+    target.setDescription(newDescription);
+    // Merge success criteria (avoiding duplicates by ID)
+    for (const sc of source.success_criteria) {
+        if (!target.success_criteria.some(tsc => tsc.id === sc.id)) {
+            target.addSuccessCriterion(sc);
+        }
+    }
+    // Merge deliverables (avoiding duplicates by ID)
+    for (const d of source.deliverables) {
+        if (!target.deliverables.some(td => td.id === d.id)) {
+            target.addDeliverable(d);
+        }
+    }
+    // Merge related files (avoiding duplicates)
+    for (const file of source.related_files) {
+        target.addRelatedFile(file);
+    }
+    // Merge notes with separator
+    const newNotes = target.notes
+        ? `${target.notes}\n\nMerged notes from "${source.title}":\n${source.notes}`
+        : source.notes;
+    target.appendNotes(newNotes);
+    // Merge C7 verifications
+    for (const cv of source.c7_verified) {
+        target.addC7Verification(cv);
+    }
+    // Remove source from target's blockers (source is being merged/removed)
+    if (target.blockers.includes(sourceId)) {
+        target.removeBlocker(sourceId);
+    }
+    // Merge blockers (avoiding duplicates and self-references)
+    for (const blockerId of source.blockers) {
+        if (blockerId !== targetId && !target.blockers.includes(blockerId)) {
+            target.addBlocker(blockerId);
+        }
+    }
+    // Merge dependencies explanation text (combine both)
+    if (source.dependencies) {
+        if (target.dependencies) {
+            target.setDependencies(`${target.dependencies}\n${source.dependencies}`);
+        }
+        else {
+            target.setDependencies(source.dependencies);
+        }
+    }
+    // Track which tasks were affected by reconnection
+    const reconnectSources = [];
+    const reconnectTargets = [];
+    // Get source's incoming edges (tasks pointing to source)
+    const sourceIncoming = graph.getIncomingEdges(sourceId);
+    // Get source's outgoing edges (tasks source points to)
+    const sourceOutgoing = graph.getOutgoingEdges(sourceId);
+    // Reconnect incoming edges (except target and self-loops)
+    for (const fromId of sourceIncoming) {
+        if (fromId !== targetId && !graph.hasEdge(fromId, targetId)) {
+            graph.addEdge(fromId, targetId);
+            reconnectSources.push(fromId);
+        }
+    }
+    // Reconnect outgoing edges (except target and self-loops)
+    for (const toId of sourceOutgoing) {
+        if (toId !== targetId && !graph.hasEdge(targetId, toId)) {
+            graph.addEdge(targetId, toId);
+            reconnectTargets.push(toId);
+        }
+    }
+    // Update the target task in the graph with merged data
+    graph.updateNode(target);
+    // Remove the source task
+    graph.removeNode(sourceId);
+    // Collect all affected task IDs
+    const allAffected = new Set([
+        ...reconnectSources,
+        ...reconnectTargets,
+        targetId
+    ]);
+    return {
+        task: target,
+        removedTasks: [sourceId],
+        updatedTasks: Array.from(allAffected)
+    };
+}
+/**
+ * Get all descendants of a node (transitive closure via outgoing edges)
+ *
+ * Returns all tasks reachable from the given node.
+ *
+ * @param graph - Task graph store
+ * @param nodeId - Starting task ID
+ * @returns Set of descendant task IDs (including the starting node)
+ * @throws {TaskNotFoundError} If node not found
+ *
+ * @example
+ * ```ts
+ * // Graph: A -> B -> C, A -> D
+ * const descendants = getDescendants(graph, 'A');
+ * // Returns: ['A', 'B', 'C', 'D']
+ * ```
+ */
+export function getDescendants(graph, nodeId) {
+    if (!graph.hasNode(nodeId)) {
+        throw new TaskNotFoundError(nodeId);
+    }
+    const descendants = new Set();
+    const stack = [nodeId];
+    while (stack.length > 0) {
+        const current = stack.pop();
+        if (descendants.has(current)) {
+            continue;
+        }
+        descendants.add(current);
+        // Add all children to the stack
+        const children = graph.getOutgoingEdges(current);
+        for (const child of children) {
+            if (!descendants.has(child)) {
+                stack.push(child);
+            }
+        }
+    }
+    return descendants;
+}
+/**
+ * Get all ancestors of a node (transitive closure via incoming edges)
+ *
+ * Returns all tasks that can reach the given node.
+ *
+ * @param graph - Task graph store
+ * @param nodeId - Starting task ID
+ * @returns Set of ancestor task IDs (including the starting node)
+ * @throws {TaskNotFoundError} If node not found
+ *
+ * @example
+ * ```ts
+ * // Graph: A -> B -> C
+ * const ancestors = getAncestors(graph, 'C');
+ * // Returns: ['C', 'B', 'A']
+ * ```
+ */
+export function getAncestors(graph, nodeId) {
+    if (!graph.hasNode(nodeId)) {
+        throw new TaskNotFoundError(nodeId);
+    }
+    const ancestors = new Set();
+    const stack = [nodeId];
+    while (stack.length > 0) {
+        const current = stack.pop();
+        if (ancestors.has(current)) {
+            continue;
+        }
+        ancestors.add(current);
+        // Add all parents to the stack
+        const parents = graph.getIncomingEdges(current);
+        for (const parent of parents) {
+            if (!ancestors.has(parent)) {
+                stack.push(parent);
+            }
+        }
+    }
+    return ancestors;
+}
+/**
+ * Validate that moving a subtree won't create a cycle
+ *
+ * Checks if adding an edge from newParentId to subtreeRootId would create a cycle.
+ * This is important for moveSubtree operations.
+ *
+ * @param graph - Task graph store
+ * @param subtreeRootId - Root of the subtree to move
+ * @param newParentId - Potential new parent task ID
+ * @returns true if move is safe (won't create cycle), false otherwise
+ * @throws {TaskNotFoundError} If either task not found
+ *
+ * @example
+ * ```ts
+ * // Graph: A -> B -> C
+ * if (isValidSubtreeMove(graph, 'C', 'A')) {
+ *   // This would create a cycle (A -> B -> C -> A)
+ *   // Don't allow the move
+ * }
+ * ```
+ */
+export function isValidSubtreeMove(graph, subtreeRootId, newParentId) {
+    if (!graph.hasNode(subtreeRootId)) {
+        throw new TaskNotFoundError(subtreeRootId);
+    }
+    if (!graph.hasNode(newParentId)) {
+        throw new TaskNotFoundError(newParentId);
+    }
+    // Check if newParentId is in the descendants of subtreeRootId
+    // If so, adding edge subtreeRootId -> newParentId would create a cycle
+    const descendants = getDescendants(graph, subtreeRootId);
+    return !descendants.has(newParentId);
+}
+/**
+ * Cascade delete a node and all its dependent tasks
+ *
+ * Deletes the specified node and all tasks that depend on it (directly or transitively).
+ * Tasks are deleted in reverse order (leaves first) to maintain graph integrity.
+ *
+ * Before:
+ *   A -> B -> C -> D
+ * After cascadeDelete(graph, 'B'):
+ *   A (B, C, D removed)
+ *
+ * Algorithm:
+ * 1. Get all descendants of the node (tasks that depend on it transitively)
+ * 2. Iteratively find and delete leaf nodes (no outgoing edges) first
+ * 3. Continue until all descendants are deleted
+ *
+ * Time Complexity: O(k * m) where k = descendants, m = average edges
+ *
+ * @param graph - Task graph store
+ * @param nodeId - Task ID to cascade delete
+ * @returns Array of deleted task IDs (in order of deletion)
+ * @throws {TaskNotFoundError} If node not found
+ *
+ * @example
+ * ```ts
+ * // Graph: A -> B -> C -> D
+ * const deleted = cascadeDelete(graph, 'B');
+ * // Returns: ['D', 'C', 'B'] (deleted in this order)
+ * // Result: Only A remains
+ * ```
+ */
+export function cascadeDelete(graph, nodeId) {
+    if (!graph.hasNode(nodeId)) {
+        throw new TaskNotFoundError(nodeId);
+    }
+    const deletedIds = [];
+    // Get all tasks that depend on this node (directly or transitively)
+    const descendants = getDescendants(graph, nodeId);
+    // Remove the original node from descendants set for processing
+    // We'll delete it last (or as part of the iterative process)
+    const toDelete = new Set(descendants);
+    // Iteratively delete leaf nodes (nodes with no outgoing edges in remaining set)
+    while (toDelete.size > 0) {
+        let deletedThisRound = false;
+        for (const id of toDelete) {
+            // Check if this node is a leaf (no outgoing edges to other nodes in toDelete)
+            const outgoing = graph.getOutgoingEdges(id);
+            const hasDependentsInSet = outgoing.some(depId => toDelete.has(depId));
+            if (!hasDependentsInSet) {
+                // This is a leaf in our deletion set, safe to delete
+                graph.removeNode(id);
+                deletedIds.push(id);
+                toDelete.delete(id);
+                deletedThisRound = true;
+                break; // Restart loop after each deletion
+            }
+        }
+        // Safety check to prevent infinite loop
+        if (!deletedThisRound && toDelete.size > 0) {
+            // This shouldn't happen in a valid DAG, but handle gracefully
+            // Force delete remaining nodes
+            for (const id of toDelete) {
+                graph.removeNode(id);
+                deletedIds.push(id);
+            }
+            break;
+        }
+    }
+    return deletedIds;
+}
+//# sourceMappingURL=operations.js.map

package/dist/core/graph/operations.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"operations.js","sourceRoot":"","sources":["../../../src/core/graph/operations.ts"],"names":[],"mappings":"AAAA;;;;;;;;;;GAUG;AAIH,OAAO,EAAE,QAAQ,EAAE,MAAM,wBAAwB,CAAC;AAClD,OAAO,EAAE,iBAAiB,EAAE,eAAe,EAAE,MAAM,sBAAsB,CAAC;AAE1E;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,MAAM,UAAU,OAAO,CAAC,KAAqB,EAAE,MAAc;IAC3D,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,+DAA+D;IAC/D,MAAM,eAAe,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;IACvD,MAAM,eAAe,GAAG,KAAK,CAAC,gBAAgB,CAAC,MAAM,CAAC,CAAC;IAEvD,uEAAuE;IACvE,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;QACvC,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;YACvC,4CAA4C;YAC5C,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,EAAE,CAAC;gBACvC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC;gBAClC,2DAA2D;gBAC3D,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAC3C,IAAI,UAAU,IAAI,CAAC,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;oBAC1D,UAAU,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;gBAClC,CAAC;YACH,CAAC;QACH,CAAC;IACH,CAAC;IAED,0DAA0D;IAC1D,KAAK,MAAM,QAAQ,IAAI,eAAe,EAAE,CAAC;QACvC,MAAM,UAAU,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC3C,IAAI,UAAU,IAAI,UAAU,CAAC,QAAQ,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YACvD,UAAU,CAAC,aAAa,CAAC,MAAM,CAAC,CAAC;QACnC,CAAC;IACH,CAAC;IAED,oDAAoD;IACpD,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;AAC3B,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA6BG;AACH,MAAM,UAAU,iBAAiB,CAC/B,KAAqB,EACrB,OAAiB,EACjB,OAAe,EACf,QAAgB;IAEhB,uCAAuC;IACvC,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC;QAC5B,MAAM,IAAI,iBAAiB,CAAC,OAAO,CAAC,CAAC;IACvC,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,EAAE,CAAC;QAC7B,MAAM,IAAI,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IACxC,CAAC;IAED,qBAAqB;IACrB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC;QACtC,MAAM,IAAI,eAAe,CACvB,cAAc,OAAO,SAAS,QAAQ,kBAAkB,EACxD,OAAO,CACR,CAAC;IACJ,CAAC;IAED,sCAAsC;IACtC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IAEvB,2BAA2B;IAC3B,KAAK,CAAC,UAAU,CAAC,OAAO,EAAE,QAAQ,CAAC,CAAC;IAEpC,kDAAkD;IAClD,KAAK,CAAC,OAAO,CAAC,OAAO,EAAE,OAAO,CAAC,EAAE,CAAC,CAAC;IACnC,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,EAAE,QAAQ,CAAC,CAAC;AACtC,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAgCG;AACH,MAAM,UAAU,WAAW,CACzB,KAAqB,EACrB,aAAqB,EACrB,WAAmB;IAEnB,0BAA0B;IAC1B,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,iBAAiB,CAAC,aAAa,CAAC,CAAC;IAC7C,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,iBAAiB,CAAC,WAAW,CAAC,CAAC;IAC3C,CAAC;IAED,qBAAqB;IACrB,IAAI,aAAa,KAAK,WAAW,EAAE,CAAC;QAClC,MAAM,IAAI,eAAe,CACvB,0CAA0C,EAC1C,eAAe,CAChB,CAAC;IACJ,CAAC;IAED,+BAA+B;IAC/B,IAAI,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,aAAa,CAAC,EAAE,CAAC;QAC9C,MAAM,IAAI,eAAe,CACvB,cAAc,WAAW,SAAS,aAAa,kBAAkB,EACjE,OAAO,CACR,CAAC;IACJ,CAAC;IAED,8DAA8D;IAC9D,MAAM,cAAc,GAAG,KAAK,CAAC,gBAAgB,CAAC,aAAa,CAAC,CAAC;IAE7D,kCAAkC;IAClC,KAAK,MAAM,QAAQ,IAAI,cAAc,EAAE,CAAC;QACtC,KAAK,CAAC,UAAU,CAAC,QAAQ,EAAE,aAAa,CAAC,CAAC;IAC5C,CAAC;IAED,oBAAoB;IACpB,KAAK,CAAC,OAAO,CAAC,WAAW,EAAE,aAAa,CAAC,CAAC;AAC5C,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GAwCG;AACH,MAAM,UAAU,UAAU,CACxB,KAAqB,EACrB,QAAgB,EAChB,QAAgB;IAEhB,0BAA0B;IAC1B,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IACvC,MAAM,MAAM,GAAG,KAAK,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;IAEvC,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IACxC,CAAC;IACD,IAAI,CAAC,MAAM,EAAE,CAAC;QACZ,MAAM,IAAI,iBAAiB,CAAC,QAAQ,CAAC,CAAC;IACxC,CAAC;IAED,kCAAkC;IAClC,IAAI,QAAQ,KAAK,QAAQ,EAAE,CAAC;QAC1B,MAAM,IAAI,eAAe,CACvB,iCAAiC,EACjC,UAAU,CACX,CAAC;IACJ,CAAC;IAED,oCAAoC;IACpC,oCAAoC;IACpC,MAAM,cAAc,GAAG,MAAM,CAAC,WAAW;QACvC,CAAC,CAAC,GAAG,MAAM,CAAC,WAAW,wBAAwB,MAAM,CAAC,KAAK,UAAU,MAAM,CAAC,WAAW,EAAE;QACzF,CAAC,CAAC,MAAM,CAAC,WAAW,CAAC;IACvB,MAAM,CAAC,cAAc,CAAC,cAAc,CAAC,CAAC;IAEtC,qDAAqD;IACrD,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,gBAAgB,EAAE,CAAC;QACzC,IAAI,CAAC,MAAM,CAAC,gBAAgB,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC;YAC3D,MAAM,CAAC,mBAAmB,CAAC,EAAE,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,iDAAiD;IACjD,KAAK,MAAM,CAAC,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACpC,IAAI,CAAC,MAAM,CAAC,YAAY,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,KAAK,CAAC,CAAC,EAAE,CAAC,EAAE,CAAC;YACpD,MAAM,CAAC,cAAc,CAAC,CAAC,CAAC,CAAC;QAC3B,CAAC;IACH,CAAC;IAED,4CAA4C;IAC5C,KAAK,MAAM,IAAI,IAAI,MAAM,CAAC,aAAa,EAAE,CAAC;QACxC,MAAM,CAAC,cAAc,CAAC,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,6BAA6B;IAC7B,MAAM,QAAQ,GAAG,MAAM,CAAC,KAAK;QAC3B,CAAC,CAAC,GAAG,MAAM,CAAC,KAAK,0BAA0B,MAAM,CAAC,KAAK,OAAO,MAAM,CAAC,KAAK,EAAE;QAC5E,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC;IACjB,MAAM,CAAC,WAAW,CAAC,QAAQ,CAAC,CAAC;IAE7B,yBAAyB;IACzB,KAAK,MAAM,EAAE,IAAI,MAAM,CAAC,WAAW,EAAE,CAAC;QACpC,MAAM,CAAC,iBAAiB,CAAC,EAAE,CAAC,CAAC;IAC/B,CAAC;IAED,wEAAwE;IACxE,IAAI,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC;QACvC,MAAM,CAAC,aAAa,CAAC,QAAQ,CAAC,CAAC;IACjC,CAAC;IAED,2DAA2D;IAC3D,KAAK,MAAM,SAAS,IAAI,MAAM,CAAC,QAAQ,EAAE,CAAC;QACxC,IAAI,SAAS,KAAK,QAAQ,IAAI,CAAC,MAAM,CAAC,QAAQ,CAAC,QAAQ,CAAC,SAAS,CAAC,EAAE,CAAC;YACnE,MAAM,CAAC,UAAU,CAAC,SAAS,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;QACxB,IAAI,MAAM,CAAC,YAAY,EAAE,CAAC;YACxB,MAAM,CAAC,eAAe,CAAC,GAAG,MAAM,CAAC,YAAY,KAAK,MAAM,CAAC,YAAY,EAAE,CAAC,CAAC;QAC3E,CAAC;aAAM,CAAC;YACN,MAAM,CAAC,eAAe,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC;QAC9C,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,MAAM,gBAAgB,GAAa,EAAE,CAAC;IACtC,MAAM,gBAAgB,GAAa,EAAE,CAAC;IAEtC,yDAAyD;IACzD,MAAM,cAAc,GAAG,KAAK,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IACxD,uDAAuD;IACvD,MAAM,cAAc,GAAG,KAAK,CAAC,gBAAgB,CAAC,QAAQ,CAAC,CAAC;IAExD,0DAA0D;IAC1D,KAAK,MAAM,MAAM,IAAI,cAAc,EAAE,CAAC;QACpC,IAAI,MAAM,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,EAAE,CAAC;YAC5D,KAAK,CAAC,OAAO,CAAC,MAAM,EAAE,QAAQ,CAAC,CAAC;YAChC,gBAAgB,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QAChC,CAAC;IACH,CAAC;IAED,0DAA0D;IAC1D,KAAK,MAAM,IAAI,IAAI,cAAc,EAAE,CAAC;QAClC,IAAI,IAAI,KAAK,QAAQ,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,EAAE,CAAC;YACxD,KAAK,CAAC,OAAO,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YAC9B,gBAAgB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,uDAAuD;IACvD,KAAK,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAEzB,yBAAyB;IACzB,KAAK,CAAC,UAAU,CAAC,QAAQ,CAAC,CAAC;IAE3B,gCAAgC;IAChC,MAAM,WAAW,GAAG,IAAI,GAAG,CAAC;QAC1B,GAAG,gBAAgB;QACnB,GAAG,gBAAgB;QACnB,QAAQ;KACT,CAAC,CAAC;IAEH,OAAO;QACL,IAAI,EAAE,MAAM;QACZ,YAAY,EAAE,CAAC,QAAQ,CAAC;QACxB,YAAY,EAAE,KAAK,CAAC,IAAI,CAAC,WAAW,CAAC;KACtC,CAAC;AACJ,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,cAAc,CAAC,KAAqB,EAAE,MAAc;IAClE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,WAAW,GAAG,IAAI,GAAG,EAAU,CAAC;IACtC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;IAEvB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAE7B,IAAI,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC7B,SAAS;QACX,CAAC;QAED,WAAW,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAEzB,gCAAgC;QAChC,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QACjD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,IAAI,CAAC,WAAW,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAC5B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;YACpB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,WAAW,CAAC;AACrB,CAAC;AAED;;;;;;;;;;;;;;;;GAgBG;AACH,MAAM,UAAU,YAAY,CAAC,KAAqB,EAAE,MAAc;IAChE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IACpC,MAAM,KAAK,GAAG,CAAC,MAAM,CAAC,CAAC;IAEvB,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;QAE7B,IAAI,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;YAC3B,SAAS;QACX,CAAC;QAED,SAAS,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAEvB,+BAA+B;QAC/B,MAAM,OAAO,GAAG,KAAK,CAAC,gBAAgB,CAAC,OAAO,CAAC,CAAC;QAChD,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,IAAI,CAAC,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC;gBAC3B,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YACrB,CAAC;QACH,CAAC;IACH,CAAC;IAED,OAAO,SAAS,CAAC;AACnB,CAAC;AAED;;;;;;;;;;;;;;;;;;;;GAoBG;AACH,MAAM,UAAU,kBAAkB,CAChC,KAAqB,EACrB,aAAqB,EACrB,WAAmB;IAEnB,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,aAAa,CAAC,EAAE,CAAC;QAClC,MAAM,IAAI,iBAAiB,CAAC,aAAa,CAAC,CAAC;IAC7C,CAAC;IACD,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QAChC,MAAM,IAAI,iBAAiB,CAAC,WAAW,CAAC,CAAC;IAC3C,CAAC;IAED,8DAA8D;IAC9D,uEAAuE;IACvE,MAAM,WAAW,GAAG,cAAc,CAAC,KAAK,EAAE,aAAa,CAAC,CAAC;IACzD,OAAO,CAAC,WAAW,CAAC,GAAG,CAAC,WAAW,CAAC,CAAC;AACvC,CAAC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;GA8BG;AACH,MAAM,UAAU,aAAa,CAAC,KAAqB,EAAE,MAAc;IACjE,IAAI,CAAC,KAAK,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC;QAC3B,MAAM,IAAI,iBAAiB,CAAC,MAAM,CAAC,CAAC;IACtC,CAAC;IAED,MAAM,UAAU,GAAa,EAAE,CAAC;IAEhC,oEAAoE;IACpE,MAAM,WAAW,GAAG,cAAc,CAAC,KAAK,EAAE,MAAM,CAAC,CAAC;IAElD,+DAA+D;IAC/D,6DAA6D;IAC7D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,CAAC;IAEtC,gFAAgF;IAChF,OAAO,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;QACzB,IAAI,gBAAgB,GAAG,KAAK,CAAC;QAE7B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;YAC1B,8EAA8E;YAC9E,MAAM,QAAQ,GAAG,KAAK,CAAC,gBAAgB,CAAC,EAAE,CAAC,CAAC;YAC5C,MAAM,kBAAkB,GAAG,QAAQ,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;YAEvE,IAAI,CAAC,kBAAkB,EAAE,CAAC;gBACxB,qDAAqD;gBACrD,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBACrB,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;gBACpB,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC,CAAC;gBACpB,gBAAgB,GAAG,IAAI,CAAC;gBACxB,MAAM,CAAC,mCAAmC;YAC5C,CAAC;QACH,CAAC;QAED,wCAAwC;QACxC,IAAI,CAAC,gBAAgB,IAAI,QAAQ,CAAC,IAAI,GAAG,CAAC,EAAE,CAAC;YAC3C,8DAA8D;YAC9D,+BAA+B;YAC/B,KAAK,MAAM,EAAE,IAAI,QAAQ,EAAE,CAAC;gBAC1B,KAAK,CAAC,UAAU,CAAC,EAAE,CAAC,CAAC;gBACrB,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACtB,CAAC;YACD,MAAM;QACR,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC"}

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

@@ -0,0 +1,76 @@
+/**
+ * Graph topological sort algorithms
+ *
+ * Implements Kahn's algorithm for topological sorting with cycle detection.
+ * Time complexity: O(V + E) where V = vertices, E = edges
+ *
+ * @module core/graph/sort
+ */
+import type { TaskGraphStore } from './index.js';
+import type { TopologicalSortResult } from '../../types/index.js';
+/**
+ * Clear the topological sort cache
+ * Call this after modifying the graph structure
+ */
+export declare function clearSortCache(): void;
+/**
+ * Perform topological sort using Kahn's algorithm
+ *
+ * Algorithm steps:
+ * 1. Calculate in-degree for all nodes
+ * 2. Initialize queue with nodes having zero in-degree
+ * 3. Process queue: remove node, add to result, reduce neighbors' in-degree
+ * 4. Add any neighbors with zero in-degree to queue
+ * 5. Detect cycle if result doesn't contain all nodes
+ *
+ * Time Complexity: O(V + E)
+ * Space Complexity: O(V)
+ *
+ * @param graph - Task graph store
+ * @param useCache - Whether to use memoization cache (default: true)
+ * @returns Topological sort result with sorted order and cycle detection
+ *
+ * @example
+ * ```ts
+ * const result = topologicalSort(graph);
+ * if (result.hasCycle) {
+ *   console.error('Cycle detected:', result.cycleNodes);
+ * } else {
+ *   console.log('Execution order:', result.sorted);
+ * }
+ * ```
+ */
+export declare function topologicalSort(graph: TaskGraphStore, useCache?: boolean): TopologicalSortResult;
+/**
+ * Find the critical path (longest path) in the DAG
+ * Uses topological sort and dynamic programming
+ *
+ * Time Complexity: O(V + E)
+ *
+ * @param graph - Task graph store
+ * @param taskDuration - Duration for each task (default: 1)
+ * @returns Object with path array and total duration
+ * @throws {CircularDependencyError} If graph contains cycles
+ */
+export declare function findCriticalPath(graph: TaskGraphStore, taskDuration?: number | Map<string, number>): {
+    path: string[];
+    duration: number;
+};
+/**
+ * Validate that a graph is a valid DAG
+ * Convenience wrapper around topologicalSort
+ *
+ * @param graph - Task graph store
+ * @returns true if graph is a valid DAG, false otherwise
+ */
+export declare function isValidDAG(graph: TaskGraphStore): boolean;
+/**
+ * Get task execution levels (parallelizable stages)
+ * Tasks at the same level have no dependencies between them
+ *
+ * @param graph - Task graph store
+ * @returns Array of task ID arrays (each level is a parallelizable stage)
+ * @throws {CircularDependencyError} If graph contains cycles
+ */
+export declare function getExecutionLevels(graph: TaskGraphStore): string[][];
+//# sourceMappingURL=sort.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"sort.d.ts","sourceRoot":"","sources":["../../../src/core/graph/sort.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,KAAK,EAAE,qBAAqB,EAAE,MAAM,sBAAsB,CAAC;AAmBlE;;;GAGG;AACH,wBAAgB,cAAc,IAAI,IAAI,CAErC;AAED;;;;;;;;;;;;;;;;;;;;;;;;;;GA0BG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,cAAc,EAAE,QAAQ,UAAO,GAAG,qBAAqB,CAmB7F;AAiED;;;;;;;;;;GAUG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,cAAc,EACrB,YAAY,GAAE,MAAM,GAAG,GAAG,CAAC,MAAM,EAAE,MAAM,CAAK,GAC7C;IAAE,IAAI,EAAE,MAAM,EAAE,CAAC;IAAC,QAAQ,EAAE,MAAM,CAAA;CAAE,CAiEtC;AAED;;;;;;GAMG;AACH,wBAAgB,UAAU,CAAC,KAAK,EAAE,cAAc,GAAG,OAAO,CAGzD;AAED;;;;;;;GAOG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,EAAE,EAAE,CA8CpE"}