@hongmaple0820/med-scale-research-os 0.43.0

package/dist/workflow/TaskArtifactScaffolder.js

@@ -0,0 +1,333 @@
+import { appendFileSync, existsSync, mkdirSync, readFileSync, writeFileSync } from 'node:fs';
+import { isAbsolute, join, resolve } from 'node:path';
+import { governanceTemplateContent } from './GovernanceTemplates.js';
+import { skillPlanMarkdown } from '../skills/routing/index.js';
+import { renderContextGrillPrompt } from './ContextGovernance.js';
+import { renderDiagnosticLoopMarkdown } from './DiagnosticLoop.js';
+import { evaluateTddSlice, renderTddSliceMarkdown } from './TddLoop.js';
+const TASK_ARTIFACTS = [
+    'explore.md',
+    'mini-prd.md',
+    'skill-plan.md',
+    'plan.md',
+    'runtime.md',
+    'reality-check.md',
+    'resource-cleanup.md',
+    'verification.md',
+    'review.md',
+    'summary.md',
+];
+export function scaffoldTaskArtifacts(options) {
+    if (options.level === 'S')
+        return { created: [], skipped: [] };
+    const projectDir = resolve(options.projectDir ?? process.cwd());
+    const relativeDir = join('.planning', 'tasks', `${currentDate()}-${slugify(options.taskName || options.description || options.taskId)}`);
+    const dir = uniqueDirectory(projectDir, relativeDir, options.taskId);
+    const result = {
+        relativeDir: relativePath(projectDir, dir),
+        dir,
+        created: [],
+        skipped: [],
+    };
+    if (!existsSync(dir))
+        mkdirSync(dir, { recursive: true });
+    const artifacts = unique([
+        ...TASK_ARTIFACTS,
+        ...(options.skillPlan?.requiredArtifacts ?? []),
+    ]);
+    for (const name of artifacts) {
+        const target = join(dir, name);
+        if (existsSync(target)) {
+            result.skipped.push(target);
+            continue;
+        }
+        const template = name === 'skill-plan.md' && options.skillPlan
+            ? skillPlanMarkdown(options.skillPlan)
+            : readTemplate(projectDir, name);
+        const content = name === 'skill-plan.md' && options.skillPlan
+            ? template
+            : injectTaskMetadata(template, options);
+        writeFileSync(target, content, 'utf-8');
+        result.created.push(target);
+    }
+    return result;
+}
+export function appendVerificationArtifact(options) {
+    if (!options.artifactsDir)
+        return null;
+    const projectDir = resolve(options.projectDir ?? process.cwd());
+    const dir = isAbsolute(options.artifactsDir) ? options.artifactsDir : resolve(projectDir, options.artifactsDir);
+    if (!existsSync(dir))
+        return null;
+    const target = join(dir, 'verification.md');
+    if (!existsSync(target)) {
+        writeFileSync(target, injectTaskMetadata(readTemplate(projectDir, 'verification.md'), {
+            projectDir,
+            taskId: options.taskId,
+            taskName: options.taskId,
+            description: '',
+            level: 'M',
+            services: options.services,
+        }), 'utf-8');
+    }
+    appendFileSync(target, verificationRunMarkdown(options), 'utf-8');
+    return target;
+}
+export function appendContextGrillArtifact(options) {
+    return appendTaskArtifactSection({
+        projectDir: options.projectDir,
+        artifactsDir: options.artifactsDir,
+        fileName: 'explore.md',
+        title: 'SCALE Context Grill',
+        content: renderContextGrillPrompt(options.report),
+    });
+}
+export function appendDiagnosticLoopArtifact(options) {
+    const validationLines = [
+        `Ready: ${options.validation.ready}`,
+        ...options.validation.blockers.map(blocker => `Blocker: ${blocker}`),
+        ...options.validation.warnings.map(warning => `Warning: ${warning}`),
+    ];
+    return appendTaskArtifactSection({
+        projectDir: options.projectDir,
+        artifactsDir: options.artifactsDir,
+        fileName: 'plan.md',
+        title: 'SCALE Diagnostic Loop',
+        content: `${renderDiagnosticLoopMarkdown(options.loop)}\n\n## Validation\n${validationLines.map(line => `- ${line}`).join('\n')}`,
+    });
+}
+export function appendTddSliceArtifact(options) {
+    const evaluation = evaluateTddSlice(options.slice);
+    const evaluationLines = [
+        `Ready for implementation: ${evaluation.readyForImplementation}`,
+        `Ready for completion: ${evaluation.readyForCompletion}`,
+        ...evaluation.blockers.map(blocker => `Blocker: ${blocker}`),
+        ...evaluation.warnings.map(warning => `Warning: ${warning}`),
+    ];
+    return appendTaskArtifactSection({
+        projectDir: options.projectDir,
+        artifactsDir: options.artifactsDir,
+        fileName: 'verification.md',
+        title: 'SCALE TDD Vertical Slice',
+        content: `${renderTddSliceMarkdown(options.slice)}\n\n## Evaluation\n${evaluationLines.map(line => `- ${line}`).join('\n')}`,
+    });
+}
+export function checkTaskArtifactCompleteness(options) {
+    if (options.level === 'S') {
+        return { complete: true, artifactsDir: options.artifactsDir, required: [], missing: [], incomplete: [] };
+    }
+    if (!options.artifactsDir) {
+        const required = requiredArtifactsForLevel(options.level, options.skillRequiredArtifacts);
+        return {
+            complete: false,
+            required,
+            missing: required,
+            incomplete: [],
+        };
+    }
+    const projectDir = resolve(options.projectDir ?? process.cwd());
+    const dir = isAbsolute(options.artifactsDir) ? options.artifactsDir : resolve(projectDir, options.artifactsDir);
+    const required = requiredArtifactsForLevel(options.level, options.skillRequiredArtifacts);
+    const missing = [];
+    const incomplete = [];
+    for (const file of required) {
+        const path = join(dir, file);
+        if (!existsSync(path)) {
+            missing.push(file);
+            continue;
+        }
+        const reason = incompleteReason(file, readFileSync(path, 'utf-8'), options.level);
+        if (reason)
+            incomplete.push({ file, reason });
+    }
+    return {
+        complete: missing.length === 0 && incomplete.length === 0,
+        artifactsDir: dir,
+        required,
+        missing,
+        incomplete,
+    };
+}
+function verificationRunMarkdown(options) {
+    const rows = options.gateResults.flatMap(result => (result.evidenceItems ?? []).map(item => {
+        const command = item.command ?? item.label;
+        const resultText = item.passed ? 'PASS' : 'FAIL';
+        const notes = [
+            `gate=${result.gate}`,
+            item.cwd ? `cwd=${item.cwd}` : '',
+            typeof item.exitCode === 'number' ? `exit=${item.exitCode}` : '',
+            item.outputHash ? `hash=${item.outputHash}` : '',
+        ].filter(Boolean).join('; ');
+        return `| ${escapeCell(command)} | ${resultText} | ${escapeCell(notes || item.detail)} |`;
+    }));
+    return `
+## SCALE Verification Run - ${new Date().toISOString()}
+
+Profile: ${options.profile}
+Services: ${options.services.length ? options.services.join(', ') : 'root'}
+Final Status: ${options.passed ? 'passed' : 'failed'}
+
+| Command | Result | Notes |
+| --- | --- | --- |
+${rows.length ? rows.join('\n') : '| no command evidence | FAIL | no evidence items recorded |'}
+`;
+}
+function appendTaskArtifactSection(options) {
+    if (!options.artifactsDir)
+        return null;
+    const projectDir = resolve(options.projectDir ?? process.cwd());
+    const dir = isAbsolute(options.artifactsDir) ? options.artifactsDir : resolve(projectDir, options.artifactsDir);
+    if (!existsSync(dir))
+        mkdirSync(dir, { recursive: true });
+    const target = join(dir, options.fileName);
+    if (!existsSync(target))
+        writeFileSync(target, `# ${options.fileName}\n`, 'utf-8');
+    appendFileSync(target, `\n\n## ${options.title} - ${new Date().toISOString()}\n\n${options.content}\n`, 'utf-8');
+    return target;
+}
+function readTemplate(projectDir, name) {
+    const templatePath = join(projectDir, 'docs', 'workflow', 'templates', name);
+    if (existsSync(templatePath))
+        return readFileSync(templatePath, 'utf-8');
+    return isGovernanceTemplateName(name)
+        ? governanceTemplateContent(name)
+        : `# ${name}\n\n## Evidence\n\n\n`;
+}
+function requiredArtifactsForLevel(level, skillRequiredArtifacts = []) {
+    if (level === 'S')
+        return [];
+    const required = [
+        'explore.md',
+        'skill-plan.md',
+        'plan.md',
+        'runtime.md',
+        'reality-check.md',
+        'resource-cleanup.md',
+        'verification.md',
+        'review.md',
+        'summary.md',
+    ];
+    if (level === 'L' || level === 'CRITICAL')
+        required.splice(1, 0, 'mini-prd.md');
+    return unique([...required, ...skillRequiredArtifacts]);
+}
+function incompleteReason(file, content, level) {
+    if (file === 'verification.md' && /SCALE Verification Run|Final Status:\s*(passed|failed)|\|\s*[^|\s][^|]*\|\s*(PASS|FAIL)/i.test(content)) {
+        return null;
+    }
+    if (file === 'reality-check.md') {
+        const requiredHeadings = [
+            '## Confirmed',
+            '## Not Verified',
+            '## Stub / Fake / Partial',
+            '## Credential-Gated',
+            '## Environment-Gated',
+            '## User-Visible Risk',
+        ];
+        const missing = requiredHeadings.filter(heading => !content.includes(heading));
+        if (missing.length > 0)
+            return `missing reality sections: ${missing.join(', ')}`;
+    }
+    if (file === 'plan.md' && (level === 'L' || level === 'CRITICAL') && !/human confirmation|review before execution|operator confirmation|执行前确认|人工确认/i.test(content)) {
+        return 'L/CRITICAL plan must record human confirmation or review-before-execution requirement';
+    }
+    const substantive = substantiveLines(content);
+    const minimumLines = file === 'mini-prd.md'
+        ? 3
+        : file === 'skill-plan.md'
+            ? 1
+            : file === 'reality-check.md'
+                ? 6
+                : 2;
+    if (substantive.length < minimumLines) {
+        return `contains only template placeholders (${substantive.length}/${minimumLines} substantive lines)`;
+    }
+    return null;
+}
+function substantiveLines(content) {
+    return content
+        .split(/\r?\n/)
+        .map(line => line.trim())
+        .filter(line => line.length > 0)
+        .filter(line => !line.startsWith('#'))
+        .filter(line => !line.startsWith('**Task ID**:'))
+        .filter(line => !line.startsWith('**Task**:'))
+        .filter(line => !line.startsWith('**Level**:'))
+        .filter(line => !line.startsWith('**Services**:'))
+        .filter(line => !line.startsWith('**Created**:'))
+        .filter(line => !/^tbd$/i.test(line))
+        .filter(line => !/^\|/.test(line))
+        .filter(line => !/^\|?[\s:-]+\|[\s|:-]*$/.test(line))
+        .filter(line => !/^[-*]\s*(\[ \])?\s*(tbd)?$/i.test(line))
+        .filter(line => !/^\d+\.\s*(tbd)?$/i.test(line))
+        .filter(line => !/^\*Generated by SCALE Engine/i.test(line));
+}
+function injectTaskMetadata(template, options) {
+    const metadata = [
+        `**Task ID**: ${options.taskId}`,
+        `**Task**: ${options.taskName}`,
+        `**Level**: ${options.level}`,
+        `**Services**: ${options.services?.length ? options.services.join(', ') : 'unspecified'}`,
+        `**Created**: ${new Date().toISOString()}`,
+        '',
+    ].join('\n');
+    return template.replace(/^(# .+\n)/, `$1\n${metadata}`);
+}
+function uniqueDirectory(projectDir, relativeDir, taskId) {
+    const preferred = resolve(projectDir, relativeDir);
+    if (!existsSync(preferred))
+        return preferred;
+    const summary = join(preferred, 'summary.md');
+    if (existsSync(summary) && readFileSync(summary, 'utf-8').includes(`**Task ID**: ${taskId}`)) {
+        return preferred;
+    }
+    return resolve(projectDir, `${relativeDir}-${slugify(taskId).slice(0, 16)}`);
+}
+function relativePath(projectDir, path) {
+    return path.startsWith(projectDir)
+        ? path.slice(projectDir.length + 1).replace(/\\/g, '/')
+        : path.replace(/\\/g, '/');
+}
+function currentDate() {
+    return new Date().toISOString().slice(0, 10);
+}
+function slugify(value) {
+    const slug = value
+        .toLowerCase()
+        .replace(/[^a-z0-9]+/g, '-')
+        .replace(/^-+|-+$/g, '')
+        .slice(0, 48);
+    return slug || 'task';
+}
+function escapeCell(value) {
+    return value.replace(/\|/g, '\\|').replace(/\r?\n/g, ' ');
+}
+function isGovernanceTemplateName(name) {
+    return [
+        'explore.md',
+        'mini-prd.md',
+        'skill-plan.md',
+        'skill-evidence.md',
+        'runtime.md',
+        'reality-check.md',
+        'resource-cleanup.md',
+        'ui-spec.md',
+        'visual-review.md',
+        'api-contract.md',
+        'docs-impact.md',
+        'resource-impact.md',
+        'standards-impact.md',
+        'architecture-review.md',
+        'security-review.md',
+        'db-change-plan.md',
+        'e2e-plan.md',
+        'plan.md',
+        'verification.md',
+        'review.md',
+        'summary.md',
+    ].includes(name);
+}
+function unique(items) {
+    return [...new Set(items)];
+}
+//# sourceMappingURL=TaskArtifactScaffolder.js.map

package/dist/workflow/TaskArtifactScaffolder.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"TaskArtifactScaffolder.js","sourceRoot":"","sources":["../../src/workflow/TaskArtifactScaffolder.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,cAAc,EAAE,UAAU,EAAE,SAAS,EAAE,YAAY,EAAE,aAAa,EAAE,MAAM,SAAS,CAAA;AAC5F,OAAO,EAAE,UAAU,EAAE,IAAI,EAAE,OAAO,EAAE,MAAM,WAAW,CAAA;AACrD,OAAO,EAAE,yBAAyB,EAAuC,MAAM,0BAA0B,CAAA;AAEzG,OAAO,EAAE,iBAAiB,EAAkB,MAAM,4BAA4B,CAAA;AAC9E,OAAO,EAAE,wBAAwB,EAAgC,MAAM,wBAAwB,CAAA;AAC/F,OAAO,EAAE,4BAA4B,EAAkD,MAAM,qBAAqB,CAAA;AAClH,OAAO,EAAE,gBAAgB,EAAE,sBAAsB,EAAiB,MAAM,cAAc,CAAA;AAsEtF,MAAM,cAAc,GAAqC;IACvD,YAAY;IACZ,aAAa;IACb,eAAe;IACf,SAAS;IACT,YAAY;IACZ,kBAAkB;IAClB,qBAAqB;IACrB,iBAAiB;IACjB,WAAW;IACX,YAAY;CACb,CAAA;AAED,MAAM,UAAU,qBAAqB,CAAC,OAAoC;IACxE,IAAI,OAAO,CAAC,KAAK,KAAK,GAAG;QAAE,OAAO,EAAE,OAAO,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,CAAA;IAE9D,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;IAC/D,MAAM,WAAW,GAAG,IAAI,CAAC,WAAW,EAAE,OAAO,EAAE,GAAG,WAAW,EAAE,IAAI,OAAO,CAAC,OAAO,CAAC,QAAQ,IAAI,OAAO,CAAC,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC,EAAE,CAAC,CAAA;IACxI,MAAM,GAAG,GAAG,eAAe,CAAC,UAAU,EAAE,WAAW,EAAE,OAAO,CAAC,MAAM,CAAC,CAAA;IACpE,MAAM,MAAM,GAA+B;QACzC,WAAW,EAAE,YAAY,CAAC,UAAU,EAAE,GAAG,CAAC;QAC1C,GAAG;QACH,OAAO,EAAE,EAAE;QACX,OAAO,EAAE,EAAE;KACZ,CAAA;IACD,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;IAEzD,MAAM,SAAS,GAAG,MAAM,CAAC;QACvB,GAAG,cAAc;QACjB,GAAG,CAAC,OAAO,CAAC,SAAS,EAAE,iBAAiB,IAAI,EAAE,CAAC;KAChD,CAAC,CAAA;IAEF,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAC9B,IAAI,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;YACvB,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;YAC3B,SAAQ;QACV,CAAC;QACD,MAAM,QAAQ,GAAG,IAAI,KAAK,eAAe,IAAI,OAAO,CAAC,SAAS;YAC5D,CAAC,CAAC,iBAAiB,CAAC,OAAO,CAAC,SAAS,CAAC;YACtC,CAAC,CAAC,YAAY,CAAC,UAAU,EAAE,IAAI,CAAC,CAAA;QAClC,MAAM,OAAO,GAAG,IAAI,KAAK,eAAe,IAAI,OAAO,CAAC,SAAS;YAC3D,CAAC,CAAC,QAAQ;YACV,CAAC,CAAC,kBAAkB,CAAC,QAAQ,EAAE,OAAO,CAAC,CAAA;QACzC,aAAa,CAAC,MAAM,EAAE,OAAO,EAAE,OAAO,CAAC,CAAA;QACvC,MAAM,CAAC,OAAO,CAAC,IAAI,CAAC,MAAM,CAAC,CAAA;IAC7B,CAAC;IAED,OAAO,MAAM,CAAA;AACf,CAAC;AAED,MAAM,UAAU,0BAA0B,CAAC,OAA0C;IACnF,IAAI,CAAC,OAAO,CAAC,YAAY;QAAE,OAAO,IAAI,CAAA;IACtC,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;IAC/D,MAAM,GAAG,GAAG,UAAU,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;IAC/G,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,OAAO,IAAI,CAAA;IACjC,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,iBAAiB,CAAC,CAAA;IAC3C,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC,EAAE,CAAC;QACxB,aAAa,CAAC,MAAM,EAAE,kBAAkB,CAAC,YAAY,CAAC,UAAU,EAAE,iBAAiB,CAAC,EAAE;YACpF,UAAU;YACV,MAAM,EAAE,OAAO,CAAC,MAAM;YACtB,QAAQ,EAAE,OAAO,CAAC,MAAM;YACxB,WAAW,EAAE,EAAE;YACf,KAAK,EAAE,GAAG;YACV,QAAQ,EAAE,OAAO,CAAC,QAAQ;SAC3B,CAAC,EAAE,OAAO,CAAC,CAAA;IACd,CAAC;IAED,cAAc,CAAC,MAAM,EAAE,uBAAuB,CAAC,OAAO,CAAC,EAAE,OAAO,CAAC,CAAA;IACjE,OAAO,MAAM,CAAA;AACf,CAAC;AAED,MAAM,UAAU,0BAA0B,CAAC,OAA0C;IACnF,OAAO,yBAAyB,CAAC;QAC/B,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,YAAY,EAAE,OAAO,CAAC,YAAY;QAClC,QAAQ,EAAE,YAAY;QACtB,KAAK,EAAE,qBAAqB;QAC5B,OAAO,EAAE,wBAAwB,CAAC,OAAO,CAAC,MAAM,CAAC;KAClD,CAAC,CAAA;AACJ,CAAC;AAED,MAAM,UAAU,4BAA4B,CAAC,OAA4C;IACvF,MAAM,eAAe,GAAG;QACtB,UAAU,OAAO,CAAC,UAAU,CAAC,KAAK,EAAE;QACpC,GAAG,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,YAAY,OAAO,EAAE,CAAC;QACpE,GAAG,OAAO,CAAC,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,YAAY,OAAO,EAAE,CAAC;KACrE,CAAA;IACD,OAAO,yBAAyB,CAAC;QAC/B,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,YAAY,EAAE,OAAO,CAAC,YAAY;QAClC,QAAQ,EAAE,SAAS;QACnB,KAAK,EAAE,uBAAuB;QAC9B,OAAO,EAAE,GAAG,4BAA4B,CAAC,OAAO,CAAC,IAAI,CAAC,sBAAsB,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;KAClI,CAAC,CAAA;AACJ,CAAC;AAED,MAAM,UAAU,sBAAsB,CAAC,OAAsC;IAC3E,MAAM,UAAU,GAAG,gBAAgB,CAAC,OAAO,CAAC,KAAK,CAAC,CAAA;IAClD,MAAM,eAAe,GAAG;QACtB,6BAA6B,UAAU,CAAC,sBAAsB,EAAE;QAChE,yBAAyB,UAAU,CAAC,kBAAkB,EAAE;QACxD,GAAG,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,YAAY,OAAO,EAAE,CAAC;QAC5D,GAAG,UAAU,CAAC,QAAQ,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,YAAY,OAAO,EAAE,CAAC;KAC7D,CAAA;IACD,OAAO,yBAAyB,CAAC;QAC/B,UAAU,EAAE,OAAO,CAAC,UAAU;QAC9B,YAAY,EAAE,OAAO,CAAC,YAAY;QAClC,QAAQ,EAAE,iBAAiB;QAC3B,KAAK,EAAE,0BAA0B;QACjC,OAAO,EAAE,GAAG,sBAAsB,CAAC,OAAO,CAAC,KAAK,CAAC,sBAAsB,eAAe,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE;KAC7H,CAAC,CAAA;AACJ,CAAC;AAED,MAAM,UAAU,6BAA6B,CAAC,OAAiC;IAC7E,IAAI,OAAO,CAAC,KAAK,KAAK,GAAG,EAAE,CAAC;QAC1B,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,YAAY,EAAE,OAAO,CAAC,YAAY,EAAE,QAAQ,EAAE,EAAE,EAAE,OAAO,EAAE,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAA;IAC1G,CAAC;IACD,IAAI,CAAC,OAAO,CAAC,YAAY,EAAE,CAAC;QAC1B,MAAM,QAAQ,GAAG,yBAAyB,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,sBAAsB,CAAC,CAAA;QACzF,OAAO;YACL,QAAQ,EAAE,KAAK;YACf,QAAQ;YACR,OAAO,EAAE,QAAQ;YACjB,UAAU,EAAE,EAAE;SACf,CAAA;IACH,CAAC;IAED,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;IAC/D,MAAM,GAAG,GAAG,UAAU,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;IAC/G,MAAM,QAAQ,GAAG,yBAAyB,CAAC,OAAO,CAAC,KAAK,EAAE,OAAO,CAAC,sBAAsB,CAAC,CAAA;IACzF,MAAM,OAAO,GAAa,EAAE,CAAA;IAC5B,MAAM,UAAU,GAAiC,EAAE,CAAA;IAEnD,KAAK,MAAM,IAAI,IAAI,QAAQ,EAAE,CAAC;QAC5B,MAAM,IAAI,GAAG,IAAI,CAAC,GAAG,EAAE,IAAI,CAAC,CAAA;QAC5B,IAAI,CAAC,UAAU,CAAC,IAAI,CAAC,EAAE,CAAC;YACtB,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;YAClB,SAAQ;QACV,CAAC;QACD,MAAM,MAAM,GAAG,gBAAgB,CAAC,IAAI,EAAE,YAAY,CAAC,IAAI,EAAE,OAAO,CAAC,EAAE,OAAO,CAAC,KAAK,CAAC,CAAA;QACjF,IAAI,MAAM;YAAE,UAAU,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,MAAM,EAAE,CAAC,CAAA;IAC/C,CAAC;IAED,OAAO;QACL,QAAQ,EAAE,OAAO,CAAC,MAAM,KAAK,CAAC,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QACzD,YAAY,EAAE,GAAG;QACjB,QAAQ;QACR,OAAO;QACP,UAAU;KACX,CAAA;AACH,CAAC;AAED,SAAS,uBAAuB,CAAC,OAA0C;IACzE,MAAM,IAAI,GAAG,OAAO,CAAC,WAAW,CAAC,OAAO,CAAC,MAAM,CAAC,EAAE,CAChD,CAAC,MAAM,CAAC,aAAa,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE;QACtC,MAAM,OAAO,GAAG,IAAI,CAAC,OAAO,IAAI,IAAI,CAAC,KAAK,CAAA;QAC1C,MAAM,UAAU,GAAG,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC,CAAC,MAAM,CAAA;QAChD,MAAM,KAAK,GAAG;YACZ,QAAQ,MAAM,CAAC,IAAI,EAAE;YACrB,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,OAAO,IAAI,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC,EAAE;YACjC,OAAO,IAAI,CAAC,QAAQ,KAAK,QAAQ,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,QAAQ,EAAE,CAAC,CAAC,CAAC,EAAE;YAChE,IAAI,CAAC,UAAU,CAAC,CAAC,CAAC,QAAQ,IAAI,CAAC,UAAU,EAAE,CAAC,CAAC,CAAC,EAAE;SACjD,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;QAC5B,OAAO,KAAK,UAAU,CAAC,OAAO,CAAC,MAAM,UAAU,MAAM,UAAU,CAAC,KAAK,IAAI,IAAI,CAAC,MAAM,CAAC,IAAI,CAAA;IAC3F,CAAC,CAAC,CACH,CAAA;IACD,OAAO;8BACqB,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;;WAE3C,OAAO,CAAC,OAAO;YACd,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,MAAM;gBAC1D,OAAO,CAAC,MAAM,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,QAAQ;;;;EAIlD,IAAI,CAAC,MAAM,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,6DAA6D;CAC9F,CAAA;AACD,CAAC;AAED,SAAS,yBAAyB,CAAC,OAMlC;IACC,IAAI,CAAC,OAAO,CAAC,YAAY;QAAE,OAAO,IAAI,CAAA;IACtC,MAAM,UAAU,GAAG,OAAO,CAAC,OAAO,CAAC,UAAU,IAAI,OAAO,CAAC,GAAG,EAAE,CAAC,CAAA;IAC/D,MAAM,GAAG,GAAG,UAAU,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,CAAC,OAAO,CAAC,YAAY,CAAC,CAAC,CAAC,OAAO,CAAC,UAAU,EAAE,OAAO,CAAC,YAAY,CAAC,CAAA;IAC/G,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC;QAAE,SAAS,CAAC,GAAG,EAAE,EAAE,SAAS,EAAE,IAAI,EAAE,CAAC,CAAA;IACzD,MAAM,MAAM,GAAG,IAAI,CAAC,GAAG,EAAE,OAAO,CAAC,QAAQ,CAAC,CAAA;IAC1C,IAAI,CAAC,UAAU,CAAC,MAAM,CAAC;QAAE,aAAa,CAAC,MAAM,EAAE,KAAK,OAAO,CAAC,QAAQ,IAAI,EAAE,OAAO,CAAC,CAAA;IAClF,cAAc,CAAC,MAAM,EAAE,UAAU,OAAO,CAAC,KAAK,MAAM,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,OAAO,OAAO,CAAC,OAAO,IAAI,EAAE,OAAO,CAAC,CAAA;IAChH,OAAO,MAAM,CAAA;AACf,CAAC;AAED,SAAS,YAAY,CAAC,UAAkB,EAAE,IAAY;IACpD,MAAM,YAAY,GAAG,IAAI,CAAC,UAAU,EAAE,MAAM,EAAE,UAAU,EAAE,WAAW,EAAE,IAAI,CAAC,CAAA;IAC5E,IAAI,UAAU,CAAC,YAAY,CAAC;QAAE,OAAO,YAAY,CAAC,YAAY,EAAE,OAAO,CAAC,CAAA;IACxE,OAAO,wBAAwB,CAAC,IAAI,CAAC;QACnC,CAAC,CAAC,yBAAyB,CAAC,IAAI,CAAC;QACjC,CAAC,CAAC,KAAK,IAAI,uBAAuB,CAAA;AACtC,CAAC;AAED,SAAS,yBAAyB,CAAC,KAAwB,EAAE,yBAAmC,EAAE;IAChG,IAAI,KAAK,KAAK,GAAG;QAAE,OAAO,EAAE,CAAA;IAC5B,MAAM,QAAQ,GAAa;QACzB,YAAY;QACZ,eAAe;QACf,SAAS;QACT,YAAY;QACZ,kBAAkB;QAClB,qBAAqB;QACrB,iBAAiB;QACjB,WAAW;QACX,YAAY;KACb,CAAA;IACD,IAAI,KAAK,KAAK,GAAG,IAAI,KAAK,KAAK,UAAU;QAAE,QAAQ,CAAC,MAAM,CAAC,CAAC,EAAE,CAAC,EAAE,aAAa,CAAC,CAAA;IAC/E,OAAO,MAAM,CAAC,CAAC,GAAG,QAAQ,EAAE,GAAG,sBAAsB,CAAC,CAAC,CAAA;AACzD,CAAC;AAED,SAAS,gBAAgB,CAAC,IAAY,EAAE,OAAe,EAAE,KAAwB;IAC/E,IAAI,IAAI,KAAK,iBAAiB,IAAI,0FAA0F,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QAC3I,OAAO,IAAI,CAAA;IACb,CAAC;IACD,IAAI,IAAI,KAAK,kBAAkB,EAAE,CAAC;QAChC,MAAM,gBAAgB,GAAG;YACvB,cAAc;YACd,iBAAiB;YACjB,0BAA0B;YAC1B,qBAAqB;YACrB,sBAAsB;YACtB,sBAAsB;SACvB,CAAA;QACD,MAAM,OAAO,GAAG,gBAAgB,CAAC,MAAM,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,OAAO,CAAC,CAAC,CAAA;QAC9E,IAAI,OAAO,CAAC,MAAM,GAAG,CAAC;YAAE,OAAO,6BAA6B,OAAO,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAA;IAClF,CAAC;IACD,IAAI,IAAI,KAAK,SAAS,IAAI,CAAC,KAAK,KAAK,GAAG,IAAI,KAAK,KAAK,UAAU,CAAC,IAAI,CAAC,8EAA8E,CAAC,IAAI,CAAC,OAAO,CAAC,EAAE,CAAC;QACnK,OAAO,uFAAuF,CAAA;IAChG,CAAC;IAED,MAAM,WAAW,GAAG,gBAAgB,CAAC,OAAO,CAAC,CAAA;IAC7C,MAAM,YAAY,GAAG,IAAI,KAAK,aAAa;QACzC,CAAC,CAAC,CAAC;QACH,CAAC,CAAC,IAAI,KAAK,eAAe;YACxB,CAAC,CAAC,CAAC;YACH,CAAC,CAAC,IAAI,KAAK,kBAAkB;gBAC3B,CAAC,CAAC,CAAC;gBACH,CAAC,CAAC,CAAC,CAAA;IACT,IAAI,WAAW,CAAC,MAAM,GAAG,YAAY,EAAE,CAAC;QACtC,OAAO,wCAAwC,WAAW,CAAC,MAAM,IAAI,YAAY,qBAAqB,CAAA;IACxG,CAAC;IACD,OAAO,IAAI,CAAA;AACb,CAAC;AAED,SAAS,gBAAgB,CAAC,OAAe;IACvC,OAAO,OAAO;SACX,KAAK,CAAC,OAAO,CAAC;SACd,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC;SACxB,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,MAAM,GAAG,CAAC,CAAC;SAC/B,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC;SACrC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;SAChD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,WAAW,CAAC,CAAC;SAC7C,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,YAAY,CAAC,CAAC;SAC9C,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,eAAe,CAAC,CAAC;SACjD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,UAAU,CAAC,cAAc,CAAC,CAAC;SAChD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACpC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACjC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,wBAAwB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACpD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,6BAA6B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SACzD,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,mBAAmB,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;SAC/C,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,+BAA+B,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAA;AAChE,CAAC;AAED,SAAS,kBAAkB,CAAC,QAAgB,EAAE,OAAoC;IAChF,MAAM,QAAQ,GAAG;QACf,gBAAgB,OAAO,CAAC,MAAM,EAAE;QAChC,aAAa,OAAO,CAAC,QAAQ,EAAE;QAC/B,cAAc,OAAO,CAAC,KAAK,EAAE;QAC7B,iBAAiB,OAAO,CAAC,QAAQ,EAAE,MAAM,CAAC,CAAC,CAAC,OAAO,CAAC,QAAQ,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,aAAa,EAAE;QACzF,gBAAgB,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,EAAE;QAC1C,EAAE;KACH,CAAC,IAAI,CAAC,IAAI,CAAC,CAAA;IACZ,OAAO,QAAQ,CAAC,OAAO,CAAC,WAAW,EAAE,OAAO,QAAQ,EAAE,CAAC,CAAA;AACzD,CAAC;AAED,SAAS,eAAe,CAAC,UAAkB,EAAE,WAAmB,EAAE,MAAc;IAC9E,MAAM,SAAS,GAAG,OAAO,CAAC,UAAU,EAAE,WAAW,CAAC,CAAA;IAClD,IAAI,CAAC,UAAU,CAAC,SAAS,CAAC;QAAE,OAAO,SAAS,CAAA;IAC5C,MAAM,OAAO,GAAG,IAAI,CAAC,SAAS,EAAE,YAAY,CAAC,CAAA;IAC7C,IAAI,UAAU,CAAC,OAAO,CAAC,IAAI,YAAY,CAAC,OAAO,EAAE,OAAO,CAAC,CAAC,QAAQ,CAAC,gBAAgB,MAAM,EAAE,CAAC,EAAE,CAAC;QAC7F,OAAO,SAAS,CAAA;IAClB,CAAC;IACD,OAAO,OAAO,CAAC,UAAU,EAAE,GAAG,WAAW,IAAI,OAAO,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,CAAC,CAAA;AAC9E,CAAC;AAED,SAAS,YAAY,CAAC,UAAkB,EAAE,IAAY;IACpD,OAAO,IAAI,CAAC,UAAU,CAAC,UAAU,CAAC;QAChC,CAAC,CAAC,IAAI,CAAC,KAAK,CAAC,UAAU,CAAC,MAAM,GAAG,CAAC,CAAC,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC;QACvD,CAAC,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,CAAC,CAAA;AAC9B,CAAC;AAED,SAAS,WAAW;IAClB,OAAO,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;AAC9C,CAAC;AAED,SAAS,OAAO,CAAC,KAAa;IAC5B,MAAM,IAAI,GAAG,KAAK;SACf,WAAW,EAAE;SACb,OAAO,CAAC,aAAa,EAAE,GAAG,CAAC;SAC3B,OAAO,CAAC,UAAU,EAAE,EAAE,CAAC;SACvB,KAAK,CAAC,CAAC,EAAE,EAAE,CAAC,CAAA;IACf,OAAO,IAAI,IAAI,MAAM,CAAA;AACvB,CAAC;AAED,SAAS,UAAU,CAAC,KAAa;IAC/B,OAAO,KAAK,CAAC,OAAO,CAAC,KAAK,EAAE,KAAK,CAAC,CAAC,OAAO,CAAC,QAAQ,EAAE,GAAG,CAAC,CAAA;AAC3D,CAAC;AAED,SAAS,wBAAwB,CAAC,IAAY;IAC5C,OAAO;QACL,YAAY;QACZ,aAAa;QACb,eAAe;QACf,mBAAmB;QACnB,YAAY;QACZ,kBAAkB;QAClB,qBAAqB;QACrB,YAAY;QACZ,kBAAkB;QAClB,iBAAiB;QACjB,gBAAgB;QAChB,oBAAoB;QACpB,qBAAqB;QACrB,wBAAwB;QACxB,oBAAoB;QACpB,mBAAmB;QACnB,aAAa;QACb,SAAS;QACT,iBAAiB;QACjB,WAAW;QACX,YAAY;KACb,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAA;AAClB,CAAC;AAED,SAAS,MAAM,CAAI,KAAU;IAC3B,OAAO,CAAC,GAAG,IAAI,GAAG,CAAC,KAAK,CAAC,CAAC,CAAA;AAC5B,CAAC"}

package/dist/workflow/TaskDependencyGraph.d.ts

@@ -0,0 +1,73 @@
+export type DependencyType = 'blocks' | 'soft-dep' | 'data-flow';
+export interface TaskNode {
+    taskId: string;
+    sessionId: string;
+    files: string[];
+    status: 'planned' | 'active' | 'blocked' | 'done' | 'failed';
+    startedAt?: string;
+    completedAt?: string;
+    metadata?: Record<string, unknown>;
+}
+export interface DependencyEdge {
+    from: string;
+    to: string;
+    type: DependencyType;
+    reason: string;
+}
+export interface TaskDependencyGraphOptions {
+    maxTasks?: number;
+}
+export interface TopologyResult {
+    order: string[];
+    levels: string[][];
+    hasCycle: boolean;
+    cyclePath?: string[];
+}
+export interface BlockedTask {
+    taskId: string;
+    waitingFor: string[];
+    reason: string[];
+}
+export interface DependencyGraphSummary {
+    totalTasks: number;
+    totalEdges: number;
+    completedTasks: number;
+    activeTasks: number;
+    blockedTasks: number;
+    readyTasks: string[];
+    longestPath: number;
+}
+export declare class TaskDependencyGraph {
+    private nodes;
+    private edges;
+    private maxTasks;
+    constructor(options?: TaskDependencyGraphOptions);
+    addTask(task: TaskNode): void;
+    removeTask(taskId: string): void;
+    addDependency(edge: DependencyEdge): {
+        ok: boolean;
+        error?: string;
+    };
+    getTask(taskId: string): TaskNode | undefined;
+    updateTaskStatus(taskId: string, status: TaskNode['status']): void;
+    getDependencies(taskId: string): DependencyEdge[];
+    getDependents(taskId: string): DependencyEdge[];
+    getBlockedTasks(): BlockedTask[];
+    getReadyTasks(): string[];
+    topologicalSort(): TopologyResult;
+    summarize(): DependencyGraphSummary;
+    listTasks(): TaskNode[];
+    listEdges(): DependencyEdge[];
+    toJSON(): {
+        nodes: TaskNode[];
+        edges: DependencyEdge[];
+    };
+    static fromJSON(data: {
+        nodes: TaskNode[];
+        edges: DependencyEdge[];
+    }): TaskDependencyGraph;
+    private detectCycleWithEdge;
+    private findCycle;
+    private dfsCycle;
+    private computeLongestPath;
+}

package/dist/workflow/TaskDependencyGraph.js

@@ -0,0 +1,245 @@
+// SCALE Engine — Task Dependency Graph (v0.36.0)
+// Dependency declaration, topological sort, cycle detection for parallel task coordination
+export class TaskDependencyGraph {
+    constructor(options = {}) {
+        this.nodes = new Map();
+        this.edges = [];
+        this.maxTasks = options.maxTasks ?? 100;
+    }
+    addTask(task) {
+        if (this.nodes.size >= this.maxTasks && !this.nodes.has(task.taskId)) {
+            throw new Error(`Task graph capacity (${this.maxTasks}) reached`);
+        }
+        this.nodes.set(task.taskId, task);
+    }
+    removeTask(taskId) {
+        this.nodes.delete(taskId);
+        this.edges = this.edges.filter(e => e.from !== taskId && e.to !== taskId);
+    }
+    addDependency(edge) {
+        if (!this.nodes.has(edge.from)) {
+            return { ok: false, error: `Source task "${edge.from}" not found` };
+        }
+        if (!this.nodes.has(edge.to)) {
+            return { ok: false, error: `Target task "${edge.to}" not found` };
+        }
+        if (edge.from === edge.to) {
+            return { ok: false, error: 'Self-dependency is not allowed' };
+        }
+        // Check for duplicate
+        const exists = this.edges.some(e => e.from === edge.from && e.to === edge.to);
+        if (exists)
+            return { ok: true };
+        // Check if adding this edge creates a cycle
+        const cycle = this.detectCycleWithEdge(edge);
+        if (cycle) {
+            return { ok: false, error: `Dependency creates cycle: ${cycle.join(' → ')}` };
+        }
+        this.edges.push(edge);
+        return { ok: true };
+    }
+    getTask(taskId) {
+        return this.nodes.get(taskId);
+    }
+    updateTaskStatus(taskId, status) {
+        const node = this.nodes.get(taskId);
+        if (!node)
+            return;
+        node.status = status;
+        if (status === 'done' || status === 'failed') {
+            node.completedAt = new Date().toISOString();
+        }
+    }
+    getDependencies(taskId) {
+        return this.edges.filter(e => e.to === taskId);
+    }
+    getDependents(taskId) {
+        return this.edges.filter(e => e.from === taskId);
+    }
+    getBlockedTasks() {
+        const blocked = [];
+        for (const [taskId, node] of this.nodes) {
+            if (node.status === 'done' || node.status === 'failed')
+                continue;
+            const deps = this.getDependencies(taskId);
+            const waitingFor = [];
+            const reason = [];
+            for (const dep of deps) {
+                const depNode = this.nodes.get(dep.from);
+                if (depNode && depNode.status !== 'done') {
+                    waitingFor.push(dep.from);
+                    reason.push(`${dep.from} (${depNode.status}): ${dep.reason}`);
+                }
+            }
+            if (waitingFor.length > 0) {
+                blocked.push({ taskId, waitingFor, reason });
+            }
+        }
+        return blocked;
+    }
+    getReadyTasks() {
+        const ready = [];
+        for (const [taskId, node] of this.nodes) {
+            if (node.status !== 'planned')
+                continue;
+            const deps = this.getDependencies(taskId);
+            const allMet = deps.every(dep => {
+                const depNode = this.nodes.get(dep.from);
+                return depNode?.status === 'done';
+            });
+            if (allMet)
+                ready.push(taskId);
+        }
+        return ready;
+    }
+    topologicalSort() {
+        const ids = [...this.nodes.keys()];
+        const inDegree = new Map();
+        const adjList = new Map();
+        for (const id of ids) {
+            inDegree.set(id, 0);
+            adjList.set(id, []);
+        }
+        for (const edge of this.edges) {
+            adjList.get(edge.from).push(edge.to);
+            inDegree.set(edge.to, (inDegree.get(edge.to) ?? 0) + 1);
+        }
+        // Kahn's algorithm with level tracking
+        const queue = [];
+        for (const [id, deg] of inDegree) {
+            if (deg === 0)
+                queue.push(id);
+        }
+        const order = [];
+        const levels = [];
+        while (queue.length > 0) {
+            const levelSize = queue.length;
+            const currentLevel = [];
+            for (let i = 0; i < levelSize; i++) {
+                const current = queue.shift();
+                currentLevel.push(current);
+                order.push(current);
+                for (const neighbor of adjList.get(current) ?? []) {
+                    const newDeg = inDegree.get(neighbor) - 1;
+                    inDegree.set(neighbor, newDeg);
+                    if (newDeg === 0)
+                        queue.push(neighbor);
+                }
+            }
+            levels.push(currentLevel);
+        }
+        if (order.length !== ids.length) {
+            // Find the cycle
+            const cycle = this.findCycle();
+            return { order, levels, hasCycle: true, cyclePath: cycle ?? undefined };
+        }
+        return { order, levels, hasCycle: false };
+    }
+    summarize() {
+        const nodes = [...this.nodes.values()];
+        const totalTasks = nodes.length;
+        const completedTasks = nodes.filter(n => n.status === 'done').length;
+        const activeTasks = nodes.filter(n => n.status === 'active').length;
+        const blockedTasks = this.getBlockedTasks().length;
+        const readyTasks = this.getReadyTasks();
+        const longestPath = this.computeLongestPath();
+        return {
+            totalTasks,
+            totalEdges: this.edges.length,
+            completedTasks,
+            activeTasks,
+            blockedTasks,
+            readyTasks,
+            longestPath,
+        };
+    }
+    listTasks() {
+        return [...this.nodes.values()];
+    }
+    listEdges() {
+        return [...this.edges];
+    }
+    toJSON() {
+        return { nodes: this.listTasks(), edges: this.listEdges() };
+    }
+    static fromJSON(data) {
+        const graph = new TaskDependencyGraph({ maxTasks: data.nodes.length + 50 });
+        for (const node of data.nodes)
+            graph.addTask(node);
+        for (const edge of data.edges)
+            graph.addDependency(edge);
+        return graph;
+    }
+    // --- Private ---
+    detectCycleWithEdge(newEdge) {
+        this.edges.push(newEdge);
+        const cycle = this.findCycle();
+        this.edges.pop();
+        return cycle;
+    }
+    findCycle() {
+        const visited = new Set();
+        const inStack = new Set();
+        const parent = new Map();
+        const adjList = new Map();
+        for (const id of this.nodes.keys())
+            adjList.set(id, []);
+        for (const edge of this.edges)
+            adjList.get(edge.from)?.push(edge.to);
+        for (const start of this.nodes.keys()) {
+            if (visited.has(start))
+                continue;
+            const result = this.dfsCycle(start, visited, inStack, parent, adjList);
+            if (result)
+                return result;
+        }
+        return null;
+    }
+    dfsCycle(current, visited, inStack, parent, adjList) {
+        visited.add(current);
+        inStack.add(current);
+        for (const neighbor of adjList.get(current) ?? []) {
+            if (!visited.has(neighbor)) {
+                parent.set(neighbor, current);
+                const result = this.dfsCycle(neighbor, visited, inStack, parent, adjList);
+                if (result)
+                    return result;
+            }
+            else if (inStack.has(neighbor)) {
+                // Reconstruct cycle
+                const cycle = [neighbor, current];
+                let node = current;
+                while (node !== neighbor) {
+                    node = parent.get(node);
+                    cycle.push(node);
+                }
+                return cycle.reverse();
+            }
+        }
+        inStack.delete(current);
+        return null;
+    }
+    computeLongestPath() {
+        const topo = this.topologicalSort();
+        if (topo.hasCycle)
+            return -1;
+        const dist = new Map();
+        for (const id of this.nodes.keys())
+            dist.set(id, 0);
+        const adjList = new Map();
+        for (const id of this.nodes.keys())
+            adjList.set(id, []);
+        for (const edge of this.edges)
+            adjList.get(edge.from)?.push(edge.to);
+        for (const node of topo.order) {
+            for (const neighbor of adjList.get(node) ?? []) {
+                dist.set(neighbor, Math.max(dist.get(neighbor), dist.get(node) + 1));
+            }
+        }
+        let max = 0;
+        for (const d of dist.values())
+            max = Math.max(max, d);
+        return max;
+    }
+}
+//# sourceMappingURL=TaskDependencyGraph.js.map