octie-cli 1.0.0

package/dist/cli/utils/helpers.d.ts

@@ -0,0 +1,126 @@
+/**
+ * CLI utility functions
+ */
+import type { TaskGraphStore } from '../../core/graph/index.js';
+/**
+ * Get the project path from options or auto-detect
+ */
+export declare function getProjectPath(projectOption?: string): Promise<string>;
+/**
+ * Load the project graph
+ */
+export declare function loadGraph(projectPath: string): Promise<TaskGraphStore>;
+/**
+ * Save the project graph
+ */
+export declare function saveGraph(projectPath: string, graph: TaskGraphStore): Promise<void>;
+/**
+ * Format success message
+ */
+export declare function success(message: string): void;
+/**
+ * Format error message
+ */
+export declare function error(message: string): void;
+/**
+ * Format warning message
+ */
+export declare function warning(message: string): void;
+/**
+ * Format info message
+ */
+export declare function info(message: string): void;
+/**
+ * Format verbose message (only shown if --verbose flag is set)
+ */
+export declare function verbose(message: string, verbose: boolean): void;
+/**
+ * Create a spinner for long-running operations
+ */
+export declare function createSpinner(message: string, enabled: boolean): {
+    start: () => void;
+    stop: (finalMessage: string) => void;
+    fail: (finalMessage: string) => void;
+};
+/**
+ * Parse comma-separated list
+ */
+export declare function parseList(value: string): string[];
+/**
+ * Parse multiple IDs from various formats
+ * Supports:
+ * - "id1","id2","id3" (quoted CSV format)
+ * - id1,id2,id3 (simple comma-separated)
+ * - Single ID (backward compatible)
+ *
+ * Used with Commander.js collector pattern:
+ * .option('--ids <id>', 'IDs to process', parseMultipleIds, [])
+ */
+export declare function parseMultipleIds(value: string, previous: string[]): string[];
+/**
+ * Validate UUID format
+ */
+export declare function isValidUUID(id: string): boolean;
+/**
+ * Format task ID for display
+ */
+export declare function formatTaskId(id: string): string;
+/**
+ * Format status for display
+ */
+export declare function formatStatus(status: string): string;
+/**
+ * Format priority for display
+ */
+export declare function formatPriority(priority: string): string;
+/**
+ * Truncate text to fit width
+ */
+export declare function truncate(text: string, maxWidth: number): string;
+/**
+ * Format error for CLI output
+ * Provides consistent error formatting with code, message, and suggestion
+ */
+export declare function formatError(error: unknown, verbose?: boolean): string;
+/**
+ * Get suggestion for an error code
+ * Returns a suggestion string for the given error code
+ */
+export declare function getErrorSuggestion(code: string): string | undefined;
+/**
+ * Exit with error message
+ * Formats and displays error, then exits with code 1
+ */
+export declare function exitWithError(error: unknown, verbose?: boolean): never;
+/**
+ * Retry options for recovery operations
+ */
+export interface RetryOptions {
+    /** Maximum number of retry attempts */
+    maxRetries: number;
+    /** Delay between retries in milliseconds */
+    delayMs: number;
+    /** Exponential backoff multiplier */
+    backoffMultiplier?: number;
+    /** Operation name for error messages */
+    operationName?: string;
+}
+/**
+ * Retry a function with exponential backoff
+ * Useful for file operations that may fail due to concurrent access
+ */
+export declare function withRetry<T>(fn: () => Promise<T>, options: RetryOptions): Promise<T>;
+/**
+ * Prompt user for confirmation
+ * Returns true if user confirms (y/yes), false otherwise
+ */
+export declare function confirmPrompt(message: string): Promise<boolean>;
+/**
+ * Attempt to recover from a corrupted project file
+ * Tries to restore from backup and provides actionable suggestions
+ */
+export declare function attemptRecovery(projectPath: string): Promise<{
+    success: boolean;
+    message: string;
+}>;
+//# sourceMappingURL=helpers.d.ts.map

package/dist/cli/utils/helpers.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.d.ts","sourceRoot":"","sources":["../../../src/cli/utils/helpers.ts"],"names":[],"mappings":"AAAA;;GAEG;AAKH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,2BAA2B,CAAC;AAGhE;;GAEG;AACH,wBAAsB,cAAc,CAAC,aAAa,CAAC,EAAE,MAAM,GAAG,OAAO,CAAC,MAAM,CAAC,CAc5E;AAED;;GAEG;AACH,wBAAsB,SAAS,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC,cAAc,CAAC,CAQ5E;AAED;;GAEG;AACH,wBAAsB,SAAS,CAAC,WAAW,EAAE,MAAM,EAAE,KAAK,EAAE,cAAc,GAAG,OAAO,CAAC,IAAI,CAAC,CAGzF;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAE7C;AAED;;GAEG;AACH,wBAAgB,KAAK,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAE3C;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAE7C;AAED;;GAEG;AACH,wBAAgB,IAAI,CAAC,OAAO,EAAE,MAAM,GAAG,IAAI,CAE1C;AAED;;GAEG;AACH,wBAAgB,OAAO,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO,GAAG,IAAI,CAI/D;AAED;;GAEG;AACH,wBAAgB,aAAa,CAAC,OAAO,EAAE,MAAM,EAAE,OAAO,EAAE,OAAO;;yBAetC,MAAM;yBASN,MAAM;EAU9B;AAED;;GAEG;AACH,wBAAgB,SAAS,CAAC,KAAK,EAAE,MAAM,GAAG,MAAM,EAAE,CAGjD;AAED;;;;;;;;;GASG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,EAAE,GAAG,MAAM,EAAE,CAuB5E;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,EAAE,EAAE,MAAM,GAAG,OAAO,CAI/C;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,EAAE,EAAE,MAAM,GAAG,MAAM,CAE/C;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,MAAM,EAAE,MAAM,GAAG,MAAM,CAcnD;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CASvD;AAED;;GAEG;AACH,wBAAgB,QAAQ,CAAC,IAAI,EAAE,MAAM,EAAE,QAAQ,EAAE,MAAM,GAAG,MAAM,CAG/D;AAED;;;GAGG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,GAAE,OAAe,GAAG,MAAM,CAwC5E;AAED;;;GAGG;AACH,wBAAgB,kBAAkB,CAAC,IAAI,EAAE,MAAM,GAAG,MAAM,GAAG,SAAS,CAEnE;AAED;;;GAGG;AACH,wBAAgB,aAAa,CAAC,KAAK,EAAE,OAAO,EAAE,OAAO,GAAE,OAAe,GAAG,KAAK,CAG7E;AAED;;GAEG;AACH,MAAM,WAAW,YAAY;IAC3B,uCAAuC;IACvC,UAAU,EAAE,MAAM,CAAC;IACnB,4CAA4C;IAC5C,OAAO,EAAE,MAAM,CAAC;IAChB,qCAAqC;IACrC,iBAAiB,CAAC,EAAE,MAAM,CAAC;IAC3B,wCAAwC;IACxC,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AAED;;;GAGG;AACH,wBAAsB,SAAS,CAAC,CAAC,EAC/B,EAAE,EAAE,MAAM,OAAO,CAAC,CAAC,CAAC,EACpB,OAAO,EAAE,YAAY,GACpB,OAAO,CAAC,CAAC,CAAC,CAwBZ;AAED;;;GAGG;AACH,wBAAsB,aAAa,CAAC,OAAO,EAAE,MAAM,GAAG,OAAO,CAAC,OAAO,CAAC,CAgBrE;AAED;;;GAGG;AACH,wBAAsB,eAAe,CAAC,WAAW,EAAE,MAAM,GAAG,OAAO,CAAC;IAAE,OAAO,EAAE,OAAO,CAAC;IAAC,OAAO,EAAE,MAAM,CAAA;CAAE,CAAC,CAyBzG"}

package/dist/cli/utils/helpers.js

@@ -0,0 +1,325 @@
+/**
+ * CLI utility functions
+ */
+import chalk from 'chalk';
+import path from 'node:path';
+import { findProjectPath, TaskStorage } from '../../core/storage/file-store.js';
+import { OctieError, ERROR_SUGGESTIONS } from '../../types/index.js';
+/**
+ * Get the project path from options or auto-detect
+ */
+export async function getProjectPath(projectOption) {
+    if (projectOption) {
+        return path.resolve(projectOption);
+    }
+    // Auto-detect project path
+    const detectedPath = await findProjectPath();
+    if (detectedPath) {
+        return detectedPath;
+    }
+    throw new Error('No Octie project found. Run `octie init` first or specify --project <path>');
+}
+/**
+ * Load the project graph
+ */
+export async function loadGraph(projectPath) {
+    const storage = new TaskStorage({ projectDir: projectPath });
+    if (!(await storage.exists())) {
+        throw new Error(`No Octie project found at ${projectPath}`);
+    }
+    return await storage.load();
+}
+/**
+ * Save the project graph
+ */
+export async function saveGraph(projectPath, graph) {
+    const storage = new TaskStorage({ projectDir: projectPath });
+    await storage.save(graph);
+}
+/**
+ * Format success message
+ */
+export function success(message) {
+    console.log(chalk.green('✓'), message);
+}
+/**
+ * Format error message
+ */
+export function error(message) {
+    console.error(chalk.red('✗'), message);
+}
+/**
+ * Format warning message
+ */
+export function warning(message) {
+    console.warn(chalk.yellow('⚠'), message);
+}
+/**
+ * Format info message
+ */
+export function info(message) {
+    console.log(chalk.blue('ℹ'), message);
+}
+/**
+ * Format verbose message (only shown if --verbose flag is set)
+ */
+export function verbose(message, verbose) {
+    if (verbose) {
+        console.log(chalk.gray(message));
+    }
+}
+/**
+ * Create a spinner for long-running operations
+ */
+export function createSpinner(message, enabled) {
+    // Simple spinner implementation
+    let dots = 0;
+    let interval = null;
+    return {
+        start: () => {
+            if (!enabled)
+                return;
+            process.stdout.write(`\r${chalk.cyan('○')} ${message}`);
+            interval = setInterval(() => {
+                dots = (dots + 1) % 4;
+                const dotStr = '.'.repeat(dots);
+                process.stdout.write(`\r${chalk.cyan('○')} ${message}${dotStr}`);
+            }, 100);
+        },
+        stop: (finalMessage) => {
+            if (interval) {
+                clearInterval(interval);
+                interval = null;
+            }
+            if (enabled) {
+                process.stdout.write(`\r${chalk.green('✓')} ${finalMessage}\n`);
+            }
+        },
+        fail: (finalMessage) => {
+            if (interval) {
+                clearInterval(interval);
+                interval = null;
+            }
+            if (enabled) {
+                process.stdout.write(`\r${chalk.red('✗')} ${finalMessage}\n`);
+            }
+        },
+    };
+}
+/**
+ * Parse comma-separated list
+ */
+export function parseList(value) {
+    if (!value)
+        return [];
+    return value.split(',').map(item => item.trim()).filter(Boolean);
+}
+/**
+ * Parse multiple IDs from various formats
+ * Supports:
+ * - "id1","id2","id3" (quoted CSV format)
+ * - id1,id2,id3 (simple comma-separated)
+ * - Single ID (backward compatible)
+ *
+ * Used with Commander.js collector pattern:
+ * .option('--ids <id>', 'IDs to process', parseMultipleIds, [])
+ */
+export function parseMultipleIds(value, previous) {
+    if (!value)
+        return previous;
+    // Check for quoted CSV format: "id1","id2","id3"
+    // This happens when user wraps in quotes to prevent shell parsing
+    const quotedCsvMatch = value.match(/^"([^"]+)"(?:,"([^"]+)")*/);
+    if (quotedCsvMatch) {
+        // Extract all quoted values
+        const quotedValues = value.match(/"([^"]+)"/g);
+        if (quotedValues) {
+            const ids = quotedValues.map(v => v.replace(/"/g, '').trim()).filter(Boolean);
+            return previous.concat(ids);
+        }
+    }
+    // Fall back to simple comma-separated: id1,id2,id3
+    if (value.includes(',')) {
+        const ids = value.split(',').map(item => item.trim()).filter(Boolean);
+        return previous.concat(ids);
+    }
+    // Single ID (backward compatible)
+    return previous.concat([value.trim()]);
+}
+/**
+ * Validate UUID format
+ */
+export function isValidUUID(id) {
+    const uuidRegex = /^[0-9a-f]{8}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{4}-[0-9a-f]{12}$/i;
+    return uuidRegex.test(id);
+}
+/**
+ * Format task ID for display
+ */
+export function formatTaskId(id) {
+    return chalk.cyan(id);
+}
+/**
+ * Format status for display
+ */
+export function formatStatus(status) {
+    const statusColors = {
+        ready: chalk.cyan,
+        in_progress: chalk.blue,
+        in_review: chalk.magenta,
+        completed: chalk.green,
+        blocked: chalk.red,
+        // Legacy status support (for backward compatibility with old data)
+        not_started: chalk.gray,
+        pending: chalk.yellow,
+    };
+    const colorFn = statusColors[status] || chalk.white;
+    return colorFn(status.replace('_', ' '));
+}
+/**
+ * Format priority for display
+ */
+export function formatPriority(priority) {
+    const priorityColors = {
+        top: chalk.red,
+        second: chalk.yellow,
+        later: chalk.gray,
+    };
+    const colorFn = priorityColors[priority] || chalk.white;
+    return colorFn(priority);
+}
+/**
+ * Truncate text to fit width
+ */
+export function truncate(text, maxWidth) {
+    if (text.length <= maxWidth)
+        return text;
+    return text.substring(0, maxWidth - 3) + '...';
+}
+/**
+ * Format error for CLI output
+ * Provides consistent error formatting with code, message, and suggestion
+ */
+export function formatError(error, verbose = false) {
+    // Handle OctieError with suggestion
+    if (error instanceof OctieError) {
+        const lines = [];
+        // Error header with code
+        lines.push(chalk.red.bold(`Error [${error.code}]:`) + ' ' + chalk.red(error.message));
+        // Add suggestion if available
+        if (error.suggestion) {
+            lines.push('');
+            lines.push(chalk.yellow('Suggestion:') + ' ' + error.suggestion);
+        }
+        // Add stack trace in verbose mode
+        if (verbose && error.stack) {
+            lines.push('');
+            lines.push(chalk.gray('Stack trace:'));
+            lines.push(chalk.gray(error.stack.split('\n').slice(1).join('\n')));
+        }
+        return lines.join('\n');
+    }
+    // Handle standard Error
+    if (error instanceof Error) {
+        const lines = [];
+        lines.push(chalk.red.bold('Error:') + ' ' + chalk.red(error.message));
+        if (verbose && error.stack) {
+            lines.push('');
+            lines.push(chalk.gray('Stack trace:'));
+            lines.push(chalk.gray(error.stack.split('\n').slice(1).join('\n')));
+        }
+        return lines.join('\n');
+    }
+    // Handle unknown error types
+    return chalk.red.bold('Error:') + ' ' + chalk.red(String(error));
+}
+/**
+ * Get suggestion for an error code
+ * Returns a suggestion string for the given error code
+ */
+export function getErrorSuggestion(code) {
+    return ERROR_SUGGESTIONS[code];
+}
+/**
+ * Exit with error message
+ * Formats and displays error, then exits with code 1
+ */
+export function exitWithError(error, verbose = false) {
+    console.error(formatError(error, verbose));
+    process.exit(1);
+}
+/**
+ * Retry a function with exponential backoff
+ * Useful for file operations that may fail due to concurrent access
+ */
+export async function withRetry(fn, options) {
+    const { maxRetries, delayMs, backoffMultiplier = 2, operationName = 'operation' } = options;
+    let lastError;
+    let currentDelay = delayMs;
+    for (let attempt = 1; attempt <= maxRetries; attempt++) {
+        try {
+            return await fn();
+        }
+        catch (error) {
+            lastError = error instanceof Error ? error : new Error(String(error));
+            if (attempt < maxRetries) {
+                if (process.env.VERBOSE === 'true') {
+                    console.log(chalk.yellow(`Retry ${attempt}/${maxRetries} for ${operationName} after ${currentDelay}ms...`));
+                }
+                await new Promise(resolve => setTimeout(resolve, currentDelay));
+                currentDelay *= backoffMultiplier;
+            }
+        }
+    }
+    throw new Error(`${operationName} failed after ${maxRetries} attempts. Last error: ${lastError?.message}`);
+}
+/**
+ * Prompt user for confirmation
+ * Returns true if user confirms (y/yes), false otherwise
+ */
+export async function confirmPrompt(message) {
+    const readline = await import('node:readline/promises');
+    const { stdin, stdout } = await import('node:process');
+    const rl = readline.createInterface({
+        input: stdin,
+        output: stdout,
+    });
+    try {
+        const answer = await rl.question(message + ' ');
+        const normalized = answer.trim().toLowerCase();
+        return normalized === 'y' || normalized === 'yes';
+    }
+    finally {
+        rl.close();
+    }
+}
+/**
+ * Attempt to recover from a corrupted project file
+ * Tries to restore from backup and provides actionable suggestions
+ */
+export async function attemptRecovery(projectPath) {
+    const storage = new TaskStorage({ projectDir: projectPath });
+    try {
+        // Check if backup exists
+        const backups = await storage.listBackups();
+        if (backups.length === 0) {
+            return {
+                success: false,
+                message: 'No backup files available for recovery. You may need to re-initialize the project.',
+            };
+        }
+        // Attempt to restore
+        await storage.restoreFromBackup();
+        return {
+            success: true,
+            message: `Successfully restored from backup: ${backups[0]}`,
+        };
+    }
+    catch (error) {
+        return {
+            success: false,
+            message: `Recovery failed: ${error instanceof Error ? error.message : String(error)}`,
+        };
+    }
+}
+//# sourceMappingURL=helpers.js.map

package/dist/cli/utils/helpers.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"helpers.js","sourceRoot":"","sources":["../../../src/cli/utils/helpers.ts"],"names":[],"mappings":"AAAA;;GAEG;AAEH,OAAO,KAAK,MAAM,OAAO,CAAC;AAC1B,OAAO,IAAI,MAAM,WAAW,CAAC;AAC7B,OAAO,EAAE,eAAe,EAAE,WAAW,EAAE,MAAM,kCAAkC,CAAC;AAEhF,OAAO,EAAE,UAAU,EAAE,iBAAiB,EAAE,MAAM,sBAAsB,CAAC;AAErE;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,cAAc,CAAC,aAAsB;IACzD,IAAI,aAAa,EAAE,CAAC;QAClB,OAAO,IAAI,CAAC,OAAO,CAAC,aAAa,CAAC,CAAC;IACrC,CAAC;IAED,2BAA2B;IAC3B,MAAM,YAAY,GAAG,MAAM,eAAe,EAAE,CAAC;IAC7C,IAAI,YAAY,EAAE,CAAC;QACjB,OAAO,YAAY,CAAC;IACtB,CAAC;IAED,MAAM,IAAI,KAAK,CACb,4EAA4E,CAC7E,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,WAAmB;IACjD,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC,CAAC;IAE7D,IAAI,CAAC,CAAC,MAAM,OAAO,CAAC,MAAM,EAAE,CAAC,EAAE,CAAC;QAC9B,MAAM,IAAI,KAAK,CAAC,6BAA6B,WAAW,EAAE,CAAC,CAAC;IAC9D,CAAC;IAED,OAAO,MAAM,OAAO,CAAC,IAAI,EAAE,CAAC;AAC9B,CAAC;AAED;;GAEG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAAC,WAAmB,EAAE,KAAqB;IACxE,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC,CAAC;IAC7D,MAAM,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;AAC5B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,OAAe;IACrC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,KAAK,CAAC,OAAe;IACnC,OAAO,CAAC,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,OAAe;IACrC,OAAO,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,IAAI,CAAC,OAAe;IAClC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,OAAO,CAAC,CAAC;AACxC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,OAAO,CAAC,OAAe,EAAE,OAAgB;IACvD,IAAI,OAAO,EAAE,CAAC;QACZ,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,CAAC,CAAC;IACnC,CAAC;AACH,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,aAAa,CAAC,OAAe,EAAE,OAAgB;IAC7D,gCAAgC;IAChC,IAAI,IAAI,GAAG,CAAC,CAAC;IACb,IAAI,QAAQ,GAA0B,IAAI,CAAC;IAE3C,OAAO;QACL,KAAK,EAAE,GAAG,EAAE;YACV,IAAI,CAAC,OAAO;gBAAE,OAAO;YACrB,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,OAAO,EAAE,CAAC,CAAC;YACxD,QAAQ,GAAG,WAAW,CAAC,GAAG,EAAE;gBAC1B,IAAI,GAAG,CAAC,IAAI,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC;gBACtB,MAAM,MAAM,GAAG,GAAG,CAAC,MAAM,CAAC,IAAI,CAAC,CAAC;gBAChC,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,OAAO,GAAG,MAAM,EAAE,CAAC,CAAC;YACnE,CAAC,EAAE,GAAG,CAAC,CAAC;QACV,CAAC;QACD,IAAI,EAAE,CAAC,YAAoB,EAAE,EAAE;YAC7B,IAAI,QAAQ,EAAE,CAAC;gBACb,aAAa,CAAC,QAAQ,CAAC,CAAC;gBACxB,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;YACD,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,YAAY,IAAI,CAAC,CAAC;YAClE,CAAC;QACH,CAAC;QACD,IAAI,EAAE,CAAC,YAAoB,EAAE,EAAE;YAC7B,IAAI,QAAQ,EAAE,CAAC;gBACb,aAAa,CAAC,QAAQ,CAAC,CAAC;gBACxB,QAAQ,GAAG,IAAI,CAAC;YAClB,CAAC;YACD,IAAI,OAAO,EAAE,CAAC;gBACZ,OAAO,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,YAAY,IAAI,CAAC,CAAC;YAChE,CAAC;QACH,CAAC;KACF,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,SAAS,CAAC,KAAa;IACrC,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IACtB,OAAO,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;AACnE,CAAC;AAED;;;;;;;;;GASG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa,EAAE,QAAkB;IAChE,IAAI,CAAC,KAAK;QAAE,OAAO,QAAQ,CAAC;IAE5B,iDAAiD;IACjD,kEAAkE;IAClE,MAAM,cAAc,GAAG,KAAK,CAAC,KAAK,CAAC,2BAA2B,CAAC,CAAC;IAChE,IAAI,cAAc,EAAE,CAAC;QACnB,4BAA4B;QAC5B,MAAM,YAAY,GAAG,KAAK,CAAC,KAAK,CAAC,YAAY,CAAC,CAAC;QAC/C,IAAI,YAAY,EAAE,CAAC;YACjB,MAAM,GAAG,GAAG,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;YAC9E,OAAO,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;QAC9B,CAAC;IACH,CAAC;IAED,mDAAmD;IACnD,IAAI,KAAK,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC;QACxB,MAAM,GAAG,GAAG,KAAK,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,IAAI,EAAE,CAAC,CAAC,MAAM,CAAC,OAAO,CAAC,CAAC;QACtE,OAAO,QAAQ,CAAC,MAAM,CAAC,GAAG,CAAC,CAAC;IAC9B,CAAC;IAED,kCAAkC;IAClC,OAAO,QAAQ,CAAC,MAAM,CAAC,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC,CAAC;AACzC,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,EAAU;IACpC,MAAM,SAAS,GACb,iEAAiE,CAAC;IACpE,OAAO,SAAS,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AAC5B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,EAAU;IACrC,OAAO,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;AACxB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,MAAc;IACzC,MAAM,YAAY,GAA4C;QAC5D,KAAK,EAAE,KAAK,CAAC,IAAI;QACjB,WAAW,EAAE,KAAK,CAAC,IAAI;QACvB,SAAS,EAAE,KAAK,CAAC,OAAO;QACxB,SAAS,EAAE,KAAK,CAAC,KAAK;QACtB,OAAO,EAAE,KAAK,CAAC,GAAG;QAClB,mEAAmE;QACnE,WAAW,EAAE,KAAK,CAAC,IAAI;QACvB,OAAO,EAAE,KAAK,CAAC,MAAM;KACtB,CAAC;IAEF,MAAM,OAAO,GAAG,YAAY,CAAC,MAAM,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC;IACpD,OAAO,OAAO,CAAC,MAAM,CAAC,OAAO,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;AAC3C,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,cAAc,CAAC,QAAgB;IAC7C,MAAM,cAAc,GAA4C;QAC9D,GAAG,EAAE,KAAK,CAAC,GAAG;QACd,MAAM,EAAE,KAAK,CAAC,MAAM;QACpB,KAAK,EAAE,KAAK,CAAC,IAAI;KAClB,CAAC;IAEF,MAAM,OAAO,GAAG,cAAc,CAAC,QAAQ,CAAC,IAAI,KAAK,CAAC,KAAK,CAAC;IACxD,OAAO,OAAO,CAAC,QAAQ,CAAC,CAAC;AAC3B,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,QAAQ,CAAC,IAAY,EAAE,QAAgB;IACrD,IAAI,IAAI,CAAC,MAAM,IAAI,QAAQ;QAAE,OAAO,IAAI,CAAC;IACzC,OAAO,IAAI,CAAC,SAAS,CAAC,CAAC,EAAE,QAAQ,GAAG,CAAC,CAAC,GAAG,KAAK,CAAC;AACjD,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,WAAW,CAAC,KAAc,EAAE,UAAmB,KAAK;IAClE,oCAAoC;IACpC,IAAI,KAAK,YAAY,UAAU,EAAE,CAAC;QAChC,MAAM,KAAK,GAAa,EAAE,CAAC;QAE3B,yBAAyB;QACzB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,UAAU,KAAK,CAAC,IAAI,IAAI,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAEtF,8BAA8B;QAC9B,IAAI,KAAK,CAAC,UAAU,EAAE,CAAC;YACrB,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,aAAa,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC,UAAU,CAAC,CAAC;QACnE,CAAC;QAED,kCAAkC;QAClC,IAAI,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtE,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,wBAAwB;IACxB,IAAI,KAAK,YAAY,KAAK,EAAE,CAAC;QAC3B,MAAM,KAAK,GAAa,EAAE,CAAC;QAC3B,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC;QAEtE,IAAI,OAAO,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;YAC3B,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YACf,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,cAAc,CAAC,CAAC,CAAC;YACvC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACtE,CAAC;QAED,OAAO,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC1B,CAAC;IAED,6BAA6B;IAC7B,OAAO,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,GAAG,GAAG,KAAK,CAAC,GAAG,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;AACnE,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,kBAAkB,CAAC,IAAY;IAC7C,OAAO,iBAAiB,CAAC,IAAI,CAAC,CAAC;AACjC,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,aAAa,CAAC,KAAc,EAAE,UAAmB,KAAK;IACpE,OAAO,CAAC,KAAK,CAAC,WAAW,CAAC,KAAK,EAAE,OAAO,CAAC,CAAC,CAAC;IAC3C,OAAO,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;AAClB,CAAC;AAgBD;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,SAAS,CAC7B,EAAoB,EACpB,OAAqB;IAErB,MAAM,EAAE,UAAU,EAAE,OAAO,EAAE,iBAAiB,GAAG,CAAC,EAAE,aAAa,GAAG,WAAW,EAAE,GAAG,OAAO,CAAC;IAC5F,IAAI,SAA4B,CAAC;IACjC,IAAI,YAAY,GAAG,OAAO,CAAC;IAE3B,KAAK,IAAI,OAAO,GAAG,CAAC,EAAE,OAAO,IAAI,UAAU,EAAE,OAAO,EAAE,EAAE,CAAC;QACvD,IAAI,CAAC;YACH,OAAO,MAAM,EAAE,EAAE,CAAC;QACpB,CAAC;QAAC,OAAO,KAAK,EAAE,CAAC;YACf,SAAS,GAAG,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,CAAC;YAEtE,IAAI,OAAO,GAAG,UAAU,EAAE,CAAC;gBACzB,IAAI,OAAO,CAAC,GAAG,CAAC,OAAO,KAAK,MAAM,EAAE,CAAC;oBACnC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,SAAS,OAAO,IAAI,UAAU,QAAQ,aAAa,UAAU,YAAY,OAAO,CAAC,CAAC,CAAC;gBAC9G,CAAC;gBACD,MAAM,IAAI,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,UAAU,CAAC,OAAO,EAAE,YAAY,CAAC,CAAC,CAAC;gBAChE,YAAY,IAAI,iBAAiB,CAAC;YACpC,CAAC;QACH,CAAC;IACH,CAAC;IAED,MAAM,IAAI,KAAK,CACb,GAAG,aAAa,iBAAiB,UAAU,0BAA0B,SAAS,EAAE,OAAO,EAAE,CAC1F,CAAC;AACJ,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,aAAa,CAAC,OAAe;IACjD,MAAM,QAAQ,GAAG,MAAM,MAAM,CAAC,wBAAwB,CAAC,CAAC;IACxD,MAAM,EAAE,KAAK,EAAE,MAAM,EAAE,GAAG,MAAM,MAAM,CAAC,cAAc,CAAC,CAAC;IAEvD,MAAM,EAAE,GAAG,QAAQ,CAAC,eAAe,CAAC;QAClC,KAAK,EAAE,KAAK;QACZ,MAAM,EAAE,MAAM;KACf,CAAC,CAAC;IAEH,IAAI,CAAC;QACH,MAAM,MAAM,GAAG,MAAM,EAAE,CAAC,QAAQ,CAAC,OAAO,GAAG,GAAG,CAAC,CAAC;QAChD,MAAM,UAAU,GAAG,MAAM,CAAC,IAAI,EAAE,CAAC,WAAW,EAAE,CAAC;QAC/C,OAAO,UAAU,KAAK,GAAG,IAAI,UAAU,KAAK,KAAK,CAAC;IACpD,CAAC;YAAS,CAAC;QACT,EAAE,CAAC,KAAK,EAAE,CAAC;IACb,CAAC;AACH,CAAC;AAED;;;GAGG;AACH,MAAM,CAAC,KAAK,UAAU,eAAe,CAAC,WAAmB;IACvD,MAAM,OAAO,GAAG,IAAI,WAAW,CAAC,EAAE,UAAU,EAAE,WAAW,EAAE,CAAC,CAAC;IAE7D,IAAI,CAAC;QACH,yBAAyB;QACzB,MAAM,OAAO,GAAG,MAAM,OAAO,CAAC,WAAW,EAAE,CAAC;QAC5C,IAAI,OAAO,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACzB,OAAO;gBACL,OAAO,EAAE,KAAK;gBACd,OAAO,EAAE,oFAAoF;aAC9F,CAAC;QACJ,CAAC;QAED,qBAAqB;QACrB,MAAM,OAAO,CAAC,iBAAiB,EAAE,CAAC;QAClC,OAAO;YACL,OAAO,EAAE,IAAI;YACb,OAAO,EAAE,sCAAsC,OAAO,CAAC,CAAC,CAAC,EAAE;SAC5D,CAAC;IACJ,CAAC;IAAC,OAAO,KAAK,EAAE,CAAC;QACf,OAAO;YACL,OAAO,EAAE,KAAK;YACd,OAAO,EAAE,oBAAoB,KAAK,YAAY,KAAK,CAAC,CAAC,CAAC,KAAK,CAAC,OAAO,CAAC,CAAC,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE;SACtF,CAAC;IACJ,CAAC;AACH,CAAC"}

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

@@ -0,0 +1,11 @@
+/**
+ * Graph algorithms entry point
+ *
+ * Exports all graph algorithm functions for convenient importing.
+ *
+ * @module core/graph/algorithms
+ */
+export { topologicalSort, findCriticalPath, isValidDAG, getExecutionLevels, clearSortCache, } from './sort.js';
+export { detectCycle, hasCycle, getCyclicNodes, findShortestCycle, findCyclesForTask, validateAcyclic, getCycleStatistics, wouldCreateCycle, } from './cycle.js';
+export { bfsTraversal, dfsFindPath, findAllPaths, findShortestPath, areConnected, getDistance, getConnectedComponents, } from './traversal.js';
+//# sourceMappingURL=algorithms.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"algorithms.d.ts","sourceRoot":"","sources":["../../../src/core/graph/algorithms.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,UAAU,EACV,kBAAkB,EAClB,cAAc,GACf,MAAM,WAAW,CAAC;AAGnB,OAAO,EACL,WAAW,EACX,QAAQ,EACR,cAAc,EACd,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,EACf,kBAAkB,EAClB,gBAAgB,GACjB,MAAM,YAAY,CAAC;AAGpB,OAAO,EACL,YAAY,EACZ,WAAW,EACX,YAAY,EACZ,gBAAgB,EAChB,YAAY,EACZ,WAAW,EACX,sBAAsB,GACvB,MAAM,gBAAgB,CAAC"}

package/dist/core/graph/algorithms.js

@@ -0,0 +1,14 @@
+/**
+ * Graph algorithms entry point
+ *
+ * Exports all graph algorithm functions for convenient importing.
+ *
+ * @module core/graph/algorithms
+ */
+// Topological sort
+export { topologicalSort, findCriticalPath, isValidDAG, getExecutionLevels, clearSortCache, } from './sort.js';
+// Cycle detection
+export { detectCycle, hasCycle, getCyclicNodes, findShortestCycle, findCyclesForTask, validateAcyclic, getCycleStatistics, wouldCreateCycle, } from './cycle.js';
+// Traversal
+export { bfsTraversal, dfsFindPath, findAllPaths, findShortestPath, areConnected, getDistance, getConnectedComponents, } from './traversal.js';
+//# sourceMappingURL=algorithms.js.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"algorithms.js","sourceRoot":"","sources":["../../../src/core/graph/algorithms.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,mBAAmB;AACnB,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,UAAU,EACV,kBAAkB,EAClB,cAAc,GACf,MAAM,WAAW,CAAC;AAEnB,kBAAkB;AAClB,OAAO,EACL,WAAW,EACX,QAAQ,EACR,cAAc,EACd,iBAAiB,EACjB,iBAAiB,EACjB,eAAe,EACf,kBAAkB,EAClB,gBAAgB,GACjB,MAAM,YAAY,CAAC;AAEpB,YAAY;AACZ,OAAO,EACL,YAAY,EACZ,WAAW,EACX,YAAY,EACZ,gBAAgB,EAChB,YAAY,EACZ,WAAW,EACX,sBAAsB,GACvB,MAAM,gBAAgB,CAAC"}

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

@@ -0,0 +1,155 @@
+/**
+ * Graph cycle detection algorithms
+ *
+ * Implements DFS-based cycle detection with three-color marking.
+ * Detects all cycles and returns cycle paths for debugging.
+ * Time complexity: O(V + E) where V = vertices, E = edges
+ *
+ * @module core/graph/cycle
+ */
+import type { TaskGraphStore } from './index.js';
+import type { CycleDetectionResult } from '../../types/index.js';
+/**
+ * Detect cycles using DFS with three-color marking
+ *
+ * Algorithm:
+ * 1. Mark all nodes as WHITE (unvisited)
+ * 2. For each WHITE node, start DFS traversal
+ * 3. Mark node as GRAY when entering, BLACK when exiting
+ * 4. If we encounter a GRAY node during traversal, we found a cycle
+ * 5. Check for self-loops (task blocking itself) before DFS
+ * 6. Reconstruct cycle path using parent pointers
+ *
+ * Time Complexity: O(V + E)
+ * Space Complexity: O(V) for recursion stack and state tracking
+ *
+ * @param graph - Task graph store
+ * @returns Cycle detection result with all detected cycles
+ *
+ * @example
+ * ```ts
+ * const result = detectCycle(graph);
+ * if (result.hasCycle) {
+ *   console.error('Found cycles:', result.cycles);
+ *   for (const cycle of result.cycles) {
+ *     console.error('Cycle:', cycle.join(' -> '));
+ *   }
+ * }
+ * ```
+ */
+export declare function detectCycle(graph: TaskGraphStore): CycleDetectionResult;
+/**
+ * Check if a graph contains any cycles
+ * Convenience function that returns a boolean
+ *
+ * @param graph - Task graph store
+ * @returns true if graph contains at least one cycle
+ */
+export declare function hasCycle(graph: TaskGraphStore): boolean;
+/**
+ * Get all nodes involved in cycles
+ *
+ * @param graph - Task graph store
+ * @returns Set of task IDs that are part of at least one cycle
+ */
+export declare function getCyclicNodes(graph: TaskGraphStore): Set<string>;
+/**
+ * Find the shortest cycle in the graph
+ * Useful for identifying the most critical circular dependency
+ *
+ * @param graph - Task graph store
+ * @returns Shortest cycle array, or empty array if no cycles
+ */
+export declare function findShortestCycle(graph: TaskGraphStore): string[];
+/**
+ * Find all cycles involving a specific task
+ *
+ * @param graph - Task graph store
+ * @param taskId - Task ID to find cycles for
+ * @returns Array of cycles that include the specified task
+ */
+export declare function findCyclesForTask(graph: TaskGraphStore, taskId: string): string[][];
+/**
+ * Validate that a graph is acyclic (DAG)
+ * Throws an error if cycles are detected
+ *
+ * @param graph - Task graph store
+ * @throws {CircularDependencyError} If graph contains cycles
+ */
+export declare function validateAcyclic(graph: TaskGraphStore): void;
+/**
+ * Get cycle statistics
+ *
+ * @param graph - Task graph store
+ * @returns Object with cycle count and nodes in cycles
+ */
+export declare function getCycleStatistics(graph: TaskGraphStore): {
+    cycleCount: number;
+    nodesInCycles: number;
+    totalNodes: number;
+    cyclesByLength: Record<number, number>;
+};
+/**
+ * Result of reference validation
+ */
+export interface ReferenceValidationResult {
+    /** True if any invalid references were found */
+    hasInvalidReferences: boolean;
+    /** List of invalid references found */
+    invalidReferences: Array<{
+        /** Task ID that has the invalid reference */
+        taskId: string;
+        /** Blocker ID that doesn't exist */
+        invalidBlockerId: string;
+    }>;
+}
+/**
+ * Validate that all blocker references point to existing tasks
+ *
+ * Checks each task's blockers array to ensure all referenced tasks exist.
+ * This catches orphaned references that could occur from:
+ * - Manual JSON editing
+ * - Bugs in edge manipulation
+ * - Incomplete graph operations
+ *
+ * @param graph - Task graph store
+ * @returns Validation result with any invalid references found
+ *
+ * @example
+ * ```ts
+ * const result = validateReferences(graph);
+ * if (result.hasInvalidReferences) {
+ *   for (const ref of result.invalidReferences) {
+ *     console.error(`Task ${ref.taskId} has missing blocker: ${ref.invalidBlockerId}`);
+ *   }
+ * }
+ * ```
+ */
+export declare function validateReferences(graph: TaskGraphStore): ReferenceValidationResult;
+/**
+ * Check if adding an edge would create a cycle
+ *
+ * When adding a blocker relationship (blockerId → taskId), this function
+ * checks if there's already a path from taskId to blockerId. If so,
+ * adding the edge would create a cycle.
+ *
+ * Also rejects self-blocking (taskId === blockerId).
+ *
+ * @param graph - Task graph store
+ * @param blockerId - The task that will block (source of edge)
+ * @param taskId - The task being blocked (target of edge)
+ * @returns true if adding this edge would create a cycle
+ *
+ * @example
+ * ```ts
+ * // Before adding blocker, check for cycle
+ * if (wouldCreateCycle(graph, blockerId, taskId)) {
+ *   console.error('Cannot add blocker: would create a cycle');
+ * } else {
+ *   task.addBlocker(blockerId);
+ *   graph.addEdge(blockerId, taskId);
+ * }
+ * ```
+ */
+export declare function wouldCreateCycle(graph: TaskGraphStore, blockerId: string, taskId: string): boolean;
+//# sourceMappingURL=cycle.d.ts.map

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

@@ -0,0 +1 @@
+{"version":3,"file":"cycle.d.ts","sourceRoot":"","sources":["../../../src/core/graph/cycle.ts"],"names":[],"mappings":"AAAA;;;;;;;;GAQG;AAEH,OAAO,KAAK,EAAE,cAAc,EAAE,MAAM,YAAY,CAAC;AACjD,OAAO,KAAK,EAAE,oBAAoB,EAAE,MAAM,sBAAsB,CAAC;AAajE;;;;;;;;;;;;;;;;;;;;;;;;;;;GA2BG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,cAAc,GAAG,oBAAoB,CA4EvE;AAED;;;;;;GAMG;AACH,wBAAgB,QAAQ,CAAC,KAAK,EAAE,cAAc,GAAG,OAAO,CAGvD;AAED;;;;;GAKG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,cAAc,GAAG,GAAG,CAAC,MAAM,CAAC,CAWjE;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,cAAc,GAAG,MAAM,EAAE,CAUjE;AAED;;;;;;GAMG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,cAAc,EAAE,MAAM,EAAE,MAAM,GAAG,MAAM,EAAE,EAAE,CAInF;AAED;;;;;;GAMG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,cAAc,GAAG,IAAI,CAU3D;AAED;;;;;GAKG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,cAAc,GAAG;IACzD,UAAU,EAAE,MAAM,CAAC;IACnB,aAAa,EAAE,MAAM,CAAC;IACtB,UAAU,EAAE,MAAM,CAAC;IACnB,cAAc,EAAE,MAAM,CAAC,MAAM,EAAE,MAAM,CAAC,CAAC;CACxC,CAgBA;AAED;;GAEG;AACH,MAAM,WAAW,yBAAyB;IACxC,gDAAgD;IAChD,oBAAoB,EAAE,OAAO,CAAC;IAC9B,uCAAuC;IACvC,iBAAiB,EAAE,KAAK,CAAC;QACvB,6CAA6C;QAC7C,MAAM,EAAE,MAAM,CAAC;QACf,oCAAoC;QACpC,gBAAgB,EAAE,MAAM,CAAC;KAC1B,CAAC,CAAC;CACJ;AAED;;;;;;;;;;;;;;;;;;;;;GAqBG;AACH,wBAAgB,kBAAkB,CAAC,KAAK,EAAE,cAAc,GAAG,yBAAyB,CAkBnF;AAED;;;;;;;;;;;;;;;;;;;;;;;;GAwBG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,cAAc,EACrB,SAAS,EAAE,MAAM,EACjB,MAAM,EAAE,MAAM,GACb,OAAO,CAkCT"}