@mcp-graph-workflow/mcp-graph 3.0.0

package/dist/core/parser/read-html.js

@@ -0,0 +1,51 @@
+import { logger } from "../utils/logger.js";
+const HEADING_MAP = {
+    h1: "#",
+    h2: "##",
+    h3: "###",
+    h4: "####",
+    h5: "#####",
+    h6: "######",
+};
+/**
+ * Extract text content from an HTML string using cheerio.
+ * Converts headings to markdown format so the parser pipeline can segment them.
+ * Strips tags, scripts, styles, and normalizes whitespace.
+ */
+export async function readHtmlContent(html) {
+    // Dynamic import — cheerio is heavy, lazy-load
+    const { load } = await import("cheerio");
+    logger.info("Parsing HTML content", { sizeChars: html.length });
+    const $ = load(html);
+    // Remove non-content elements
+    $("script, style, nav, footer, header, noscript, iframe").remove();
+    // Convert HTML headings to markdown headings
+    for (const [tag, prefix] of Object.entries(HEADING_MAP)) {
+        $(tag).each(function () {
+            const el = $(this);
+            const text = el.text().trim();
+            el.replaceWith(`\n\n${prefix} ${text}\n\n`);
+        });
+    }
+    // Convert list items to markdown bullets
+    $("li").each(function () {
+        const el = $(this);
+        const text = el.text().trim();
+        el.replaceWith(`\n- ${text}`);
+    });
+    // Add line breaks for block elements
+    const blockElements = "p, div, section, article, blockquote, pre, br, tr";
+    $(blockElements).each(function () {
+        $(this).prepend("\n");
+        $(this).append("\n");
+    });
+    // Extract text from body (or whole doc if no body)
+    const rawText = $("body").length ? $("body").text() : $.root().text();
+    const text = rawText
+        .replace(/[ \t]+/g, " ")
+        .replace(/\n{3,}/g, "\n\n")
+        .trim();
+    logger.info("HTML parsed", { textLength: text.length });
+    return text;
+}
+//# sourceMappingURL=read-html.js.map

package/dist/core/parser/read-html.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"read-html.js","sourceRoot":"","sources":["../../../src/core/parser/read-html.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAE5C,MAAM,WAAW,GAA2B;IAC1C,EAAE,EAAE,GAAG;IACP,EAAE,EAAE,IAAI;IACR,EAAE,EAAE,KAAK;IACT,EAAE,EAAE,MAAM;IACV,EAAE,EAAE,OAAO;IACX,EAAE,EAAE,QAAQ;CACb,CAAC;AAEF;;;;GAIG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,IAAY;IAChD,+CAA+C;IAC/C,MAAM,EAAE,IAAI,EAAE,GAAG,MAAM,MAAM,CAAC,SAAS,CAAC,CAAC;IAEzC,MAAM,CAAC,IAAI,CAAC,sBAAsB,EAAE,EAAE,SAAS,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAEhE,MAAM,CAAC,GAAG,IAAI,CAAC,IAAI,CAAC,CAAC;IAErB,8BAA8B;IAC9B,CAAC,CAAC,sDAAsD,CAAC,CAAC,MAAM,EAAE,CAAC;IAEnE,6CAA6C;IAC7C,KAAK,MAAM,CAAC,GAAG,EAAE,MAAM,CAAC,IAAI,MAAM,CAAC,OAAO,CAAC,WAAW,CAAC,EAAE,CAAC;QACxD,CAAC,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC;YACV,MAAM,EAAE,GAAG,CAAC,CAAC,IAAc,CAAC,CAAC;YAC7B,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;YAC9B,EAAE,CAAC,WAAW,CAAC,OAAO,MAAM,IAAI,IAAI,MAAM,CAAC,CAAC;QAC9C,CAAC,CAAC,CAAC;IACL,CAAC;IAED,yCAAyC;IACzC,CAAC,CAAC,IAAI,CAAC,CAAC,IAAI,CAAC;QACX,MAAM,EAAE,GAAG,CAAC,CAAC,IAAc,CAAC,CAAC;QAC7B,MAAM,IAAI,GAAG,EAAE,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;QAC9B,EAAE,CAAC,WAAW,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC;IAChC,CAAC,CAAC,CAAC;IAEH,qCAAqC;IACrC,MAAM,aAAa,GAAG,mDAAmD,CAAC;IAC1E,CAAC,CAAC,aAAa,CAAC,CAAC,IAAI,CAAC;QACpB,CAAC,CAAC,IAAc,CAAC,CAAC,OAAO,CAAC,IAAI,CAAC,CAAC;QAChC,CAAC,CAAC,IAAc,CAAC,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;IACjC,CAAC,CAAC,CAAC;IAEH,mDAAmD;IACnD,MAAM,OAAO,GAAG,CAAC,CAAC,MAAM,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC,IAAI,EAAE,CAAC;IAEtE,MAAM,IAAI,GAAG,OAAO;SACjB,OAAO,CAAC,SAAS,EAAE,GAAG,CAAC;SACvB,OAAO,CAAC,SAAS,EAAE,MAAM,CAAC;SAC1B,IAAI,EAAE,CAAC;IAEV,MAAM,CAAC,IAAI,CAAC,aAAa,EAAE,EAAE,UAAU,EAAE,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAExD,OAAO,IAAI,CAAC;AACd,CAAC"}

package/dist/core/parser/read-pdf.d.ts

@@ -0,0 +1,10 @@
+interface PdfReadResult {
+    text: string;
+    pages: number;
+}
+/**
+ * Extract text content from a PDF buffer using pdf-parse.
+ */
+export declare function readPdfBuffer(buffer: Buffer): Promise<PdfReadResult>;
+export {};
+//# sourceMappingURL=read-pdf.d.ts.map

package/dist/core/parser/read-pdf.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"read-pdf.d.ts","sourceRoot":"","sources":["../../../src/core/parser/read-pdf.ts"],"names":[],"mappings":"AAEA,UAAU,aAAa;IACrB,IAAI,EAAE,MAAM,CAAC;IACb,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,wBAAsB,aAAa,CAAC,MAAM,EAAE,MAAM,GAAG,OAAO,CAAC,aAAa,CAAC,CAc1E"}

package/dist/core/parser/read-pdf.js

@@ -0,0 +1,16 @@
+import { logger } from "../utils/logger.js";
+/**
+ * Extract text content from a PDF buffer using pdf-parse.
+ */
+export async function readPdfBuffer(buffer) {
+    // Dynamic import — pdf-parse is CJS, lazy-load to avoid startup cost
+    const pdfParse = (await import("pdf-parse")).default;
+    logger.info("Parsing PDF buffer", { sizeBytes: buffer.length });
+    const result = await pdfParse(buffer);
+    logger.info("PDF parsed", { pages: result.numpages, textLength: result.text.length });
+    return {
+        text: result.text,
+        pages: result.numpages,
+    };
+}
+//# sourceMappingURL=read-pdf.js.map

package/dist/core/parser/read-pdf.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"read-pdf.js","sourceRoot":"","sources":["../../../src/core/parser/read-pdf.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAO5C;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,MAAc;IAChD,qEAAqE;IACrE,MAAM,QAAQ,GAAG,CAAC,MAAM,MAAM,CAAC,WAAW,CAAC,CAAC,CAAC,OAAO,CAAC;IAErD,MAAM,CAAC,IAAI,CAAC,oBAAoB,EAAE,EAAE,SAAS,EAAE,MAAM,CAAC,MAAM,EAAE,CAAC,CAAC;IAEhE,MAAM,MAAM,GAAG,MAAM,QAAQ,CAAC,MAAM,CAAC,CAAC;IAEtC,MAAM,CAAC,IAAI,CAAC,YAAY,EAAE,EAAE,KAAK,EAAE,MAAM,CAAC,QAAQ,EAAE,UAAU,EAAE,MAAM,CAAC,IAAI,CAAC,MAAM,EAAE,CAAC,CAAC;IAEtF,OAAO;QACL,IAAI,EAAE,MAAM,CAAC,IAAI;QACjB,KAAK,EAAE,MAAM,CAAC,QAAQ;KACvB,CAAC;AACJ,CAAC"}

package/dist/core/parser/segment.d.ts

@@ -0,0 +1,13 @@
+/**
+ * Stage 2: Segmentation.
+ * Split normalized text into structural blocks by headings.
+ */
+export interface Section {
+    level: number;
+    title: string;
+    body: string;
+    startLine: number;
+    endLine: number;
+}
+export declare function segment(text: string): Section[];
+//# sourceMappingURL=segment.d.ts.map

package/dist/core/parser/segment.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"segment.d.ts","sourceRoot":"","sources":["../../../src/core/parser/segment.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,MAAM,WAAW,OAAO;IACtB,KAAK,EAAE,MAAM,CAAC;IACd,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,SAAS,EAAE,MAAM,CAAC;IAClB,OAAO,EAAE,MAAM,CAAC;CACjB;AAED,wBAAgB,OAAO,CAAC,IAAI,EAAE,MAAM,GAAG,OAAO,EAAE,CAqD/C"}

package/dist/core/parser/segment.js

@@ -0,0 +1,53 @@
+/**
+ * Stage 2: Segmentation.
+ * Split normalized text into structural blocks by headings.
+ */
+export function segment(text) {
+    const lines = text.split("\n");
+    const sections = [];
+    let current = null;
+    let bodyLines = [];
+    for (let i = 0; i < lines.length; i++) {
+        const line = lines[i];
+        const headingMatch = line.match(/^(#{1,6})\s+(.+)$/);
+        if (headingMatch) {
+            // Close previous section
+            if (current) {
+                current.body = bodyLines.join("\n").trim();
+                current.endLine = i;
+                sections.push(current);
+            }
+            const level = headingMatch[1].length;
+            const title = headingMatch[2].trim();
+            current = {
+                level,
+                title,
+                body: "",
+                startLine: i + 1, // 1-indexed
+                endLine: i + 1,
+            };
+            bodyLines = [];
+        }
+        else {
+            bodyLines.push(line);
+        }
+    }
+    // Close last section
+    if (current) {
+        current.body = bodyLines.join("\n").trim();
+        current.endLine = lines.length;
+        sections.push(current);
+    }
+    // If no headings found, treat entire text as a single section
+    if (sections.length === 0 && text.trim()) {
+        sections.push({
+            level: 0,
+            title: "Untitled",
+            body: text.trim(),
+            startLine: 1,
+            endLine: lines.length,
+        });
+    }
+    return sections;
+}
+//# sourceMappingURL=segment.js.map

package/dist/core/parser/segment.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"segment.js","sourceRoot":"","sources":["../../../src/core/parser/segment.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAUH,MAAM,UAAU,OAAO,CAAC,IAAY;IAClC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC/B,MAAM,QAAQ,GAAc,EAAE,CAAC;IAC/B,IAAI,OAAO,GAAmB,IAAI,CAAC;IACnC,IAAI,SAAS,GAAa,EAAE,CAAC;IAE7B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,KAAK,CAAC,CAAC,CAAC,CAAC;QACtB,MAAM,YAAY,GAAG,IAAI,CAAC,KAAK,CAAC,mBAAmB,CAAC,CAAC;QAErD,IAAI,YAAY,EAAE,CAAC;YACjB,yBAAyB;YACzB,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;gBAC3C,OAAO,CAAC,OAAO,GAAG,CAAC,CAAC;gBACpB,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;YACzB,CAAC;YAED,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC;YACrC,MAAM,KAAK,GAAG,YAAY,CAAC,CAAC,CAAC,CAAC,IAAI,EAAE,CAAC;YAErC,OAAO,GAAG;gBACR,KAAK;gBACL,KAAK;gBACL,IAAI,EAAE,EAAE;gBACR,SAAS,EAAE,CAAC,GAAG,CAAC,EAAE,YAAY;gBAC9B,OAAO,EAAE,CAAC,GAAG,CAAC;aACf,CAAC;YACF,SAAS,GAAG,EAAE,CAAC;QACjB,CAAC;aAAM,CAAC;YACN,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACvB,CAAC;IACH,CAAC;IAED,qBAAqB;IACrB,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,CAAC,IAAI,GAAG,SAAS,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,IAAI,EAAE,CAAC;QAC3C,OAAO,CAAC,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC;QAC/B,QAAQ,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC;IACzB,CAAC;IAED,8DAA8D;IAC9D,IAAI,QAAQ,CAAC,MAAM,KAAK,CAAC,IAAI,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC;QACzC,QAAQ,CAAC,IAAI,CAAC;YACZ,KAAK,EAAE,CAAC;YACR,KAAK,EAAE,UAAU;YACjB,IAAI,EAAE,IAAI,CAAC,IAAI,EAAE;YACjB,SAAS,EAAE,CAAC;YACZ,OAAO,EAAE,KAAK,CAAC,MAAM;SACtB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,QAAQ,CAAC;AAClB,CAAC"}

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/enhanced-next.d.ts

@@ -0,0 +1,25 @@
+/**
+ * Enhanced Next Task — considers knowledge coverage, velocity data,
+ * and dependencies for smarter task recommendations.
+ */
+import type { GraphDocument } from "../graph/graph-types.js";
+import type { SqliteStore } from "../store/sqlite-store.js";
+import { type NextTaskResult } from "./next-task.js";
+export interface EnhancedNextResult {
+    /** The recommended task */
+    task: NextTaskResult;
+    /** Knowledge coverage score (0-1) */
+    knowledgeCoverage: number;
+    /** Historical velocity context */
+    velocityContext: {
+        avgCompletionHours: number | null;
+        estimatedHours: number | null;
+    };
+    /** Reason for recommendation */
+    enhancedReason: string;
+}
+/**
+ * Find the next task with enhanced context from knowledge store and velocity.
+ */
+export declare function findEnhancedNextTask(doc: GraphDocument, store: SqliteStore): EnhancedNextResult | null;
+//# sourceMappingURL=enhanced-next.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"enhanced-next.d.ts","sourceRoot":"","sources":["../../../src/core/planner/enhanced-next.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAEH,OAAO,KAAK,EAAE,aAAa,EAAa,MAAM,yBAAyB,CAAC;AACxE,OAAO,KAAK,EAAE,WAAW,EAAE,MAAM,0BAA0B,CAAC;AAE5D,OAAO,EAAgB,KAAK,cAAc,EAAE,MAAM,gBAAgB,CAAC;AAInE,MAAM,WAAW,kBAAkB;IACjC,2BAA2B;IAC3B,IAAI,EAAE,cAAc,CAAC;IACrB,qCAAqC;IACrC,iBAAiB,EAAE,MAAM,CAAC;IAC1B,kCAAkC;IAClC,eAAe,EAAE;QACf,kBAAkB,EAAE,MAAM,GAAG,IAAI,CAAC;QAClC,cAAc,EAAE,MAAM,GAAG,IAAI,CAAC;KAC/B,CAAC;IACF,gCAAgC;IAChC,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,GAAG,EAAE,aAAa,EAClB,KAAK,EAAE,WAAW,GACjB,kBAAkB,GAAG,IAAI,CA+B3B"}

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

@@ -0,0 +1,88 @@
+/**
+ * Enhanced Next Task — considers knowledge coverage, velocity data,
+ * and dependencies for smarter task recommendations.
+ */
+import { KnowledgeStore } from "../store/knowledge-store.js";
+import { findNextTask } from "./next-task.js";
+import { calculateVelocity } from "./velocity.js";
+import { logger } from "../utils/logger.js";
+/**
+ * Find the next task with enhanced context from knowledge store and velocity.
+ */
+export function findEnhancedNextTask(doc, store) {
+    const baseResult = findNextTask(doc);
+    if (!baseResult)
+        return null;
+    const knowledgeCoverage = assessKnowledgeCoverage(store, baseResult.node);
+    const velocityContext = getVelocityContext(doc, baseResult.node);
+    const reasons = [baseResult.reason];
+    if (knowledgeCoverage > 0.5) {
+        reasons.push(`Good knowledge coverage (${Math.round(knowledgeCoverage * 100)}%)`);
+    }
+    else if (knowledgeCoverage < 0.2) {
+        reasons.push("Low knowledge coverage — consider adding reference docs");
+    }
+    if (velocityContext.estimatedHours !== null) {
+        reasons.push(`Estimated ~${velocityContext.estimatedHours}h based on velocity`);
+    }
+    logger.info("Enhanced next task", {
+        nodeId: baseResult.node.id,
+        knowledgeCoverage,
+        estimatedHours: velocityContext.estimatedHours,
+    });
+    return {
+        task: baseResult,
+        knowledgeCoverage,
+        velocityContext,
+        enhancedReason: reasons.join(". "),
+    };
+}
+/**
+ * Assess how well a task is covered by knowledge documents.
+ * Returns 0-1 score based on FTS matches.
+ */
+function assessKnowledgeCoverage(store, node) {
+    try {
+        const knowledgeStore = new KnowledgeStore(store.getDb());
+        const totalKnowledge = knowledgeStore.count();
+        if (totalKnowledge === 0)
+            return 0;
+        const terms = node.title.split(/\s+/).filter((w) => w.length > 2);
+        if (terms.length === 0)
+            return 0;
+        const query = terms.join(" OR ");
+        const results = knowledgeStore.search(query, 5);
+        // Score: proportion of terms that got matches, capped at 1
+        const matchedTerms = new Set();
+        for (const result of results) {
+            const contentLower = (result.title + " " + result.content).toLowerCase();
+            for (const term of terms) {
+                if (contentLower.includes(term.toLowerCase())) {
+                    matchedTerms.add(term.toLowerCase());
+                }
+            }
+        }
+        return Math.min(1, matchedTerms.size / terms.length);
+    }
+    catch {
+        return 0;
+    }
+}
+/**
+ * Get velocity context for estimating task completion time.
+ */
+function getVelocityContext(doc, node) {
+    const velocity = calculateVelocity(doc);
+    const avgHours = velocity.overall.avgCompletionHours;
+    if (avgHours === null) {
+        return { avgCompletionHours: null, estimatedHours: null };
+    }
+    // Estimate based on XP size relative to average
+    const XP_MULTIPLIER = {
+        XS: 0.25, S: 0.5, M: 1, L: 2, XL: 4,
+    };
+    const multiplier = XP_MULTIPLIER[node.xpSize ?? "M"] ?? 1;
+    const estimatedHours = Math.round(avgHours * multiplier * 10) / 10;
+    return { avgCompletionHours: avgHours, estimatedHours };
+}
+//# sourceMappingURL=enhanced-next.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"enhanced-next.js","sourceRoot":"","sources":["../../../src/core/planner/enhanced-next.ts"],"names":[],"mappings":"AAAA;;;GAGG;AAIH,OAAO,EAAE,cAAc,EAAE,MAAM,6BAA6B,CAAC;AAC7D,OAAO,EAAE,YAAY,EAAuB,MAAM,gBAAgB,CAAC;AACnE,OAAO,EAAE,iBAAiB,EAAE,MAAM,eAAe,CAAC;AAClD,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAgB5C;;GAEG;AACH,MAAM,UAAU,oBAAoB,CAClC,GAAkB,EAClB,KAAkB;IAElB,MAAM,UAAU,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC;IACrC,IAAI,CAAC,UAAU;QAAE,OAAO,IAAI,CAAC;IAE7B,MAAM,iBAAiB,GAAG,uBAAuB,CAAC,KAAK,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;IAC1E,MAAM,eAAe,GAAG,kBAAkB,CAAC,GAAG,EAAE,UAAU,CAAC,IAAI,CAAC,CAAC;IAEjE,MAAM,OAAO,GAAa,CAAC,UAAU,CAAC,MAAM,CAAC,CAAC;IAE9C,IAAI,iBAAiB,GAAG,GAAG,EAAE,CAAC;QAC5B,OAAO,CAAC,IAAI,CAAC,4BAA4B,IAAI,CAAC,KAAK,CAAC,iBAAiB,GAAG,GAAG,CAAC,IAAI,CAAC,CAAC;IACpF,CAAC;SAAM,IAAI,iBAAiB,GAAG,GAAG,EAAE,CAAC;QACnC,OAAO,CAAC,IAAI,CAAC,yDAAyD,CAAC,CAAC;IAC1E,CAAC;IAED,IAAI,eAAe,CAAC,cAAc,KAAK,IAAI,EAAE,CAAC;QAC5C,OAAO,CAAC,IAAI,CAAC,cAAc,eAAe,CAAC,cAAc,qBAAqB,CAAC,CAAC;IAClF,CAAC;IAED,MAAM,CAAC,IAAI,CAAC,oBAAoB,EAAE;QAChC,MAAM,EAAE,UAAU,CAAC,IAAI,CAAC,EAAE;QAC1B,iBAAiB;QACjB,cAAc,EAAE,eAAe,CAAC,cAAc;KAC/C,CAAC,CAAC;IAEH,OAAO;QACL,IAAI,EAAE,UAAU;QAChB,iBAAiB;QACjB,eAAe;QACf,cAAc,EAAE,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC;KACnC,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,uBAAuB,CAAC,KAAkB,EAAE,IAAe;IAClE,IAAI,CAAC;QACH,MAAM,cAAc,GAAG,IAAI,cAAc,CAAC,KAAK,CAAC,KAAK,EAAE,CAAC,CAAC;QACzD,MAAM,cAAc,GAAG,cAAc,CAAC,KAAK,EAAE,CAAC;QAC9C,IAAI,cAAc,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEnC,MAAM,KAAK,GAAG,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC;QAClE,IAAI,KAAK,CAAC,MAAM,KAAK,CAAC;YAAE,OAAO,CAAC,CAAC;QAEjC,MAAM,KAAK,GAAG,KAAK,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACjC,MAAM,OAAO,GAAG,cAAc,CAAC,MAAM,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;QAEhD,2DAA2D;QAC3D,MAAM,YAAY,GAAG,IAAI,GAAG,EAAU,CAAC;QACvC,KAAK,MAAM,MAAM,IAAI,OAAO,EAAE,CAAC;YAC7B,MAAM,YAAY,GAAG,CAAC,MAAM,CAAC,KAAK,GAAG,GAAG,GAAG,MAAM,CAAC,OAAO,CAAC,CAAC,WAAW,EAAE,CAAC;YACzE,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;gBACzB,IAAI,YAAY,CAAC,QAAQ,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,EAAE,CAAC;oBAC9C,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,WAAW,EAAE,CAAC,CAAC;gBACvC,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,YAAY,CAAC,IAAI,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC;IACvD,CAAC;IAAC,MAAM,CAAC;QACP,OAAO,CAAC,CAAC;IACX,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CACzB,GAAkB,EAClB,IAAe;IAEf,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;IAExC,MAAM,QAAQ,GAAG,QAAQ,CAAC,OAAO,CAAC,kBAAkB,CAAC;IACrD,IAAI,QAAQ,KAAK,IAAI,EAAE,CAAC;QACtB,OAAO,EAAE,kBAAkB,EAAE,IAAI,EAAE,cAAc,EAAE,IAAI,EAAE,CAAC;IAC5D,CAAC;IAED,gDAAgD;IAChD,MAAM,aAAa,GAA2B;QAC5C,EAAE,EAAE,IAAI,EAAE,CAAC,EAAE,GAAG,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,CAAC,EAAE,EAAE,EAAE,CAAC;KACpC,CAAC;IACF,MAAM,UAAU,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,IAAI,GAAG,CAAC,IAAI,CAAC,CAAC;IAC1D,MAAM,cAAc,GAAG,IAAI,CAAC,KAAK,CAAC,QAAQ,GAAG,UAAU,GAAG,EAAE,CAAC,GAAG,EAAE,CAAC;IAEnE,OAAO,EAAE,kBAAkB,EAAE,QAAQ,EAAE,cAAc,EAAE,CAAC;AAC1D,CAAC"}