@diegonogueiradev_/mcp-graph 1.0.0

package/dist/core/planner/decompose.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Task decomposition: detects large tasks and suggests breakdown.
+ *
+ * A task is considered "large" if:
+ * - estimateMinutes > 120 (2 hours)
+ * - xpSize is L or XL
+ * - Has more than 5 acceptance criteria (complex scope)
+ */
+import type { GraphDocument, GraphNode } from "../graph/graph-types.js";
+export interface DecomposeResult {
+    node: GraphNode;
+    reasons: string[];
+    suggestedSubtasks: SuggestedSubtask[];
+}
+export interface SuggestedSubtask {
+    title: string;
+    estimateMinutes?: number;
+    xpSize: string;
+    basedOn: string;
+}
+/**
+ * Detect large tasks in the graph that should be decomposed.
+ */
+export declare function detectLargeTasks(doc: GraphDocument): DecomposeResult[];
+//# sourceMappingURL=decompose.d.ts.map

package/dist/core/planner/decompose.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"decompose.d.ts","sourceRoot":"","sources":["../../../src/core/planner/decompose.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAWxE,MAAM,WAAW,eAAe;IAC9B,IAAI,EAAE,SAAS,CAAC;IAChB,OAAO,EAAE,MAAM,EAAE,CAAC;IAClB,iBAAiB,EAAE,gBAAgB,EAAE,CAAC;CACvC;AAED,MAAM,WAAW,gBAAgB;IAC/B,KAAK,EAAE,MAAM,CAAC;IACd,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,MAAM,EAAE,MAAM,CAAC;IACf,OAAO,EAAE,MAAM,CAAC;CACjB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,aAAa,GAAG,eAAe,EAAE,CAqCtE"}

package/dist/core/planner/decompose.js

@@ -0,0 +1,100 @@
+/**
+ * Task decomposition: detects large tasks and suggests breakdown.
+ *
+ * A task is considered "large" if:
+ * - estimateMinutes > 120 (2 hours)
+ * - xpSize is L or XL
+ * - Has more than 5 acceptance criteria (complex scope)
+ */
+import { logger } from "../utils/logger.js";
+const XP_SIZE_ORDER = {
+    XS: 1, S: 2, M: 3, L: 4, XL: 5,
+};
+const ESTIMATE_THRESHOLD = 120; // minutes
+const AC_THRESHOLD = 5;
+const LARGE_XP_THRESHOLD = 4; // L=4, XL=5
+/**
+ * Detect large tasks in the graph that should be decomposed.
+ */
+export function detectLargeTasks(doc) {
+    const results = [];
+    const tasks = doc.nodes.filter((n) => (n.type === "task" || n.type === "subtask") && n.status !== "done");
+    for (const node of tasks) {
+        const reasons = [];
+        if (node.estimateMinutes && node.estimateMinutes > ESTIMATE_THRESHOLD) {
+            reasons.push(`estimate ${node.estimateMinutes}min > ${ESTIMATE_THRESHOLD}min threshold`);
+        }
+        const sizeOrder = XP_SIZE_ORDER[node.xpSize || "M"] ?? 3;
+        if (sizeOrder >= LARGE_XP_THRESHOLD) {
+            reasons.push(`XP size ${node.xpSize} is large`);
+        }
+        const acCount = node.acceptanceCriteria?.length ?? 0;
+        if (acCount > AC_THRESHOLD) {
+            reasons.push(`${acCount} acceptance criteria > ${AC_THRESHOLD} threshold`);
+        }
+        if (reasons.length === 0)
+            continue;
+        // Check if already decomposed (has children)
+        const hasChildren = doc.nodes.some((n) => n.parentId === node.id);
+        if (hasChildren)
+            continue;
+        const suggestedSubtasks = suggestDecomposition(node);
+        results.push({ node, reasons, suggestedSubtasks });
+    }
+    logger.info(`Decomposition: ${results.length} large tasks detected from ${tasks.length} total`);
+    return results;
+}
+/**
+ * Suggest subtask breakdown based on acceptance criteria and estimate.
+ */
+function suggestDecomposition(node) {
+    const subtasks = [];
+    const ac = node.acceptanceCriteria ?? [];
+    if (ac.length > 0) {
+        // Group acceptance criteria into subtasks (2-3 AC per subtask)
+        const chunkSize = Math.max(2, Math.ceil(ac.length / Math.ceil(ac.length / 3)));
+        for (let i = 0; i < ac.length; i += chunkSize) {
+            const chunk = ac.slice(i, i + chunkSize);
+            const title = chunk.length === 1
+                ? chunk[0]
+                : `${chunk[0].slice(0, 60)}${chunk.length > 1 ? ` (+${chunk.length - 1} criteria)` : ""}`;
+            const estPerSubtask = node.estimateMinutes
+                ? Math.ceil(node.estimateMinutes / Math.ceil(ac.length / chunkSize))
+                : undefined;
+            subtasks.push({
+                title,
+                estimateMinutes: estPerSubtask,
+                xpSize: estimateSubtaskSize(estPerSubtask),
+                basedOn: "acceptance_criteria",
+            });
+        }
+    }
+    else if (node.estimateMinutes && node.estimateMinutes > ESTIMATE_THRESHOLD) {
+        // No AC — split by time estimate
+        const numParts = Math.ceil(node.estimateMinutes / 60);
+        const estPerPart = Math.ceil(node.estimateMinutes / numParts);
+        for (let i = 0; i < numParts; i++) {
+            subtasks.push({
+                title: `${node.title} — part ${i + 1}/${numParts}`,
+                estimateMinutes: estPerPart,
+                xpSize: estimateSubtaskSize(estPerPart),
+                basedOn: "time_split",
+            });
+        }
+    }
+    return subtasks;
+}
+function estimateSubtaskSize(minutes) {
+    if (!minutes)
+        return "S";
+    if (minutes <= 15)
+        return "XS";
+    if (minutes <= 30)
+        return "S";
+    if (minutes <= 60)
+        return "M";
+    if (minutes <= 120)
+        return "L";
+    return "XL";
+}
+//# sourceMappingURL=decompose.js.map

package/dist/core/planner/decompose.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"decompose.js","sourceRoot":"","sources":["../../../src/core/planner/decompose.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAE5C,MAAM,aAAa,GAA2B;IAC5C,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;CAC/B,CAAC;AAEF,MAAM,kBAAkB,GAAG,GAAG,CAAC,CAAC,UAAU;AAC1C,MAAM,YAAY,GAAG,CAAC,CAAC;AACvB,MAAM,kBAAkB,GAAG,CAAC,CAAC,CAAC,YAAY;AAe1C;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAkB;IACjD,MAAM,OAAO,GAAsB,EAAE,CAAC;IAEtC,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAC5B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,CAC1E,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,OAAO,GAAa,EAAE,CAAC;QAE7B,IAAI,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,eAAe,GAAG,kBAAkB,EAAE,CAAC;YACtE,OAAO,CAAC,IAAI,CAAC,YAAY,IAAI,CAAC,eAAe,SAAS,kBAAkB,eAAe,CAAC,CAAC;QAC3F,CAAC;QAED,MAAM,SAAS,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;QACzD,IAAI,SAAS,IAAI,kBAAkB,EAAE,CAAC;YACpC,OAAO,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,MAAM,WAAW,CAAC,CAAC;QAClD,CAAC;QAED,MAAM,OAAO,GAAG,IAAI,CAAC,kBAAkB,EAAE,MAAM,IAAI,CAAC,CAAC;QACrD,IAAI,OAAO,GAAG,YAAY,EAAE,CAAC;YAC3B,OAAO,CAAC,IAAI,CAAC,GAAG,OAAO,0BAA0B,YAAY,YAAY,CAAC,CAAC;QAC7E,CAAC;QAED,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC;YAAE,SAAS;QAEnC,6CAA6C;QAC7C,MAAM,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC;QAClE,IAAI,WAAW;YAAE,SAAS;QAE1B,MAAM,iBAAiB,GAAG,oBAAoB,CAAC,IAAI,CAAC,CAAC;QAErD,OAAO,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,iBAAiB,EAAE,CAAC,CAAC;IACrD,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,kBAAkB,OAAO,CAAC,MAAM,8BAA8B,KAAK,CAAC,MAAM,QAAQ,CAAC,CAAC;IAChG,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;GAEG;AACH,SAAS,oBAAoB,CAAC,IAAe;IAC3C,MAAM,QAAQ,GAAuB,EAAE,CAAC;IACxC,MAAM,EAAE,GAAG,IAAI,CAAC,kBAAkB,IAAI,EAAE,CAAC;IAEzC,IAAI,EAAE,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAClB,+DAA+D;QAC/D,MAAM,SAAS,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAE/E,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,EAAE,CAAC,MAAM,EAAE,CAAC,IAAI,SAAS,EAAE,CAAC;YAC9C,MAAM,KAAK,GAAG,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,CAAC;YACzC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,KAAK,CAAC;gBAC9B,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC;gBACV,CAAC,CAAC,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,MAAM,KAAK,CAAC,MAAM,GAAG,CAAC,YAAY,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC;YAE5F,MAAM,aAAa,GAAG,IAAI,CAAC,eAAe;gBACxC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,GAAG,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,MAAM,GAAG,SAAS,CAAC,CAAC;gBACpE,CAAC,CAAC,SAAS,CAAC;YAEd,QAAQ,CAAC,IAAI,CAAC;gBACZ,KAAK;gBACL,eAAe,EAAE,aAAa;gBAC9B,MAAM,EAAE,mBAAmB,CAAC,aAAa,CAAC;gBAC1C,OAAO,EAAE,qBAAqB;aAC/B,CAAC,CAAC;QACL,CAAC;IACH,CAAC;SAAM,IAAI,IAAI,CAAC,eAAe,IAAI,IAAI,CAAC,eAAe,GAAG,kBAAkB,EAAE,CAAC;QAC7E,iCAAiC;QACjC,MAAM,QAAQ,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,GAAG,EAAE,CAAC,CAAC;QACtD,MAAM,UAAU,GAAG,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,eAAe,GAAG,QAAQ,CAAC,CAAC;QAE9D,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,QAAQ,EAAE,CAAC,EAAE,EAAE,CAAC;YAClC,QAAQ,CAAC,IAAI,CAAC;gBACZ,KAAK,EAAE,GAAG,IAAI,CAAC,KAAK,WAAW,CAAC,GAAG,CAAC,IAAI,QAAQ,EAAE;gBAClD,eAAe,EAAE,UAAU;gBAC3B,MAAM,EAAE,mBAAmB,CAAC,UAAU,CAAC;gBACvC,OAAO,EAAE,YAAY;aACtB,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,mBAAmB,CAAC,OAAgB;IAC3C,IAAI,CAAC,OAAO;QAAE,OAAO,GAAG,CAAC;IACzB,IAAI,OAAO,IAAI,EAAE;QAAE,OAAO,IAAI,CAAC;IAC/B,IAAI,OAAO,IAAI,EAAE;QAAE,OAAO,GAAG,CAAC;IAC9B,IAAI,OAAO,IAAI,EAAE;QAAE,OAAO,GAAG,CAAC;IAC9B,IAAI,OAAO,IAAI,GAAG;QAAE,OAAO,GAAG,CAAC;IAC/B,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/core/planner/dependency-chain.d.ts

@@ -0,0 +1,20 @@
+/**
+ * Dependency chain analysis: transitive blockers, cycle detection, critical path.
+ */
+import type { GraphDocument, GraphNode } from "../graph/graph-types.js";
+/**
+ * Find all transitive blockers for a given node.
+ * Follows depends_on edges backwards and blocks edges forwards.
+ */
+export declare function findTransitiveBlockers(doc: GraphDocument, nodeId: string): GraphNode[];
+/**
+ * Detect cycles in the dependency graph using DFS.
+ * Only considers depends_on and blocks edges.
+ */
+export declare function detectCycles(doc: GraphDocument): string[][];
+/**
+ * Find the critical path (longest path by estimateMinutes) through depends_on edges.
+ * Uses topological sort on the dependency DAG.
+ */
+export declare function findCriticalPath(doc: GraphDocument): GraphNode[];
+//# sourceMappingURL=dependency-chain.d.ts.map

package/dist/core/planner/dependency-chain.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-chain.d.ts","sourceRoot":"","sources":["../../../src/core/planner/dependency-chain.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAGxE;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,GAAG,EAAE,aAAa,EAAE,MAAM,EAAE,MAAM,GAAG,SAAS,EAAE,CA+BtF;AAED;;;GAGG;AACH,wBAAgB,YAAY,CAAC,GAAG,EAAE,aAAa,GAAG,MAAM,EAAE,EAAE,CAgD3D;AAED;;;GAGG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,aAAa,GAAG,SAAS,EAAE,CAmFhE"}

package/dist/core/planner/dependency-chain.js

@@ -0,0 +1,163 @@
+/**
+ * Dependency chain analysis: transitive blockers, cycle detection, critical path.
+ */
+import { logger } from "../utils/logger.js";
+/**
+ * Find all transitive blockers for a given node.
+ * Follows depends_on edges backwards and blocks edges forwards.
+ */
+export function findTransitiveBlockers(doc, nodeId) {
+    const visited = new Set();
+    const queue = [nodeId];
+    visited.add(nodeId);
+    const blockers = [];
+    const nodeMap = new Map(doc.nodes.map((n) => [n.id, n]));
+    while (queue.length > 0) {
+        const current = queue.shift();
+        for (const edge of doc.edges) {
+            let blockerId = null;
+            // "from depends_on to" means to is a blocker of from
+            if (edge.from === current && edge.relationType === "depends_on") {
+                blockerId = edge.to;
+            }
+            else if (edge.to === current && edge.relationType === "blocks") {
+                blockerId = edge.from;
+            }
+            if (blockerId && !visited.has(blockerId)) {
+                visited.add(blockerId);
+                queue.push(blockerId);
+                const node = nodeMap.get(blockerId);
+                if (node)
+                    blockers.push(node);
+            }
+        }
+    }
+    logger.info(`Transitive blockers for ${nodeId}: ${blockers.length} found`);
+    return blockers;
+}
+/**
+ * Detect cycles in the dependency graph using DFS.
+ * Only considers depends_on and blocks edges.
+ */
+export function detectCycles(doc) {
+    const adj = new Map();
+    for (const edge of doc.edges) {
+        if (edge.relationType === "depends_on") {
+            // from depends_on to → dependency direction: from → to
+            const list = adj.get(edge.from) ?? [];
+            list.push(edge.to);
+            adj.set(edge.from, list);
+        }
+        else if (edge.relationType === "blocks") {
+            // from blocks to → dependency direction: to → from
+            const list = adj.get(edge.to) ?? [];
+            list.push(edge.from);
+            adj.set(edge.to, list);
+        }
+    }
+    const allNodes = new Set(doc.nodes.map((n) => n.id));
+    const visited = new Set();
+    const inStack = new Set();
+    const cycles = [];
+    function dfs(node, path) {
+        visited.add(node);
+        inStack.add(node);
+        path.push(node);
+        for (const neighbor of adj.get(node) ?? []) {
+            if (inStack.has(neighbor)) {
+                const cycleStart = path.indexOf(neighbor);
+                cycles.push([...path.slice(cycleStart), neighbor]);
+            }
+            else if (!visited.has(neighbor)) {
+                dfs(neighbor, path);
+            }
+        }
+        path.pop();
+        inStack.delete(node);
+    }
+    for (const node of allNodes) {
+        if (!visited.has(node)) {
+            dfs(node, []);
+        }
+    }
+    logger.info(`Cycle detection: ${cycles.length} cycles found`);
+    return cycles;
+}
+/**
+ * Find the critical path (longest path by estimateMinutes) through depends_on edges.
+ * Uses topological sort on the dependency DAG.
+ */
+export function findCriticalPath(doc) {
+    const DEFAULT_ESTIMATE = 60;
+    const nodeMap = new Map(doc.nodes.map((n) => [n.id, n]));
+    // Build adjacency list for depends_on edges (from depends on to → to must finish before from)
+    // Direction: dependency edges point from dependent to prerequisite
+    // We want longest path, so build forward graph: prerequisite → dependent
+    const forward = new Map();
+    const inDegree = new Map();
+    for (const node of doc.nodes) {
+        forward.set(node.id, []);
+        inDegree.set(node.id, 0);
+    }
+    for (const edge of doc.edges) {
+        if (edge.relationType === "depends_on") {
+            // edge.from depends_on edge.to → edge.to is prerequisite
+            const list = forward.get(edge.to) ?? [];
+            list.push(edge.from);
+            forward.set(edge.to, list);
+            inDegree.set(edge.from, (inDegree.get(edge.from) ?? 0) + 1);
+        }
+    }
+    // Topological sort (Kahn's algorithm) + longest path
+    const dist = new Map();
+    const prev = new Map();
+    const queue = [];
+    for (const node of doc.nodes) {
+        const est = node.estimateMinutes ?? DEFAULT_ESTIMATE;
+        dist.set(node.id, est);
+        prev.set(node.id, null);
+        if ((inDegree.get(node.id) ?? 0) === 0) {
+            queue.push(node.id);
+        }
+    }
+    while (queue.length > 0) {
+        const current = queue.shift();
+        const currentDist = dist.get(current) ?? 0;
+        for (const neighbor of forward.get(current) ?? []) {
+            const neighborEst = nodeMap.get(neighbor)?.estimateMinutes ?? DEFAULT_ESTIMATE;
+            const newDist = currentDist + neighborEst;
+            if (newDist > (dist.get(neighbor) ?? 0)) {
+                dist.set(neighbor, newDist);
+                prev.set(neighbor, current);
+            }
+            const deg = (inDegree.get(neighbor) ?? 1) - 1;
+            inDegree.set(neighbor, deg);
+            if (deg === 0) {
+                queue.push(neighbor);
+            }
+        }
+    }
+    // Find the node with maximum distance
+    let maxNode = null;
+    let maxDist = 0;
+    for (const [id, d] of dist) {
+        if (d > maxDist) {
+            maxDist = d;
+            maxNode = id;
+        }
+    }
+    if (!maxNode)
+        return [];
+    // Reconstruct path
+    const path = [];
+    let current = maxNode;
+    while (current) {
+        const node = nodeMap.get(current);
+        if (node)
+            path.unshift(node);
+        current = prev.get(current) ?? null;
+    }
+    logger.info(`Critical path: ${path.length} nodes, ${maxDist} total minutes`);
+    return path;
+}
+//# sourceMappingURL=dependency-chain.js.map

package/dist/core/planner/dependency-chain.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"dependency-chain.js","sourceRoot":"","sources":["../../../src/core/planner/dependency-chain.ts"],"names":[],"mappings":"AAAA;;GAEG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAE5C;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,GAAkB,EAAE,MAAc;IACvE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,KAAK,GAAa,CAAC,MAAM,CAAC,CAAC;IACjC,OAAO,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;IACpB,MAAM,QAAQ,GAAgB,EAAE,CAAC;IACjC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzD,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAE/B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;YAC7B,IAAI,SAAS,GAAkB,IAAI,CAAC;YAEpC,qDAAqD;YACrD,IAAI,IAAI,CAAC,IAAI,KAAK,OAAO,IAAI,IAAI,CAAC,YAAY,KAAK,YAAY,EAAE,CAAC;gBAChE,SAAS,GAAG,IAAI,CAAC,EAAE,CAAC;YACtB,CAAC;iBAAM,IAAI,IAAI,CAAC,EAAE,KAAK,OAAO,IAAI,IAAI,CAAC,YAAY,KAAK,QAAQ,EAAE,CAAC;gBACjE,SAAS,GAAG,IAAI,CAAC,IAAI,CAAC;YACxB,CAAC;YAED,IAAI,SAAS,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,EAAE,CAAC;gBACzC,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACvB,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;gBACtB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC;gBACpC,IAAI,IAAI;oBAAE,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YAChC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,2BAA2B,MAAM,KAAK,QAAQ,CAAC,MAAM,QAAQ,CAAC,CAAC;IAC3E,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,YAAY,CAAC,GAAkB;IAC7C,MAAM,GAAG,GAAG,IAAI,GAAG,EAAoB,CAAC;IAExC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,YAAY,KAAK,YAAY,EAAE,CAAC;YACvC,uDAAuD;YACvD,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;YACtC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACnB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,IAAI,CAAC,CAAC;QAC3B,CAAC;aAAM,IAAI,IAAI,CAAC,YAAY,KAAK,QAAQ,EAAE,CAAC;YAC1C,mDAAmD;YACnD,MAAM,IAAI,GAAG,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YACpC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAS,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAC7D,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,MAAM,GAAe,EAAE,CAAC;IAE9B,SAAS,GAAG,CAAC,IAAY,EAAE,IAAc;QACvC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,CAAC;QAClB,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEhB,KAAK,MAAM,QAAQ,IAAI,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;YAC3C,IAAI,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAC1B,MAAM,UAAU,GAAG,IAAI,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;gBAC1C,MAAM,CAAC,IAAI,CAAC,CAAC,GAAG,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,EAAE,QAAQ,CAAC,CAAC,CAAC;YACrD,CAAC;iBAAM,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,CAAC;gBAClC,GAAG,CAAC,QAAQ,EAAE,IAAI,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;QAED,IAAI,CAAC,GAAG,EAAE,CAAC;QACX,OAAO,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACvB,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YACvB,GAAG,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAChB,CAAC;IACH,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,oBAAoB,MAAM,CAAC,MAAM,eAAe,CAAC,CAAC;IAC9D,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAkB;IACjD,MAAM,gBAAgB,GAAG,EAAE,CAAC;IAC5B,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAEzD,8FAA8F;IAC9F,mEAAmE;IACnE,yEAAyE;IACzE,MAAM,OAAO,GAAG,IAAI,GAAG,EAAoB,CAAC;IAC5C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAE3C,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC;QACzB,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAC3B,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,YAAY,KAAK,YAAY,EAAE,CAAC;YACvC,yDAAyD;YACzD,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;YACxC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;YAC3B,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;QAC9D,CAAC;IACH,CAAC;IAED,qDAAqD;IACrD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAyB,CAAC;IAC9C,MAAM,KAAK,GAAa,EAAE,CAAC;IAE3B,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,MAAM,GAAG,GAAG,IAAI,CAAC,eAAe,IAAI,gBAAgB,CAAC;QACrD,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,GAAG,CAAC,CAAC;QACvB,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,IAAI,CAAC,CAAC;QACxB,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACtB,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,OAAO,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC/B,MAAM,WAAW,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAE3C,KAAK,MAAM,QAAQ,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC;YAClD,MAAM,WAAW,GAAG,OAAO,CAAC,GAAG,CAAC,QAAQ,CAAC,EAAE,eAAe,IAAI,gBAAgB,CAAC;YAC/E,MAAM,OAAO,GAAG,WAAW,GAAG,WAAW,CAAC;YAE1C,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBACxC,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;gBAC5B,IAAI,CAAC,GAAG,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAC;YAC9B,CAAC;YAED,MAAM,GAAG,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC9C,QAAQ,CAAC,GAAG,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAC;YAC5B,IAAI,GAAG,KAAK,CAAC,EAAE,CAAC;gBACd,KAAK,CAAC,IAAI,CAAC,QAAQ,CAAC,CAAC;YACvB,CAAC;QACH,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,IAAI,OAAO,GAAkB,IAAI,CAAC;IAClC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;QAC3B,IAAI,CAAC,GAAG,OAAO,EAAE,CAAC;YAChB,OAAO,GAAG,CAAC,CAAC;YACZ,OAAO,GAAG,EAAE,CAAC;QACf,CAAC;IACH,CAAC;IAED,IAAI,CAAC,OAAO;QAAE,OAAO,EAAE,CAAC;IAExB,mBAAmB;IACnB,MAAM,IAAI,GAAgB,EAAE,CAAC;IAC7B,IAAI,OAAO,GAAkB,OAAO,CAAC;IACrC,OAAO,OAAO,EAAE,CAAC;QACf,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,OAAO,CAAC,CAAC;QAClC,IAAI,IAAI;YAAE,IAAI,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAC7B,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,IAAI,IAAI,CAAC;IACtC,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,kBAAkB,IAAI,CAAC,MAAM,WAAW,OAAO,gBAAgB,CAAC,CAAC;IAC7E,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/core/planner/next-task.d.ts

@@ -0,0 +1,16 @@
+/**
+ * Execution planner: suggests the next best task to work on.
+ *
+ * Algorithm:
+ * 1. Filter nodes of type task/subtask with status backlog or ready
+ * 2. Eliminate nodes with unresolved depends_on edges (dependency target not done)
+ * 3. Eliminate nodes with blocked = true
+ * 4. Sort by: priority ASC, xpSize ASC, estimateMinutes ASC, createdAt ASC
+ */
+import type { GraphDocument, GraphNode } from "../graph/graph-types.js";
+export interface NextTaskResult {
+    node: GraphNode;
+    reason: string;
+}
+export declare function findNextTask(doc: GraphDocument): NextTaskResult | null;
+//# sourceMappingURL=next-task.d.ts.map

package/dist/core/planner/next-task.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"next-task.d.ts","sourceRoot":"","sources":["../../../src/core/planner/next-task.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAE,SAAS,EAAU,MAAM,yBAAyB,CAAC;AAOhF,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,SAAS,CAAC;IAChB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,wBAAgB,YAAY,CAAC,GAAG,EAAE,aAAa,GAAG,cAAc,GAAG,IAAI,CA0EtE"}

package/dist/core/planner/next-task.js

@@ -0,0 +1,76 @@
+/**
+ * Execution planner: suggests the next best task to work on.
+ *
+ * Algorithm:
+ * 1. Filter nodes of type task/subtask with status backlog or ready
+ * 2. Eliminate nodes with unresolved depends_on edges (dependency target not done)
+ * 3. Eliminate nodes with blocked = true
+ * 4. Sort by: priority ASC, xpSize ASC, estimateMinutes ASC, createdAt ASC
+ */
+import { logger } from "../utils/logger.js";
+const XP_SIZE_ORDER = {
+    XS: 1, S: 2, M: 3, L: 4, XL: 5,
+};
+export function findNextTask(doc) {
+    // Step 1: Filter eligible nodes
+    const eligible = doc.nodes.filter((n) => (n.type === "task" || n.type === "subtask") &&
+        (n.status === "backlog" || n.status === "ready") &&
+        !n.blocked);
+    logger.info(`Next task: ${eligible.length} eligible from ${doc.nodes.length} total`);
+    if (eligible.length === 0)
+        return null;
+    // Step 2: Build a set of done node IDs for dependency checking
+    const doneIds = new Set(doc.nodes.filter((n) => n.status === "done").map((n) => n.id));
+    // Step 3: Find depends_on edges and filter out nodes with unresolved deps
+    const unblocked = eligible.filter((node) => {
+        const depsEdges = doc.edges.filter((e) => e.from === node.id && e.relationType === "depends_on");
+        // All dependency targets must be done
+        return depsEdges.every((e) => doneIds.has(e.to));
+    });
+    if (unblocked.length === 0) {
+        // All eligible tasks have unresolved dependencies — return the one with fewest deps
+        const withDepCount = eligible.map((node) => {
+            const deps = doc.edges.filter((e) => e.from === node.id && e.relationType === "depends_on" && !doneIds.has(e.to));
+            return { node, pendingDeps: deps.length };
+        });
+        withDepCount.sort((a, b) => a.pendingDeps - b.pendingDeps);
+        return {
+            node: withDepCount[0].node,
+            reason: `Todas as tasks têm dependências pendentes. Esta tem menos (${withDepCount[0].pendingDeps}).`,
+        };
+    }
+    // Step 4: Sort
+    unblocked.sort((a, b) => {
+        // Priority ASC (1 = critical, 5 = optional)
+        if (a.priority !== b.priority)
+            return a.priority - b.priority;
+        // XP size ASC
+        const sizeA = XP_SIZE_ORDER[a.xpSize || "M"] ?? 3;
+        const sizeB = XP_SIZE_ORDER[b.xpSize || "M"] ?? 3;
+        if (sizeA !== sizeB)
+            return sizeA - sizeB;
+        // Estimate ASC
+        const estA = a.estimateMinutes ?? 999;
+        const estB = b.estimateMinutes ?? 999;
+        if (estA !== estB)
+            return estA - estB;
+        // Prefer tasks with more acceptance criteria (clearer definition)
+        const acA = a.acceptanceCriteria?.length ?? 0;
+        const acB = b.acceptanceCriteria?.length ?? 0;
+        if (acA !== acB)
+            return acB - acA;
+        // CreatedAt ASC (older first)
+        return a.createdAt.localeCompare(b.createdAt);
+    });
+    const best = unblocked[0];
+    const reasons = ["desbloqueada"];
+    if (best.priority <= 2)
+        reasons.push("alta prioridade");
+    if (best.xpSize && XP_SIZE_ORDER[best.xpSize] <= 2)
+        reasons.push("baixa complexidade");
+    return {
+        node: best,
+        reason: reasons.join(", "),
+    };
+}
+//# sourceMappingURL=next-task.js.map

package/dist/core/planner/next-task.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"next-task.js","sourceRoot":"","sources":["../../../src/core/planner/next-task.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAE5C,MAAM,aAAa,GAA2B;IAC5C,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;CAC/B,CAAC;AAOF,MAAM,UAAU,YAAY,CAAC,GAAkB;IAC7C,gCAAgC;IAChC,MAAM,QAAQ,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAC/B,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC;QAC3C,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,OAAO,CAAC;QAChD,CAAC,CAAC,CAAC,OAAO,CACb,CAAC;IAEF,MAAM,CAAC,IAAI,CAAC,cAAc,QAAQ,CAAC,MAAM,kBAAkB,GAAG,CAAC,KAAK,CAAC,MAAM,QAAQ,CAAC,CAAC;IACrF,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEvC,+DAA+D;IAC/D,MAAM,OAAO,GAAG,IAAI,GAAG,CACrB,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAC9D,CAAC;IAEF,0EAA0E;IAC1E,MAAM,SAAS,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QACzC,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,YAAY,KAAK,YAAY,CAC7D,CAAC;QACF,sCAAsC;QACtC,OAAO,SAAS,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IACnD,CAAC,CAAC,CAAC;IAEH,IAAI,SAAS,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC3B,oFAAoF;QACpF,MAAM,YAAY,GAAG,QAAQ,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;YACzC,MAAM,IAAI,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAC3B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,YAAY,KAAK,YAAY,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CACnF,CAAC;YACF,OAAO,EAAE,IAAI,EAAE,WAAW,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC;QAC5C,CAAC,CAAC,CAAC;QACH,YAAY,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,GAAG,CAAC,CAAC,WAAW,CAAC,CAAC;QAC3D,OAAO;YACL,IAAI,EAAE,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI;YAC1B,MAAM,EAAE,8DAA8D,YAAY,CAAC,CAAC,CAAC,CAAC,WAAW,IAAI;SACtG,CAAC;IACJ,CAAC;IAED,eAAe;IACf,SAAS,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACtB,4CAA4C;QAC5C,IAAI,CAAC,CAAC,QAAQ,KAAK,CAAC,CAAC,QAAQ;YAAE,OAAO,CAAC,CAAC,QAAQ,GAAG,CAAC,CAAC,QAAQ,CAAC;QAE9D,cAAc;QACd,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;QAClD,MAAM,KAAK,GAAG,aAAa,CAAC,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;QAClD,IAAI,KAAK,KAAK,KAAK;YAAE,OAAO,KAAK,GAAG,KAAK,CAAC;QAE1C,eAAe;QACf,MAAM,IAAI,GAAG,CAAC,CAAC,eAAe,IAAI,GAAG,CAAC;QACtC,MAAM,IAAI,GAAG,CAAC,CAAC,eAAe,IAAI,GAAG,CAAC;QACtC,IAAI,IAAI,KAAK,IAAI;YAAE,OAAO,IAAI,GAAG,IAAI,CAAC;QAEtC,kEAAkE;QAClE,MAAM,GAAG,GAAG,CAAC,CAAC,kBAAkB,EAAE,MAAM,IAAI,CAAC,CAAC;QAC9C,MAAM,GAAG,GAAG,CAAC,CAAC,kBAAkB,EAAE,MAAM,IAAI,CAAC,CAAC;QAC9C,IAAI,GAAG,KAAK,GAAG;YAAE,OAAO,GAAG,GAAG,GAAG,CAAC;QAElC,8BAA8B;QAC9B,OAAO,CAAC,CAAC,SAAS,CAAC,aAAa,CAAC,CAAC,CAAC,SAAS,CAAC,CAAC;IAChD,CAAC,CAAC,CAAC;IAEH,MAAM,IAAI,GAAG,SAAS,CAAC,CAAC,CAAC,CAAC;IAC1B,MAAM,OAAO,GAAa,CAAC,cAAc,CAAC,CAAC;IAC3C,IAAI,IAAI,CAAC,QAAQ,IAAI,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,iBAAiB,CAAC,CAAC;IACxD,IAAI,IAAI,CAAC,MAAM,IAAI,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC;QAAE,OAAO,CAAC,IAAI,CAAC,oBAAoB,CAAC,CAAC;IAEvF,OAAO;QACL,IAAI,EAAE,IAAI;QACV,MAAM,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;KAC3B,CAAC;AACJ,CAAC"}

package/dist/core/planner/velocity.d.ts

@@ -0,0 +1,38 @@
+/**
+ * Velocity tracking: measures sprint completion metrics.
+ *
+ * Computes:
+ * - Tasks completed per sprint
+ * - Average XP size completed
+ * - Estimated completion time (based on created→done timestamps)
+ */
+import type { GraphDocument } from "../graph/graph-types.js";
+export interface SprintVelocity {
+    sprint: string;
+    tasksCompleted: number;
+    totalPoints: number;
+    avgPointsPerTask: number;
+    avgCompletionHours: number | null;
+    tasks: VelocityTask[];
+}
+export interface VelocityTask {
+    id: string;
+    title: string;
+    xpSize: string;
+    points: number;
+    completionHours: number | null;
+}
+export interface VelocitySummary {
+    sprints: SprintVelocity[];
+    overall: {
+        totalTasksCompleted: number;
+        totalPoints: number;
+        avgPointsPerSprint: number;
+        avgCompletionHours: number | null;
+    };
+}
+/**
+ * Calculate velocity metrics for all sprints in the graph.
+ */
+export declare function calculateVelocity(doc: GraphDocument): VelocitySummary;
+//# sourceMappingURL=velocity.d.ts.map

package/dist/core/planner/velocity.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"velocity.d.ts","sourceRoot":"","sources":["../../../src/core/planner/velocity.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAa,MAAM,yBAAyB,CAAC;AAOxE,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,gBAAgB,EAAE,MAAM,CAAC;IACzB,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;IAClC,KAAK,EAAE,YAAY,EAAE,CAAC;CACvB;AAED,MAAM,WAAW,YAAY;IAC3B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,MAAM,EAAE,MAAM,CAAC;IACf,eAAe,EAAE,MAAM,GAAG,IAAI,CAAC;CAChC;AAED,MAAM,WAAW,eAAe;IAC9B,OAAO,EAAE,cAAc,EAAE,CAAC;IAC1B,OAAO,EAAE;QACP,mBAAmB,EAAE,MAAM,CAAC;QAC5B,WAAW,EAAE,MAAM,CAAC;QACpB,kBAAkB,EAAE,MAAM,CAAC;QAC3B,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;KACnC,CAAC;CACH;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,aAAa,GAAG,eAAe,CAwErE"}

package/dist/core/planner/velocity.js

@@ -0,0 +1,92 @@
+/**
+ * Velocity tracking: measures sprint completion metrics.
+ *
+ * Computes:
+ * - Tasks completed per sprint
+ * - Average XP size completed
+ * - Estimated completion time (based on created→done timestamps)
+ */
+import { logger } from "../utils/logger.js";
+const XP_SIZE_POINTS = {
+    XS: 1, S: 2, M: 3, L: 5, XL: 8,
+};
+/**
+ * Calculate velocity metrics for all sprints in the graph.
+ */
+export function calculateVelocity(doc) {
+    // Group done tasks by sprint
+    const doneTasks = doc.nodes.filter((n) => n.status === "done" && (n.type === "task" || n.type === "subtask"));
+    const bySprint = new Map();
+    for (const node of doneTasks) {
+        const sprint = node.sprint ?? "(no sprint)";
+        const group = bySprint.get(sprint) ?? [];
+        group.push(node);
+        bySprint.set(sprint, group);
+    }
+    const sprints = [];
+    for (const [sprint, tasks] of bySprint) {
+        const velocityTasks = tasks.map((t) => {
+            const points = XP_SIZE_POINTS[t.xpSize ?? "M"] ?? 3;
+            const completionHours = computeCompletionHours(t);
+            return {
+                id: t.id,
+                title: t.title,
+                xpSize: t.xpSize ?? "M",
+                points,
+                completionHours,
+            };
+        });
+        const totalPoints = velocityTasks.reduce((sum, t) => sum + t.points, 0);
+        const hoursValues = velocityTasks
+            .map((t) => t.completionHours)
+            .filter((h) => h !== null);
+        sprints.push({
+            sprint,
+            tasksCompleted: tasks.length,
+            totalPoints,
+            avgPointsPerTask: tasks.length > 0 ? Math.round((totalPoints / tasks.length) * 10) / 10 : 0,
+            avgCompletionHours: hoursValues.length > 0
+                ? Math.round((hoursValues.reduce((a, b) => a + b, 0) / hoursValues.length) * 10) / 10
+                : null,
+            tasks: velocityTasks,
+        });
+    }
+    // Sort sprints by name
+    sprints.sort((a, b) => a.sprint.localeCompare(b.sprint));
+    const totalTasksCompleted = doneTasks.length;
+    const totalPoints = sprints.reduce((sum, s) => sum + s.totalPoints, 0);
+    const sprintCount = sprints.filter((s) => s.sprint !== "(no sprint)").length || 1;
+    const allHours = sprints
+        .flatMap((s) => s.tasks)
+        .map((t) => t.completionHours)
+        .filter((h) => h !== null);
+    logger.info(`Velocity: ${totalTasksCompleted} tasks done, ${totalPoints} points across ${sprints.length} sprints`);
+    return {
+        sprints,
+        overall: {
+            totalTasksCompleted,
+            totalPoints,
+            avgPointsPerSprint: Math.round((totalPoints / sprintCount) * 10) / 10,
+            avgCompletionHours: allHours.length > 0
+                ? Math.round((allHours.reduce((a, b) => a + b, 0) / allHours.length) * 10) / 10
+                : null,
+        },
+    };
+}
+/**
+ * Estimate completion time in hours from createdAt to updatedAt.
+ * Returns null if timestamps are invalid or equal.
+ */
+function computeCompletionHours(node) {
+    try {
+        const created = new Date(node.createdAt).getTime();
+        const updated = new Date(node.updatedAt).getTime();
+        if (isNaN(created) || isNaN(updated) || updated <= created)
+            return null;
+        return Math.round(((updated - created) / (1000 * 60 * 60)) * 10) / 10;
+    }
+    catch {
+        return null;
+    }
+}
+//# sourceMappingURL=velocity.js.map

package/dist/core/planner/velocity.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"velocity.js","sourceRoot":"","sources":["../../../src/core/planner/velocity.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAGH,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAE5C,MAAM,cAAc,GAA2B;IAC7C,EAAE,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;CAC/B,CAAC;AA6BF;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAkB;IAClD,6BAA6B;IAC7B,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAChC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAC1E,CAAC;IAEF,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAuB,CAAC;IAEhD,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,aAAa,CAAC;QAC5C,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACzC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACjB,QAAQ,CAAC,GAAG,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,OAAO,GAAqB,EAAE,CAAC;IAErC,KAAK,MAAM,CAAC,MAAM,EAAE,KAAK,CAAC,IAAI,QAAQ,EAAE,CAAC;QACvC,MAAM,aAAa,GAAmB,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE;YACpD,MAAM,MAAM,GAAG,cAAc,CAAC,CAAC,CAAC,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;YACpD,MAAM,eAAe,GAAG,sBAAsB,CAAC,CAAC,CAAC,CAAC;YAClD,OAAO;gBACL,EAAE,EAAE,CAAC,CAAC,EAAE;gBACR,KAAK,EAAE,CAAC,CAAC,KAAK;gBACd,MAAM,EAAE,CAAC,CAAC,MAAM,IAAI,GAAG;gBACvB,MAAM;gBACN,eAAe;aAChB,CAAC;QACJ,CAAC,CAAC,CAAC;QAEH,MAAM,WAAW,GAAG,aAAa,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;QACxE,MAAM,WAAW,GAAG,aAAa;aAC9B,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC;aAC7B,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;QAE1C,OAAO,CAAC,IAAI,CAAC;YACX,MAAM;YACN,cAAc,EAAE,KAAK,CAAC,MAAM;YAC5B,WAAW;YACX,gBAAgB,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,CAAC;YAC3F,kBAAkB,EAAE,WAAW,CAAC,MAAM,GAAG,CAAC;gBACxC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,WAAW,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE;gBACrF,CAAC,CAAC,IAAI;YACR,KAAK,EAAE,aAAa;SACrB,CAAC,CAAC;IACL,CAAC;IAED,uBAAuB;IACvB,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAEzD,MAAM,mBAAmB,GAAG,SAAS,CAAC,MAAM,CAAC;IAC7C,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,GAAG,EAAE,CAAC,EAAE,EAAE,CAAC,GAAG,GAAG,CAAC,CAAC,WAAW,EAAE,CAAC,CAAC,CAAC;IACvE,MAAM,WAAW,GAAG,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,aAAa,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC;IAElF,MAAM,QAAQ,GAAG,OAAO;SACrB,OAAO,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;SACvB,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,eAAe,CAAC;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAe,EAAE,CAAC,CAAC,KAAK,IAAI,CAAC,CAAC;IAE1C,MAAM,CAAC,IAAI,CAAC,aAAa,mBAAmB,gBAAgB,WAAW,kBAAkB,OAAO,CAAC,MAAM,UAAU,CAAC,CAAC;IAEnH,OAAO;QACL,OAAO;QACP,OAAO,EAAE;YACP,mBAAmB;YACnB,WAAW;YACX,kBAAkB,EAAE,IAAI,CAAC,KAAK,CAAC,CAAC,WAAW,GAAG,WAAW,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE;YACrE,kBAAkB,EAAE,QAAQ,CAAC,MAAM,GAAG,CAAC;gBACrC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,GAAG,QAAQ,CAAC,MAAM,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE;gBAC/E,CAAC,CAAC,IAAI;SACT;KACF,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,sBAAsB,CAAC,IAAe;IAC7C,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;QACnD,MAAM,OAAO,GAAG,IAAI,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,OAAO,EAAE,CAAC;QACnD,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC,IAAI,OAAO,IAAI,OAAO;YAAE,OAAO,IAAI,CAAC;QACxE,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,CAAC,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,GAAG,EAAE,GAAG,EAAE,CAAC,CAAC,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IACxE,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,IAAI,CAAC;IACd,CAAC;AACH,CAAC"}

package/dist/core/search/fts-search.d.ts

@@ -0,0 +1,16 @@
+import type { SqliteStore } from "../store/sqlite-store.js";
+import type { GraphNode } from "../graph/graph-types.js";
+export interface SearchResult {
+    node: GraphNode;
+    score: number;
+}
+export interface SearchOptions {
+    limit?: number;
+    rerank?: boolean;
+}
+/**
+ * Search nodes using FTS5 full-text search with BM25 ranking.
+ * Optionally applies TF-IDF reranking for better relevance.
+ */
+export declare function searchNodes(store: SqliteStore, query: string, options?: SearchOptions): SearchResult[];
+//# sourceMappingURL=fts-search.d.ts.map

package/dist/core/search/fts-search.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"fts-search.d.ts","sourceRoot":"","sources":["../../../src/core/search/fts-search.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAC5D,OAAO,KAAK,EAAE,SAAS,EAAE,MAAM,yBAAyB,CAAC;AAIzD,MAAM,WAAW,YAAY;IAC3B,IAAI,EAAE,SAAS,CAAC;IAChB,KAAK,EAAE,MAAM,CAAC;CACf;AAED,MAAM,WAAW,aAAa;IAC5B,KAAK,CAAC,EAAE,MAAM,CAAC;IACf,MAAM,CAAC,EAAE,OAAO,CAAC;CAClB;AAqBD;;;GAGG;AACH,wBAAgB,WAAW,CACzB,KAAK,EAAE,WAAW,EAClB,KAAK,EAAE,MAAM,EACb,OAAO,GAAE,aAAkB,GAC1B,YAAY,EAAE,CAqChB"}