@mcp-graph-workflow/mcp-graph 3.0.0

package/dist/core/graph/mermaid-export.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"mermaid-export.js","sourceRoot":"","sources":["../../../src/core/graph/mermaid-export.ts"],"names":[],"mappings":"AASA,MAAM,aAAa,GAA+B;IAChD,IAAI,EAAE,SAAS;IACf,WAAW,EAAE,SAAS;IACtB,OAAO,EAAE,SAAS;IAClB,OAAO,EAAE,SAAS;IAClB,KAAK,EAAE,SAAS;CACjB,CAAC;AAEF,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAAC,CAAC,YAAY,EAAE,QAAQ,EAAE,YAAY,CAAC,CAAC,CAAC;AAEzE,SAAS,aAAa,CAAC,IAAY;IACjC,OAAO,IAAI;SACR,OAAO,CAAC,IAAI,EAAE,OAAO,CAAC;SACtB,OAAO,CAAC,IAAI,EAAE,QAAQ,CAAC;SACvB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC;SACrB,OAAO,CAAC,IAAI,EAAE,MAAM,CAAC,CAAC;AAC3B,CAAC;AAED,SAAS,WAAW,CAClB,KAAkB,EAClB,OAA8B;IAE9B,IAAI,QAAQ,GAAG,KAAK,CAAC;IACrB,IAAI,OAAO,EAAE,YAAY,IAAI,OAAO,CAAC,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QAC7D,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC;QAC/C,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAC5D,CAAC;IACD,IAAI,OAAO,EAAE,UAAU,IAAI,OAAO,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;QACzD,MAAM,KAAK,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,UAAU,CAAC,CAAC;QAC1C,QAAQ,GAAG,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC;IACvD,CAAC;IACD,OAAO,QAAQ,CAAC;AAClB,CAAC;AAED,SAAS,YAAY,CAAC,KAAkB;IACtC,MAAM,KAAK,GAAa,CAAC,SAAS,CAAC,CAAC;IAEpC,MAAM,WAAW,GAAG,IAAI,GAAG,EAAmC,CAAC;IAC/D,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,SAAS,GAAG,IAAI,CAAC,QAAQ,IAAI,SAAS,CAAC;QAC7C,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;QAClD,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpB,WAAW,CAAC,GAAG,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;IACvC,CAAC;IAED,SAAS,UAAU,CAAC,IAAe,EAAE,KAAa;QAChD,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC;QAClC,KAAK,CAAC,IAAI,CAAC,GAAG,MAAM,GAAG,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;QACpD,MAAM,QAAQ,GAAG,WAAW,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,EAAE,CAAC;QAChD,KAAK,MAAM,KAAK,IAAI,QAAQ,EAAE,CAAC;YAC7B,UAAU,CAAC,KAAK,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,MAAM,KAAK,GAAG,WAAW,CAAC,GAAG,CAAC,SAAS,CAAC,IAAI,EAAE,CAAC;IAC/C,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,UAAU,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;IACtB,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AACjC,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,KAAkB,EAClB,KAAkB,EAClB,OAA8B;IAE9B,MAAM,aAAa,GAAG,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC;IAElD,IAAI,OAAO,EAAE,MAAM,KAAK,SAAS,EAAE,CAAC;QAClC,OAAO,YAAY,CAAC,aAAa,CAAC,CAAC;IACrC,CAAC;IAED,MAAM,SAAS,GAAG,OAAO,EAAE,SAAS,IAAI,IAAI,CAAC;IAC7C,MAAM,KAAK,GAAa,CAAC,SAAS,SAAS,EAAE,CAAC,CAAC;IAE/C,IAAI,aAAa,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC/B,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;IACjC,CAAC;IAED,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,aAAa,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC;IAExD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,EAAE,KAAK,aAAa,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IAC7D,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACrD,SAAS;QACX,CAAC;QACD,MAAM,KAAK,GAAG,gBAAgB,CAAC,GAAG,CAAC,IAAI,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,KAAK,CAAC;QACvE,KAAK,CAAC,IAAI,CAAC,KAAK,IAAI,CAAC,IAAI,IAAI,KAAK,IAAI,IAAI,CAAC,YAAY,KAAK,IAAI,CAAC,EAAE,EAAE,CAAC,CAAC;IACzE,CAAC;IAED,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,KAAK,GAAG,aAAa,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;QACzC,IAAI,KAAK,EAAE,CAAC;YACV,KAAK,CAAC,IAAI,CAAC,WAAW,IAAI,CAAC,EAAE,SAAS,KAAK,EAAE,CAAC,CAAC;QACjD,CAAC;IACH,CAAC;IAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,GAAG,IAAI,CAAC;AACjC,CAAC"}

package/dist/core/importer/import-prd.d.ts

@@ -0,0 +1,7 @@
+/**
+ * @deprecated This module was used by the CLI. The MCP tools now handle
+ * import directly via SqliteStore + the parser pipeline.
+ * Kept as reference — do not use in new code.
+ */
+export { convertToGraph } from "./prd-to-graph.js";
+//# sourceMappingURL=import-prd.d.ts.map

package/dist/core/importer/import-prd.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"import-prd.d.ts","sourceRoot":"","sources":["../../../src/core/importer/import-prd.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/core/importer/import-prd.js

@@ -0,0 +1,7 @@
+/**
+ * @deprecated This module was used by the CLI. The MCP tools now handle
+ * import directly via SqliteStore + the parser pipeline.
+ * Kept as reference — do not use in new code.
+ */
+export { convertToGraph } from "./prd-to-graph.js";
+//# sourceMappingURL=import-prd.js.map

package/dist/core/importer/import-prd.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"import-prd.js","sourceRoot":"","sources":["../../../src/core/importer/import-prd.ts"],"names":[],"mappings":"AAAA;;;;GAIG;AAEH,OAAO,EAAE,cAAc,EAAE,MAAM,mBAAmB,CAAC"}

package/dist/core/importer/prd-to-graph.d.ts

@@ -0,0 +1,18 @@
+/**
+ * Converts parser extraction results into graph nodes and edges.
+ */
+import type { GraphNode, GraphEdge } from "../graph/graph-types.js";
+import type { ExtractionResult } from "../parser/extract.js";
+interface ConversionResult {
+    nodes: GraphNode[];
+    edges: GraphEdge[];
+    stats: {
+        nodesCreated: number;
+        edgesCreated: number;
+        blockedTasks: number;
+        inferredDeps: number;
+    };
+}
+export declare function convertToGraph(extraction: ExtractionResult, sourceFile: string): ConversionResult;
+export {};
+//# sourceMappingURL=prd-to-graph.d.ts.map

package/dist/core/importer/prd-to-graph.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"prd-to-graph.d.ts","sourceRoot":"","sources":["../../../src/core/importer/prd-to-graph.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,EAAE,SAAS,EAAE,SAAS,EAAwB,MAAM,yBAAyB,CAAC;AAC1F,OAAO,KAAK,EAAE,gBAAgB,EAAE,MAAM,sBAAsB,CAAC;AAM7D,UAAU,gBAAgB;IACxB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE,SAAS,EAAE,CAAC;IACnB,KAAK,EAAE;QACL,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,MAAM,CAAC;QACrB,YAAY,EAAE,MAAM,CAAC;KACtB,CAAC;CACH;AA4HD,wBAAgB,cAAc,CAC5B,UAAU,EAAE,gBAAgB,EAC5B,UAAU,EAAE,MAAM,GACjB,gBAAgB,CA4GlB"}

package/dist/core/importer/prd-to-graph.js

@@ -0,0 +1,195 @@
+/**
+ * Converts parser extraction results into graph nodes and edges.
+ */
+import { generateId } from "../utils/id.js";
+import { now } from "../utils/time.js";
+import { logger } from "../utils/logger.js";
+function mapBlockTypeToNodeType(blockType) {
+    const valid = [
+        "epic", "task", "subtask", "requirement", "constraint",
+        "milestone", "acceptance_criteria", "risk", "decision",
+    ];
+    if (valid.includes(blockType))
+        return blockType;
+    return null;
+}
+function defaultPriorityForType(type) {
+    switch (type) {
+        case "epic": return 2;
+        case "requirement": return 2;
+        case "constraint": return 1;
+        case "task": return 3;
+        case "subtask": return 3;
+        case "risk": return 2;
+        case "acceptance_criteria": return 4;
+        default: return 3;
+    }
+}
+function createNodeFromBlock(block, sourceFile, parentId = null) {
+    const nodeType = mapBlockTypeToNodeType(block.type);
+    if (!nodeType)
+        return null;
+    const timestamp = now();
+    return {
+        id: generateId("node"),
+        type: nodeType,
+        title: block.title,
+        description: block.description || undefined,
+        status: "backlog",
+        priority: defaultPriorityForType(nodeType),
+        parentId,
+        sourceRef: {
+            file: sourceFile,
+            startLine: block.startLine,
+            endLine: block.endLine,
+            confidence: block.confidence,
+        },
+        metadata: {
+            inferred: block.confidence < 0.7,
+            origin: "imported",
+        },
+        createdAt: timestamp,
+        updatedAt: timestamp,
+    };
+}
+function createEdge(from, to, relationType, reason, inferred = false, confidence = 1) {
+    return {
+        id: generateId("edge"),
+        from,
+        to,
+        relationType,
+        reason,
+        metadata: { inferred, confidence },
+        createdAt: now(),
+    };
+}
+/**
+ * Detect simple sequential dependencies between tasks.
+ * If tasks appear in a numbered list, each depends on the previous.
+ */
+function inferSequentialDeps(taskNodes) {
+    const edges = [];
+    for (let i = 1; i < taskNodes.length; i++) {
+        edges.push(createEdge(taskNodes[i].id, taskNodes[i - 1].id, "depends_on", `Sequential order: "${taskNodes[i].title}" after "${taskNodes[i - 1].title}"`, true, 0.6));
+    }
+    return edges;
+}
+/**
+ * Detect keyword-based dependencies in descriptions.
+ */
+function inferKeywordDeps(nodes) {
+    const edges = [];
+    const depKeywords = [
+        /antes de/i, /após/i, /depois de/i, /depende de/i,
+        /somente depois/i, /before/i, /after/i, /depends on/i,
+    ];
+    for (const node of nodes) {
+        if (!node.description)
+            continue;
+        for (const other of nodes) {
+            if (node.id === other.id)
+                continue;
+            // Check if node's description references other's title
+            const titleLower = other.title.toLowerCase();
+            const descLower = node.description.toLowerCase();
+            if (descLower.includes(titleLower) && depKeywords.some((p) => p.test(descLower))) {
+                edges.push(createEdge(node.id, other.id, "depends_on", `Keyword inference from description`, true, 0.5));
+            }
+        }
+    }
+    return edges;
+}
+export function convertToGraph(extraction, sourceFile) {
+    const nodes = [];
+    const edges = [];
+    let blockedTasks = 0;
+    // Pass 1: Create nodes from top-level blocks
+    for (const block of extraction.blocks) {
+        const node = createNodeFromBlock(block, sourceFile);
+        if (!node)
+            continue;
+        nodes.push(node);
+        // Pass 2: Create child nodes from block items
+        const childTaskNodes = [];
+        for (const item of block.items) {
+            const itemType = mapBlockTypeToNodeType(item.type);
+            if (!itemType)
+                continue;
+            const timestamp = now();
+            const childNode = {
+                id: generateId("node"),
+                type: itemType,
+                title: item.text,
+                status: "backlog",
+                priority: defaultPriorityForType(itemType),
+                parentId: node.id,
+                sourceRef: {
+                    file: sourceFile,
+                    startLine: item.line,
+                    endLine: item.line,
+                    confidence: item.confidence,
+                },
+                metadata: {
+                    inferred: item.confidence < 0.7,
+                    origin: "imported",
+                },
+                createdAt: timestamp,
+                updatedAt: timestamp,
+            };
+            nodes.push(childNode);
+            // Parent-child edge
+            edges.push(createEdge(node.id, childNode.id, "parent_of", undefined, false, 1));
+            if (itemType === "task" || itemType === "subtask") {
+                childTaskNodes.push(childNode);
+            }
+        }
+        // Infer sequential dependencies among sibling tasks
+        if (childTaskNodes.length > 1) {
+            edges.push(...inferSequentialDeps(childTaskNodes));
+        }
+    }
+    // Pass 3: Link constraints to tasks as blockers
+    const constraintNodes = nodes.filter((n) => n.type === "constraint");
+    const taskNodes = nodes.filter((n) => n.type === "task" || n.type === "subtask");
+    for (const constraint of constraintNodes) {
+        for (const task of taskNodes) {
+            // Only create block edges if constraint text seems related
+            // For now, constraints block all tasks (simple heuristic for MVP)
+            edges.push(createEdge(constraint.id, task.id, "related_to", "Constraint applies to task", true, 0.4));
+        }
+    }
+    // Pass 4: Link acceptance criteria to epic/parent
+    const acNodes = nodes.filter((n) => n.type === "acceptance_criteria");
+    const epicNodes = nodes.filter((n) => n.type === "epic");
+    for (const ac of acNodes) {
+        if (ac.parentId)
+            continue; // already linked
+        for (const epic of epicNodes) {
+            edges.push(createEdge(ac.id, epic.id, "implements", "Acceptance criteria for epic", true, 0.6));
+        }
+    }
+    // Pass 5: Keyword-based dependency inference across all task nodes
+    const allTaskNodes = nodes.filter((n) => n.type === "task");
+    edges.push(...inferKeywordDeps(allTaskNodes));
+    // Count blocked tasks (tasks that have incoming depends_on edges to non-done nodes)
+    const dependentNodeIds = new Set(edges.filter((e) => e.relationType === "depends_on").map((e) => e.from));
+    blockedTasks = dependentNodeIds.size;
+    const inferredDeps = edges.filter((e) => e.metadata?.inferred).length;
+    logger.debug("Graph conversion complete", {
+        nodesCreated: nodes.length,
+        edgesCreated: edges.length,
+        blockedTasks,
+        inferredDeps,
+    });
+    return {
+        nodes,
+        edges,
+        stats: {
+            nodesCreated: nodes.length,
+            edgesCreated: edges.length,
+            blockedTasks,
+            inferredDeps,
+        },
+    };
+}
+//# sourceMappingURL=prd-to-graph.js.map

package/dist/core/importer/prd-to-graph.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"prd-to-graph.js","sourceRoot":"","sources":["../../../src/core/importer/prd-to-graph.ts"],"names":[],"mappings":"AAAA;;GAEG;AAKH,OAAO,EAAE,UAAU,EAAE,MAAM,gBAAgB,CAAC;AAC5C,OAAO,EAAE,GAAG,EAAE,MAAM,kBAAkB,CAAC;AACvC,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAa5C,SAAS,sBAAsB,CAAC,SAAiB;IAC/C,MAAM,KAAK,GAAe;QACxB,MAAM,EAAE,MAAM,EAAE,SAAS,EAAE,aAAa,EAAE,YAAY;QACtD,WAAW,EAAE,qBAAqB,EAAE,MAAM,EAAE,UAAU;KACvD,CAAC;IACF,IAAI,KAAK,CAAC,QAAQ,CAAC,SAAqB,CAAC;QAAE,OAAO,SAAqB,CAAC;IACxE,OAAO,IAAI,CAAC;AACd,CAAC;AAED,SAAS,sBAAsB,CAAC,IAAc;IAC5C,QAAQ,IAAI,EAAE,CAAC;QACb,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC;QACtB,KAAK,aAAa,CAAC,CAAC,OAAO,CAAC,CAAC;QAC7B,KAAK,YAAY,CAAC,CAAC,OAAO,CAAC,CAAC;QAC5B,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC;QACtB,KAAK,SAAS,CAAC,CAAC,OAAO,CAAC,CAAC;QACzB,KAAK,MAAM,CAAC,CAAC,OAAO,CAAC,CAAC;QACtB,KAAK,qBAAqB,CAAC,CAAC,OAAO,CAAC,CAAC;QACrC,OAAO,CAAC,CAAC,OAAO,CAAC,CAAC;IACpB,CAAC;AACH,CAAC;AAED,SAAS,mBAAmB,CAC1B,KAAsB,EACtB,UAAkB,EAClB,WAA0B,IAAI;IAE9B,MAAM,QAAQ,GAAG,sBAAsB,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC;IACpD,IAAI,CAAC,QAAQ;QAAE,OAAO,IAAI,CAAC;IAE3B,MAAM,SAAS,GAAG,GAAG,EAAE,CAAC;IACxB,OAAO;QACL,EAAE,EAAE,UAAU,CAAC,MAAM,CAAC;QACtB,IAAI,EAAE,QAAQ;QACd,KAAK,EAAE,KAAK,CAAC,KAAK;QAClB,WAAW,EAAE,KAAK,CAAC,WAAW,IAAI,SAAS;QAC3C,MAAM,EAAE,SAAuB;QAC/B,QAAQ,EAAE,sBAAsB,CAAC,QAAQ,CAAC;QAC1C,QAAQ;QACR,SAAS,EAAE;YACT,IAAI,EAAE,UAAU;YAChB,SAAS,EAAE,KAAK,CAAC,SAAS;YAC1B,OAAO,EAAE,KAAK,CAAC,OAAO;YACtB,UAAU,EAAE,KAAK,CAAC,UAAU;SAC7B;QACD,QAAQ,EAAE;YACR,QAAQ,EAAE,KAAK,CAAC,UAAU,GAAG,GAAG;YAChC,MAAM,EAAE,UAAU;SACnB;QACD,SAAS,EAAE,SAAS;QACpB,SAAS,EAAE,SAAS;KACrB,CAAC;AACJ,CAAC;AAED,SAAS,UAAU,CACjB,IAAY,EACZ,EAAU,EACV,YAAuC,EACvC,MAAe,EACf,WAAoB,KAAK,EACzB,aAAqB,CAAC;IAEtB,OAAO;QACL,EAAE,EAAE,UAAU,CAAC,MAAM,CAAC;QACtB,IAAI;QACJ,EAAE;QACF,YAAY;QACZ,MAAM;QACN,QAAQ,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE;QAClC,SAAS,EAAE,GAAG,EAAE;KACjB,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,SAAS,mBAAmB,CAAC,SAAsB;IACjD,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,KAAK,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,SAAS,CAAC,MAAM,EAAE,CAAC,EAAE,EAAE,CAAC;QAC1C,KAAK,CAAC,IAAI,CACR,UAAU,CACR,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,EACf,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EACnB,YAAY,EACZ,sBAAsB,SAAS,CAAC,CAAC,CAAC,CAAC,KAAK,YAAY,SAAS,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,KAAK,GAAG,EAC7E,IAAI,EACJ,GAAG,CACJ,CACF,CAAC;IACJ,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,KAAkB;IAC1C,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,WAAW,GAAG;QAClB,WAAW,EAAE,OAAO,EAAE,YAAY,EAAE,aAAa;QACjD,iBAAiB,EAAE,SAAS,EAAE,QAAQ,EAAE,aAAa;KACtD,CAAC;IAEF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,IAAI,CAAC,IAAI,CAAC,WAAW;YAAE,SAAS;QAChC,KAAK,MAAM,KAAK,IAAI,KAAK,EAAE,CAAC;YAC1B,IAAI,IAAI,CAAC,EAAE,KAAK,KAAK,CAAC,EAAE;gBAAE,SAAS;YACnC,uDAAuD;YACvD,MAAM,UAAU,GAAG,KAAK,CAAC,KAAK,CAAC,WAAW,EAAE,CAAC;YAC7C,MAAM,SAAS,GAAG,IAAI,CAAC,WAAW,CAAC,WAAW,EAAE,CAAC;YAEjD,IAAI,SAAS,CAAC,QAAQ,CAAC,UAAU,CAAC,IAAI,WAAW,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,CAAC;gBACjF,KAAK,CAAC,IAAI,CACR,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,KAAK,CAAC,EAAE,EAAE,YAAY,EAAE,oCAAoC,EAAE,IAAI,EAAE,GAAG,CAAC,CAC7F,CAAC;YACJ,CAAC;QACH,CAAC;IACH,CAAC;IACD,OAAO,KAAK,CAAC;AACf,CAAC;AAED,MAAM,UAAU,cAAc,CAC5B,UAA4B,EAC5B,UAAkB;IAElB,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,MAAM,KAAK,GAAgB,EAAE,CAAC;IAC9B,IAAI,YAAY,GAAG,CAAC,CAAC;IAErB,6CAA6C;IAC7C,KAAK,MAAM,KAAK,IAAI,UAAU,CAAC,MAAM,EAAE,CAAC;QACtC,MAAM,IAAI,GAAG,mBAAmB,CAAC,KAAK,EAAE,UAAU,CAAC,CAAC;QACpD,IAAI,CAAC,IAAI;YAAE,SAAS;QACpB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAEjB,8CAA8C;QAC9C,MAAM,cAAc,GAAgB,EAAE,CAAC;QACvC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC/B,MAAM,QAAQ,GAAG,sBAAsB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACnD,IAAI,CAAC,QAAQ;gBAAE,SAAS;YAExB,MAAM,SAAS,GAAG,GAAG,EAAE,CAAC;YACxB,MAAM,SAAS,GAAc;gBAC3B,EAAE,EAAE,UAAU,CAAC,MAAM,CAAC;gBACtB,IAAI,EAAE,QAAQ;gBACd,KAAK,EAAE,IAAI,CAAC,IAAI;gBAChB,MAAM,EAAE,SAAS;gBACjB,QAAQ,EAAE,sBAAsB,CAAC,QAAQ,CAAC;gBAC1C,QAAQ,EAAE,IAAI,CAAC,EAAE;gBACjB,SAAS,EAAE;oBACT,IAAI,EAAE,UAAU;oBAChB,SAAS,EAAE,IAAI,CAAC,IAAI;oBACpB,OAAO,EAAE,IAAI,CAAC,IAAI;oBAClB,UAAU,EAAE,IAAI,CAAC,UAAU;iBAC5B;gBACD,QAAQ,EAAE;oBACR,QAAQ,EAAE,IAAI,CAAC,UAAU,GAAG,GAAG;oBAC/B,MAAM,EAAE,UAAU;iBACnB;gBACD,SAAS,EAAE,SAAS;gBACpB,SAAS,EAAE,SAAS;aACrB,CAAC;YAEF,KAAK,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YAEtB,oBAAoB;YACpB,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,EAAE,SAAS,CAAC,EAAE,EAAE,WAAW,EAAE,SAAS,EAAE,KAAK,EAAE,CAAC,CAAC,CAAC,CAAC;YAEhF,IAAI,QAAQ,KAAK,MAAM,IAAI,QAAQ,KAAK,SAAS,EAAE,CAAC;gBAClD,cAAc,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;YACjC,CAAC;QACH,CAAC;QAED,oDAAoD;QACpD,IAAI,cAAc,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC9B,KAAK,CAAC,IAAI,CAAC,GAAG,mBAAmB,CAAC,cAAc,CAAC,CAAC,CAAC;QACrD,CAAC;IACH,CAAC;IAED,gDAAgD;IAChD,MAAM,eAAe,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC,CAAC;IACrE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;IAEjF,KAAK,MAAM,UAAU,IAAI,eAAe,EAAE,CAAC;QACzC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,2DAA2D;YAC3D,kEAAkE;YAClE,KAAK,CAAC,IAAI,CACR,UAAU,CAAC,UAAU,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,YAAY,EAAE,4BAA4B,EAAE,IAAI,EAAE,GAAG,CAAC,CAC1F,CAAC;QACJ,CAAC;IACH,CAAC;IAED,kDAAkD;IAClD,MAAM,OAAO,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,qBAAqB,CAAC,CAAC;IACtE,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;IACzD,KAAK,MAAM,EAAE,IAAI,OAAO,EAAE,CAAC;QACzB,IAAI,EAAE,CAAC,QAAQ;YAAE,SAAS,CAAC,iBAAiB;QAC5C,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;YAC7B,KAAK,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC,EAAE,EAAE,IAAI,CAAC,EAAE,EAAE,YAAY,EAAE,8BAA8B,EAAE,IAAI,EAAE,GAAG,CAAC,CAAC,CAAC;QAClG,CAAC;IACH,CAAC;IAED,mEAAmE;IACnE,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC;IAC5D,KAAK,CAAC,IAAI,CAAC,GAAG,gBAAgB,CAAC,YAAY,CAAC,CAAC,CAAC;IAE9C,oFAAoF;IACpF,MAAM,gBAAgB,GAAG,IAAI,GAAG,CAC9B,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,YAAY,KAAK,YAAY,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,CACxE,CAAC;IACF,YAAY,GAAG,gBAAgB,CAAC,IAAI,CAAC;IAErC,MAAM,YAAY,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,EAAE,QAAQ,CAAC,CAAC,MAAM,CAAC;IAEtE,MAAM,CAAC,KAAK,CAAC,2BAA2B,EAAE;QACxC,YAAY,EAAE,KAAK,CAAC,MAAM;QAC1B,YAAY,EAAE,KAAK,CAAC,MAAM;QAC1B,YAAY;QACZ,YAAY;KACb,CAAC,CAAC;IAEH,OAAO;QACL,KAAK;QACL,KAAK;QACL,KAAK,EAAE;YACL,YAAY,EAAE,KAAK,CAAC,MAAM;YAC1B,YAAY,EAAE,KAAK,CAAC,MAAM;YAC1B,YAAY;YACZ,YAAY;SACb;KACF,CAAC;AACJ,CAAC"}

package/dist/core/insights/bottleneck-detector.d.ts

@@ -0,0 +1,31 @@
+import type { GraphDocument } from "../graph/graph-types.js";
+export interface BlockedTaskInfo {
+    id: string;
+    title: string;
+    status: string;
+    blockerIds: string[];
+    blockerTitles: string[];
+}
+export interface LongChainInfo {
+    path: string[];
+    titles: string[];
+    length: number;
+}
+export interface BottleneckReport {
+    blockedTasks: BlockedTaskInfo[];
+    criticalPath: LongChainInfo | null;
+    missingAcceptanceCriteria: Array<{
+        id: string;
+        title: string;
+    }>;
+    oversizedTasks: Array<{
+        id: string;
+        title: string;
+        estimateMinutes: number;
+    }>;
+}
+/**
+ * Detect bottlenecks in the execution graph.
+ */
+export declare function detectBottlenecks(doc: GraphDocument): BottleneckReport;
+//# sourceMappingURL=bottleneck-detector.d.ts.map

package/dist/core/insights/bottleneck-detector.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"bottleneck-detector.d.ts","sourceRoot":"","sources":["../../../src/core/insights/bottleneck-detector.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAa,MAAM,yBAAyB,CAAC;AAIxE,MAAM,WAAW,eAAe;IAC9B,EAAE,EAAE,MAAM,CAAC;IACX,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,UAAU,EAAE,MAAM,EAAE,CAAC;IACrB,aAAa,EAAE,MAAM,EAAE,CAAC;CACzB;AAED,MAAM,WAAW,aAAa;IAC5B,IAAI,EAAE,MAAM,EAAE,CAAC;IACf,MAAM,EAAE,MAAM,EAAE,CAAC;IACjB,MAAM,EAAE,MAAM,CAAC;CAChB;AAED,MAAM,WAAW,gBAAgB;IAC/B,YAAY,EAAE,eAAe,EAAE,CAAC;IAChC,YAAY,EAAE,aAAa,GAAG,IAAI,CAAC;IACnC,yBAAyB,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;IAChE,cAAc,EAAE,KAAK,CAAC;QAAE,EAAE,EAAE,MAAM,CAAC;QAAC,KAAK,EAAE,MAAM,CAAC;QAAC,eAAe,EAAE,MAAM,CAAA;KAAE,CAAC,CAAC;CAC/E;AAID;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,GAAG,EAAE,aAAa,GAAG,gBAAgB,CA+FtE"}

package/dist/core/insights/bottleneck-detector.js

@@ -0,0 +1,84 @@
+import { findCriticalPath } from "../planner/dependency-chain.js";
+import { logger } from "../utils/logger.js";
+const OVERSIZE_THRESHOLD_MINUTES = 120;
+/**
+ * Detect bottlenecks in the execution graph.
+ */
+export function detectBottlenecks(doc) {
+    logger.info("Detecting bottlenecks", { nodes: doc.nodes.length, edges: doc.edges.length });
+    const nodeMap = new Map(doc.nodes.map((n) => [n.id, n]));
+    const doneIds = new Set(doc.nodes.filter((n) => n.status === "done").map((n) => n.id));
+    // 1. Blocked tasks: tasks with unresolved depends_on or blocks edges
+    const blockedTasks = [];
+    const taskNodes = doc.nodes.filter((n) => (n.type === "task" || n.type === "subtask") && n.status !== "done");
+    for (const task of taskNodes) {
+        const deps = doc.edges.filter((e) => e.from === task.id && e.relationType === "depends_on" && !doneIds.has(e.to));
+        // Also check blocks edges: edge.to === task.id means someone blocks this task
+        const blocksEdges = doc.edges.filter((e) => e.to === task.id && e.relationType === "blocks" && !doneIds.has(e.from));
+        const allBlockerIds = [
+            ...deps.map((e) => e.to),
+            ...blocksEdges.map((e) => e.from),
+        ];
+        if (allBlockerIds.length > 0 || task.blocked) {
+            blockedTasks.push({
+                id: task.id,
+                title: task.title,
+                status: task.status,
+                blockerIds: allBlockerIds,
+                blockerTitles: allBlockerIds.map((id) => nodeMap.get(id)?.title ?? id),
+            });
+        }
+    }
+    // 2. Critical path (longest dependency chain)
+    let criticalPath = null;
+    try {
+        const cpNodes = findCriticalPath(doc);
+        if (cpNodes.length > 1) {
+            criticalPath = {
+                path: cpNodes.map((n) => n.id),
+                titles: cpNodes.map((n) => n.title),
+                length: cpNodes.length,
+            };
+        }
+    }
+    catch {
+        // Graph may have cycles or be empty
+    }
+    // 3. Tasks/epics without acceptance criteria
+    const missingAcceptanceCriteria = doc.nodes
+        .filter((n) => (n.type === "task" || n.type === "epic") &&
+        n.status !== "done" &&
+        (!n.acceptanceCriteria || n.acceptanceCriteria.length === 0))
+        .map((n) => ({ id: n.id, title: n.title }));
+    // 4. Oversized tasks (estimate > threshold without decomposition)
+    // A node has children if: (a) some node has parentId pointing to it, or
+    // (b) it has outgoing parent_of edges, or (c) it has incoming child_of edges
+    const parentViaParentId = new Set(doc.nodes.filter((n) => n.parentId).map((n) => n.parentId));
+    const parentViaEdges = new Set();
+    for (const edge of doc.edges) {
+        if (edge.relationType === "parent_of")
+            parentViaEdges.add(edge.from);
+        if (edge.relationType === "child_of")
+            parentViaEdges.add(edge.to);
+    }
+    const hasChildren = (id) => parentViaParentId.has(id) || parentViaEdges.has(id);
+    const oversizedTasks = doc.nodes
+        .filter((n) => (n.type === "task" || n.type === "subtask") &&
+        n.status !== "done" &&
+        n.estimateMinutes != null &&
+        n.estimateMinutes > OVERSIZE_THRESHOLD_MINUTES &&
+        !hasChildren(n.id))
+        .map((n) => ({ id: n.id, title: n.title, estimateMinutes: n.estimateMinutes }));
+    logger.info("Bottleneck detection complete", {
+        blocked: blockedTasks.length,
+        missingAC: missingAcceptanceCriteria.length,
+        oversized: oversizedTasks.length,
+    });
+    return {
+        blockedTasks,
+        criticalPath,
+        missingAcceptanceCriteria,
+        oversizedTasks,
+    };
+}
+//# sourceMappingURL=bottleneck-detector.js.map

package/dist/core/insights/bottleneck-detector.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"bottleneck-detector.js","sourceRoot":"","sources":["../../../src/core/insights/bottleneck-detector.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,gBAAgB,EAAE,MAAM,gCAAgC,CAAC;AAClE,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AAuB5C,MAAM,0BAA0B,GAAG,GAAG,CAAC;AAEvC;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,GAAkB;IAClD,MAAM,CAAC,IAAI,CAAC,uBAAuB,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAE3F,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;IACzD,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,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,CAAC,CAAC;IAEvF,qEAAqE;IACrE,MAAM,YAAY,GAAsB,EAAE,CAAC;IAC3C,MAAM,SAAS,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAChC,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,SAAS,EAAE,CAAC;QAC7B,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;QACF,8EAA8E;QAC9E,MAAM,WAAW,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAClC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,IAAI,CAAC,CAAC,YAAY,KAAK,QAAQ,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAC/E,CAAC;QACF,MAAM,aAAa,GAAG;YACpB,GAAG,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;YACxB,GAAG,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC;SAClC,CAAC;QACF,IAAI,aAAa,CAAC,MAAM,GAAG,CAAC,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YAC7C,YAAY,CAAC,IAAI,CAAC;gBAChB,EAAE,EAAE,IAAI,CAAC,EAAE;gBACX,KAAK,EAAE,IAAI,CAAC,KAAK;gBACjB,MAAM,EAAE,IAAI,CAAC,MAAM;gBACnB,UAAU,EAAE,aAAa;gBACzB,aAAa,EAAE,aAAa,CAAC,GAAG,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,KAAK,IAAI,EAAE,CAAC;aACvE,CAAC,CAAC;QACL,CAAC;IACH,CAAC;IAED,8CAA8C;IAC9C,IAAI,YAAY,GAAyB,IAAI,CAAC;IAC9C,IAAI,CAAC;QACH,MAAM,OAAO,GAAG,gBAAgB,CAAC,GAAG,CAAC,CAAC;QACtC,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YACvB,YAAY,GAAG;gBACb,IAAI,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;gBAC9B,MAAM,EAAE,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,CAAC;gBACnC,MAAM,EAAE,OAAO,CAAC,MAAM;aACvB,CAAC;QACJ,CAAC;IACH,CAAC;IAAC,MAAM,CAAC;QACP,oCAAoC;IACtC,CAAC;IAED,6CAA6C;IAC7C,MAAM,yBAAyB,GAAG,GAAG,CAAC,KAAK;SACxC,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,MAAM,CAAC;QACxC,CAAC,CAAC,MAAM,KAAK,MAAM;QACnB,CAAC,CAAC,CAAC,CAAC,kBAAkB,IAAI,CAAC,CAAC,kBAAkB,CAAC,MAAM,KAAK,CAAC,CAAC,CAC/D;SACA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,CAAC,CAAC,CAAC;IAE9C,kEAAkE;IAClE,wEAAwE;IACxE,6EAA6E;IAC7E,MAAM,iBAAiB,GAAG,IAAI,GAAG,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC;IAC9F,MAAM,cAAc,GAAG,IAAI,GAAG,EAAU,CAAC;IACzC,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,IAAI,CAAC,YAAY,KAAK,WAAW;YAAE,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACrE,IAAI,IAAI,CAAC,YAAY,KAAK,UAAU;YAAE,cAAc,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACpE,CAAC;IACD,MAAM,WAAW,GAAG,CAAC,EAAU,EAAW,EAAE,CAC1C,iBAAiB,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,cAAc,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;IAEtD,MAAM,cAAc,GAAG,GAAG,CAAC,KAAK;SAC7B,MAAM,CACL,CAAC,CAAC,EAAE,EAAE,CACJ,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC;QAC3C,CAAC,CAAC,MAAM,KAAK,MAAM;QACnB,CAAC,CAAC,eAAe,IAAI,IAAI;QACzB,CAAC,CAAC,eAAe,GAAG,0BAA0B;QAC9C,CAAC,WAAW,CAAC,CAAC,CAAC,EAAE,CAAC,CACrB;SACA,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,EAAE,CAAC,CAAC,EAAE,EAAE,KAAK,EAAE,CAAC,CAAC,KAAK,EAAE,eAAe,EAAE,CAAC,CAAC,eAAgB,EAAE,CAAC,CAAC,CAAC;IAEnF,MAAM,CAAC,IAAI,CAAC,+BAA+B,EAAE;QAC3C,OAAO,EAAE,YAAY,CAAC,MAAM;QAC5B,SAAS,EAAE,yBAAyB,CAAC,MAAM;QAC3C,SAAS,EAAE,cAAc,CAAC,MAAM;KACjC,CAAC,CAAC;IAEH,OAAO;QACL,YAAY;QACZ,YAAY;QACZ,yBAAyB;QACzB,cAAc;KACf,CAAC;AACJ,CAAC"}

package/dist/core/insights/metrics-calculator.d.ts

@@ -0,0 +1,31 @@
+import type { GraphDocument, NodeStatus } from "../graph/graph-types.js";
+export interface StatusDistribution {
+    status: NodeStatus;
+    count: number;
+    percentage: number;
+}
+export interface MetricsReport {
+    totalNodes: number;
+    totalTasks: number;
+    completionRate: number;
+    statusDistribution: StatusDistribution[];
+    velocity: {
+        tasksCompleted: number;
+        avgPointsPerTask: number;
+        avgCompletionHours: number;
+    };
+    sprintProgress: SprintProgress[];
+}
+export interface SprintProgress {
+    sprint: string;
+    total: number;
+    done: number;
+    inProgress: number;
+    blocked: number;
+    percentage: number;
+}
+/**
+ * Calculate comprehensive metrics from the graph.
+ */
+export declare function calculateMetrics(doc: GraphDocument): MetricsReport;
+//# sourceMappingURL=metrics-calculator.d.ts.map

package/dist/core/insights/metrics-calculator.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics-calculator.d.ts","sourceRoot":"","sources":["../../../src/core/insights/metrics-calculator.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,aAAa,EAAa,UAAU,EAAE,MAAM,yBAAyB,CAAC;AAIpF,MAAM,WAAW,kBAAkB;IACjC,MAAM,EAAE,UAAU,CAAC;IACnB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,MAAM,CAAC;CACpB;AAED,MAAM,WAAW,aAAa;IAC5B,UAAU,EAAE,MAAM,CAAC;IACnB,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC;IACvB,kBAAkB,EAAE,kBAAkB,EAAE,CAAC;IACzC,QAAQ,EAAE;QACR,cAAc,EAAE,MAAM,CAAC;QACvB,gBAAgB,EAAE,MAAM,CAAC;QACzB,kBAAkB,EAAE,MAAM,CAAC;KAC5B,CAAC;IACF,cAAc,EAAE,cAAc,EAAE,CAAC;CAClC;AAED,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,IAAI,EAAE,MAAM,CAAC;IACb,UAAU,EAAE,MAAM,CAAC;IACnB,OAAO,EAAE,MAAM,CAAC;IAChB,UAAU,EAAE,MAAM,CAAC;CACpB;AAID;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,GAAG,EAAE,aAAa,GAAG,aAAa,CA2ElE"}

package/dist/core/insights/metrics-calculator.js

@@ -0,0 +1,78 @@
+import { calculateVelocity } from "../planner/velocity.js";
+import { logger } from "../utils/logger.js";
+const ALL_STATUSES = ["backlog", "ready", "in_progress", "blocked", "done"];
+/**
+ * Calculate comprehensive metrics from the graph.
+ */
+export function calculateMetrics(doc) {
+    logger.info("Calculating metrics", { nodes: doc.nodes.length });
+    const tasks = doc.nodes.filter((n) => n.type === "task" || n.type === "subtask");
+    const doneTasks = tasks.filter((n) => n.status === "done");
+    // Status distribution
+    const statusCounts = new Map();
+    for (const status of ALL_STATUSES)
+        statusCounts.set(status, 0);
+    for (const node of doc.nodes) {
+        const count = statusCounts.get(node.status) ?? 0;
+        statusCounts.set(node.status, count + 1);
+    }
+    const totalNodes = doc.nodes.length;
+    const statusDistribution = ALL_STATUSES.map((status) => {
+        const count = statusCounts.get(status) ?? 0;
+        return {
+            status,
+            count,
+            percentage: totalNodes > 0 ? Math.round((count / totalNodes) * 100) : 0,
+        };
+    });
+    // Velocity from existing planner
+    let velocityData = { tasksCompleted: 0, avgPointsPerTask: 0, avgCompletionHours: 0 };
+    try {
+        const velocity = calculateVelocity(doc);
+        velocityData = {
+            tasksCompleted: velocity.overall.totalTasksCompleted,
+            avgPointsPerTask: velocity.overall.totalPoints > 0 && velocity.overall.totalTasksCompleted > 0
+                ? Math.round(velocity.overall.totalPoints / velocity.overall.totalTasksCompleted * 10) / 10
+                : 0,
+            avgCompletionHours: velocity.overall.avgCompletionHours ?? 0,
+        };
+    }
+    catch {
+        // Velocity calculation may fail with no sprints
+    }
+    // Sprint progress
+    const sprintMap = new Map();
+    for (const task of tasks) {
+        const sprint = task.sprint ?? "__unassigned__";
+        const list = sprintMap.get(sprint) ?? [];
+        list.push(task);
+        sprintMap.set(sprint, list);
+    }
+    const sprintProgress = [];
+    for (const [sprint, sprintTasks] of sprintMap) {
+        if (sprint === "__unassigned__")
+            continue;
+        const total = sprintTasks.length;
+        const done = sprintTasks.filter((t) => t.status === "done").length;
+        const inProgress = sprintTasks.filter((t) => t.status === "in_progress").length;
+        const blocked = sprintTasks.filter((t) => t.status === "blocked" || t.blocked).length;
+        sprintProgress.push({
+            sprint,
+            total,
+            done,
+            inProgress,
+            blocked,
+            percentage: total > 0 ? Math.round((done / total) * 100) : 0,
+        });
+    }
+    sprintProgress.sort((a, b) => a.sprint.localeCompare(b.sprint));
+    return {
+        totalNodes,
+        totalTasks: tasks.length,
+        completionRate: tasks.length > 0 ? Math.round((doneTasks.length / tasks.length) * 100) : 0,
+        statusDistribution,
+        velocity: velocityData,
+        sprintProgress,
+    };
+}
+//# sourceMappingURL=metrics-calculator.js.map

package/dist/core/insights/metrics-calculator.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"metrics-calculator.js","sourceRoot":"","sources":["../../../src/core/insights/metrics-calculator.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,iBAAiB,EAAE,MAAM,wBAAwB,CAAC;AAC3D,OAAO,EAAE,MAAM,EAAE,MAAM,oBAAoB,CAAC;AA8B5C,MAAM,YAAY,GAAiB,CAAC,SAAS,EAAE,OAAO,EAAE,aAAa,EAAE,SAAS,EAAE,MAAM,CAAC,CAAC;AAE1F;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,GAAkB;IACjD,MAAM,CAAC,IAAI,CAAC,qBAAqB,EAAE,EAAE,KAAK,EAAE,GAAG,CAAC,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC;IAEhE,MAAM,KAAK,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,MAAM,IAAI,CAAC,CAAC,IAAI,KAAK,SAAS,CAAC,CAAC;IACjF,MAAM,SAAS,GAAG,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC;IAE3D,sBAAsB;IACtB,MAAM,YAAY,GAAG,IAAI,GAAG,EAAsB,CAAC;IACnD,KAAK,MAAM,MAAM,IAAI,YAAY;QAAE,YAAY,CAAC,GAAG,CAAC,MAAM,EAAE,CAAC,CAAC,CAAC;IAC/D,KAAK,MAAM,IAAI,IAAI,GAAG,CAAC,KAAK,EAAE,CAAC;QAC7B,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QACjD,YAAY,CAAC,GAAG,CAAC,IAAI,CAAC,MAAM,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC;IAC3C,CAAC;IAED,MAAM,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC;IACpC,MAAM,kBAAkB,GAAyB,YAAY,CAAC,GAAG,CAAC,CAAC,MAAM,EAAE,EAAE;QAC3E,MAAM,KAAK,GAAG,YAAY,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;QAC5C,OAAO;YACL,MAAM;YACN,KAAK;YACL,UAAU,EAAE,UAAU,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,GAAG,UAAU,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SACxE,CAAC;IACJ,CAAC,CAAC,CAAC;IAEH,iCAAiC;IACjC,IAAI,YAAY,GAAG,EAAE,cAAc,EAAE,CAAC,EAAE,gBAAgB,EAAE,CAAC,EAAE,kBAAkB,EAAE,CAAC,EAAE,CAAC;IACrF,IAAI,CAAC;QACH,MAAM,QAAQ,GAAG,iBAAiB,CAAC,GAAG,CAAC,CAAC;QACxC,YAAY,GAAG;YACb,cAAc,EAAE,QAAQ,CAAC,OAAO,CAAC,mBAAmB;YACpD,gBAAgB,EAAE,QAAQ,CAAC,OAAO,CAAC,WAAW,GAAG,CAAC,IAAI,QAAQ,CAAC,OAAO,CAAC,mBAAmB,GAAG,CAAC;gBAC5F,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,QAAQ,CAAC,OAAO,CAAC,WAAW,GAAG,QAAQ,CAAC,OAAO,CAAC,mBAAmB,GAAG,EAAE,CAAC,GAAG,EAAE;gBAC3F,CAAC,CAAC,CAAC;YACL,kBAAkB,EAAE,QAAQ,CAAC,OAAO,CAAC,kBAAkB,IAAI,CAAC;SAC7D,CAAC;IACJ,CAAC;IAAC,MAAM,CAAC;QACP,gDAAgD;IAClD,CAAC;IAED,kBAAkB;IAClB,MAAM,SAAS,GAAG,IAAI,GAAG,EAAuB,CAAC;IACjD,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACzB,MAAM,MAAM,GAAG,IAAI,CAAC,MAAM,IAAI,gBAAgB,CAAC;QAC/C,MAAM,IAAI,GAAG,SAAS,CAAC,GAAG,CAAC,MAAM,CAAC,IAAI,EAAE,CAAC;QACzC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChB,SAAS,CAAC,GAAG,CAAC,MAAM,EAAE,IAAI,CAAC,CAAC;IAC9B,CAAC;IAED,MAAM,cAAc,GAAqB,EAAE,CAAC;IAC5C,KAAK,MAAM,CAAC,MAAM,EAAE,WAAW,CAAC,IAAI,SAAS,EAAE,CAAC;QAC9C,IAAI,MAAM,KAAK,gBAAgB;YAAE,SAAS;QAC1C,MAAM,KAAK,GAAG,WAAW,CAAC,MAAM,CAAC;QACjC,MAAM,IAAI,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,CAAC,CAAC,MAAM,CAAC;QACnE,MAAM,UAAU,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,aAAa,CAAC,CAAC,MAAM,CAAC;QAChF,MAAM,OAAO,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,OAAO,CAAC,CAAC,MAAM,CAAC;QACtF,cAAc,CAAC,IAAI,CAAC;YAClB,MAAM;YACN,KAAK;YACL,IAAI;YACJ,UAAU;YACV,OAAO;YACP,UAAU,EAAE,KAAK,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,IAAI,GAAG,KAAK,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;SAC7D,CAAC,CAAC;IACL,CAAC;IAED,cAAc,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,aAAa,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC;IAEhE,OAAO;QACL,UAAU;QACV,UAAU,EAAE,KAAK,CAAC,MAAM;QACxB,cAAc,EAAE,KAAK,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC,SAAS,CAAC,MAAM,GAAG,KAAK,CAAC,MAAM,CAAC,GAAG,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;QAC1F,kBAAkB;QAClB,QAAQ,EAAE,YAAY;QACtB,cAAc;KACf,CAAC;AACJ,CAAC"}

package/dist/core/insights/skill-recommender.d.ts

@@ -0,0 +1,21 @@
+import type { GraphDocument } from "../graph/graph-types.js";
+export interface SkillInfo {
+    name: string;
+    description: string;
+    category: string;
+    filePath: string;
+}
+export interface SkillRecommendation {
+    skill: string;
+    reason: string;
+    phase: string;
+}
+/**
+ * Scan skills directory for SKILL.md files and extract frontmatter.
+ */
+export declare function scanSkills(basePath: string): Promise<SkillInfo[]>;
+/**
+ * Generate skill recommendations based on current graph state.
+ */
+export declare function recommendSkills(doc: GraphDocument, availableSkills: SkillInfo[]): SkillRecommendation[];
+//# sourceMappingURL=skill-recommender.d.ts.map

package/dist/core/insights/skill-recommender.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"skill-recommender.d.ts","sourceRoot":"","sources":["../../../src/core/insights/skill-recommender.ts"],"names":[],"mappings":"AAEA,OAAO,KAAK,EAAE,aAAa,EAAE,MAAM,yBAAyB,CAAC;AAG7D,MAAM,WAAW,SAAS;IACxB,IAAI,EAAE,MAAM,CAAC;IACb,WAAW,EAAE,MAAM,CAAC;IACpB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED,MAAM,WAAW,mBAAmB;IAClC,KAAK,EAAE,MAAM,CAAC;IACd,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;CACf;AAED;;GAEG;AACH,wBAAsB,UAAU,CAAC,QAAQ,EAAE,MAAM,GAAG,OAAO,CAAC,SAAS,EAAE,CAAC,CA6BvE;AAgCD;;GAEG;AACH,wBAAgB,eAAe,CAC7B,GAAG,EAAE,aAAa,EAClB,eAAe,EAAE,SAAS,EAAE,GAC3B,mBAAmB,EAAE,CA8EvB"}