@task-mcp/shared 0.1.0

package/dist/algorithms/critical-path.d.ts

@@ -0,0 +1,46 @@
+import type { Task } from "../schemas/task.js";
+/**
+ * Task with computed CPM (Critical Path Method) values
+ */
+export interface CPMTask extends Task {
+    earliestStart: number;
+    earliestFinish: number;
+    latestStart: number;
+    latestFinish: number;
+    slack: number;
+    isCritical: boolean;
+    dependentCount: number;
+}
+/**
+ * Result of critical path analysis
+ */
+export interface CPMResult {
+    tasks: CPMTask[];
+    criticalPath: CPMTask[];
+    projectDuration: number;
+    bottlenecks: CPMTask[];
+}
+/**
+ * Perform Critical Path Method analysis
+ *
+ * CPM calculates:
+ * - Earliest Start (ES): Earliest a task can start
+ * - Earliest Finish (EF): ES + duration
+ * - Latest Finish (LF): Latest a task can finish without delaying project
+ * - Latest Start (LS): LF - duration
+ * - Slack: LS - ES (or LF - EF)
+ * - Critical Path: Tasks with slack = 0
+ */
+export declare function criticalPathAnalysis(tasks: Task[]): CPMResult;
+/**
+ * Find tasks that can be executed in parallel (no dependencies between them)
+ */
+export declare function findParallelTasks(tasks: Task[]): Task[][];
+/**
+ * Suggest the next best task to work on
+ */
+export declare function suggestNextTask(tasks: Task[], options?: {
+    contexts?: string[];
+    maxMinutes?: number;
+}): Task | null;
+//# sourceMappingURL=critical-path.d.ts.map

package/dist/algorithms/critical-path.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"critical-path.d.ts","sourceRoot":"","sources":["../../src/algorithms/critical-path.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAC;AAG/C;;GAEG;AACH,MAAM,WAAW,OAAQ,SAAQ,IAAI;IAEnC,aAAa,EAAE,MAAM,CAAC;IACtB,cAAc,EAAE,MAAM,CAAC;IACvB,WAAW,EAAE,MAAM,CAAC;IACpB,YAAY,EAAE,MAAM,CAAC;IACrB,KAAK,EAAE,MAAM,CAAC;IACd,UAAU,EAAE,OAAO,CAAC;IACpB,cAAc,EAAE,MAAM,CAAC;CACxB;AAED;;GAEG;AACH,MAAM,WAAW,SAAS;IACxB,KAAK,EAAE,OAAO,EAAE,CAAC;IACjB,YAAY,EAAE,OAAO,EAAE,CAAC;IACxB,eAAe,EAAE,MAAM,CAAC;IACxB,WAAW,EAAE,OAAO,EAAE,CAAC;CACxB;AAiMD;;;;;;;;;;GAUG;AACH,wBAAgB,oBAAoB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,SAAS,CAgD7D;AAED;;GAEG;AACH,wBAAgB,iBAAiB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,EAAE,CAiDzD;AAED;;GAEG;AACH,wBAAgB,eAAe,CAC7B,KAAK,EAAE,IAAI,EAAE,EACb,OAAO,GAAE;IACP,QAAQ,CAAC,EAAE,MAAM,EAAE,CAAC;IACpB,UAAU,CAAC,EAAE,MAAM,CAAC;CAChB,GACL,IAAI,GAAG,IAAI,CAyDb"}

package/dist/algorithms/critical-path.js

@@ -0,0 +1,308 @@
+import { topologicalSort, findDependents } from "./topological-sort.js";
+/** Default task duration if no estimate provided */
+const DEFAULT_DURATION = 30;
+/**
+ * Get task duration with fallback to default
+ */
+function getTaskDuration(task) {
+    return task.estimate?.expected ?? DEFAULT_DURATION;
+}
+/**
+ * Get blocked_by dependencies for a task
+ */
+function getBlockedByDeps(task) {
+    return (task.dependencies ?? [])
+        .filter((d) => d.type === "blocked_by")
+        .map((d) => d.taskId);
+}
+/**
+ * Initialize CPM tasks with default values
+ */
+function initializeCPMTasks(sortedTasks) {
+    const taskMap = new Map();
+    for (const task of sortedTasks) {
+        const duration = getTaskDuration(task);
+        taskMap.set(task.id, {
+            ...task,
+            earliestStart: 0,
+            earliestFinish: duration,
+            latestStart: Infinity,
+            latestFinish: Infinity,
+            slack: 0,
+            isCritical: false,
+            dependentCount: 0,
+        });
+    }
+    return taskMap;
+}
+/**
+ * Forward pass: Calculate earliest start/finish times
+ * ES = max(EF of all predecessors)
+ * EF = ES + duration
+ */
+function forwardPass(sortedTasks, taskMap) {
+    for (const task of sortedTasks) {
+        const cpmTask = taskMap.get(task.id);
+        if (!cpmTask)
+            continue;
+        const duration = getTaskDuration(task);
+        const deps = getBlockedByDeps(task);
+        // Find maximum EF among predecessors
+        let maxPredecessorEF = 0;
+        for (const depId of deps) {
+            const dep = taskMap.get(depId);
+            if (dep) {
+                maxPredecessorEF = Math.max(maxPredecessorEF, dep.earliestFinish);
+            }
+        }
+        cpmTask.earliestStart = maxPredecessorEF;
+        cpmTask.earliestFinish = cpmTask.earliestStart + duration;
+    }
+}
+/**
+ * Calculate project duration (maximum earliest finish)
+ */
+function calculateProjectDuration(taskMap) {
+    return Math.max(...Array.from(taskMap.values()).map((t) => t.earliestFinish));
+}
+/**
+ * Find tasks that have successors (are dependencies of other tasks)
+ */
+function findTasksWithSuccessors(sortedTasks) {
+    const tasksWithSuccessors = new Set();
+    for (const task of sortedTasks) {
+        const deps = getBlockedByDeps(task);
+        for (const depId of deps) {
+            tasksWithSuccessors.add(depId);
+        }
+    }
+    return tasksWithSuccessors;
+}
+/**
+ * Find successor tasks (tasks that depend on a given task)
+ */
+function findSuccessors(taskId, taskMap) {
+    const successors = [];
+    for (const other of taskMap.values()) {
+        const otherDeps = getBlockedByDeps(other);
+        if (otherDeps.includes(taskId)) {
+            successors.push(other);
+        }
+    }
+    return successors;
+}
+/**
+ * Backward pass: Calculate latest start/finish times
+ * LF = min(LS of all successors) or projectDuration for end tasks
+ * LS = LF - duration
+ */
+function backwardPass(sortedTasks, taskMap, projectDuration) {
+    const tasksWithSuccessors = findTasksWithSuccessors(sortedTasks);
+    // Initialize end tasks (tasks with no successors)
+    for (const task of taskMap.values()) {
+        if (!tasksWithSuccessors.has(task.id)) {
+            const duration = getTaskDuration(task);
+            task.latestFinish = projectDuration;
+            task.latestStart = task.latestFinish - duration;
+        }
+    }
+    // Process in reverse topological order
+    const reverseSorted = [...sortedTasks].reverse();
+    for (const task of reverseSorted) {
+        const cpmTask = taskMap.get(task.id);
+        if (!cpmTask)
+            continue;
+        const duration = getTaskDuration(task);
+        const successors = findSuccessors(task.id, taskMap);
+        if (successors.length > 0) {
+            // LF = min(LS of all successors)
+            cpmTask.latestFinish = Math.min(...successors.map((s) => s.latestStart));
+            cpmTask.latestStart = cpmTask.latestFinish - duration;
+        }
+    }
+}
+/**
+ * Calculate slack and mark critical tasks
+ * Slack = LS - ES (or LF - EF)
+ * Critical = slack ≈ 0
+ */
+function calculateSlackAndCritical(taskMap) {
+    const FLOAT_TOLERANCE = 0.001;
+    for (const task of taskMap.values()) {
+        task.slack = task.latestStart - task.earliestStart;
+        task.isCritical = Math.abs(task.slack) < FLOAT_TOLERANCE;
+    }
+}
+/**
+ * Count dependents for bottleneck detection
+ */
+function countDependents(sortedTasks, activeTasks, taskMap) {
+    for (const task of sortedTasks) {
+        const cpmTask = taskMap.get(task.id);
+        if (cpmTask) {
+            cpmTask.dependentCount = findDependents(activeTasks, task.id).length;
+        }
+    }
+}
+/**
+ * Extract critical path tasks in topological order
+ */
+function extractCriticalPath(sortedTasks, taskMap) {
+    return sortedTasks
+        .map((t) => taskMap.get(t.id))
+        .filter((t) => t !== undefined && t.isCritical);
+}
+/**
+ * Find top bottlenecks (critical tasks blocking the most downstream work)
+ */
+function findBottlenecks(criticalPath, limit = 5) {
+    return [...criticalPath]
+        .sort((a, b) => b.dependentCount - a.dependentCount)
+        .slice(0, limit);
+}
+/**
+ * Perform Critical Path Method analysis
+ *
+ * CPM calculates:
+ * - Earliest Start (ES): Earliest a task can start
+ * - Earliest Finish (EF): ES + duration
+ * - Latest Finish (LF): Latest a task can finish without delaying project
+ * - Latest Start (LS): LF - duration
+ * - Slack: LS - ES (or LF - EF)
+ * - Critical Path: Tasks with slack = 0
+ */
+export function criticalPathAnalysis(tasks) {
+    // Filter to only pending/in_progress tasks
+    const activeTasks = tasks.filter((t) => t.status === "pending" || t.status === "in_progress");
+    if (activeTasks.length === 0) {
+        return {
+            tasks: [],
+            criticalPath: [],
+            projectDuration: 0,
+            bottlenecks: [],
+        };
+    }
+    // Sort topologically
+    const sortedTasks = topologicalSort(activeTasks);
+    // Initialize CPM tasks
+    const taskMap = initializeCPMTasks(sortedTasks);
+    // Forward pass: Calculate earliest start/finish
+    forwardPass(sortedTasks, taskMap);
+    // Calculate project duration
+    const projectDuration = calculateProjectDuration(taskMap);
+    // Backward pass: Calculate latest start/finish
+    backwardPass(sortedTasks, taskMap, projectDuration);
+    // Calculate slack and mark critical tasks
+    calculateSlackAndCritical(taskMap);
+    // Count dependents for bottleneck detection
+    countDependents(sortedTasks, activeTasks, taskMap);
+    // Extract critical path
+    const criticalPath = extractCriticalPath(sortedTasks, taskMap);
+    // Find bottlenecks
+    const bottlenecks = findBottlenecks(criticalPath);
+    return {
+        tasks: sortedTasks.map((t) => taskMap.get(t.id)),
+        criticalPath,
+        projectDuration,
+        bottlenecks,
+    };
+}
+/**
+ * Find tasks that can be executed in parallel (no dependencies between them)
+ */
+export function findParallelTasks(tasks) {
+    const activeTasks = tasks.filter((t) => t.status === "pending" || t.status === "in_progress");
+    if (activeTasks.length === 0)
+        return [];
+    // Find tasks with no uncompleted dependencies
+    const completedIds = new Set(tasks.filter((t) => t.status === "completed").map((t) => t.id));
+    const available = activeTasks.filter((task) => {
+        const deps = getBlockedByDeps(task);
+        return deps.every((depId) => completedIds.has(depId));
+    });
+    if (available.length <= 1)
+        return [available];
+    // Group tasks that don't depend on each other
+    const groups = [];
+    const processed = new Set();
+    for (const task of available) {
+        if (processed.has(task.id))
+            continue;
+        const group = [task];
+        processed.add(task.id);
+        for (const other of available) {
+            if (processed.has(other.id))
+                continue;
+            // Check if these tasks are independent
+            const taskDeps = (task.dependencies ?? []).map((d) => d.taskId);
+            const otherDeps = (other.dependencies ?? []).map((d) => d.taskId);
+            const independent = !taskDeps.includes(other.id) && !otherDeps.includes(task.id);
+            if (independent) {
+                group.push(other);
+                processed.add(other.id);
+            }
+        }
+        groups.push(group);
+    }
+    return groups;
+}
+/**
+ * Suggest the next best task to work on
+ */
+export function suggestNextTask(tasks, options = {}) {
+    const activeTasks = tasks.filter((t) => t.status === "pending" || t.status === "in_progress");
+    if (activeTasks.length === 0)
+        return null;
+    // Get CPM analysis
+    const cpm = criticalPathAnalysis(tasks);
+    // Filter by availability (all dependencies completed)
+    const completedIds = new Set(tasks.filter((t) => t.status === "completed").map((t) => t.id));
+    let candidates = cpm.tasks.filter((task) => {
+        const deps = getBlockedByDeps(task);
+        return deps.every((depId) => completedIds.has(depId));
+    });
+    // Filter by context if specified
+    if (options.contexts?.length) {
+        const contextSet = new Set(options.contexts);
+        const contextFiltered = candidates.filter((t) => (t.contexts ?? []).some((c) => contextSet.has(c)));
+        if (contextFiltered.length > 0) {
+            candidates = contextFiltered;
+        }
+    }
+    // Filter by time if specified
+    if (options.maxMinutes) {
+        const timeFiltered = candidates.filter((t) => getTaskDuration(t) <= options.maxMinutes);
+        if (timeFiltered.length > 0) {
+            candidates = timeFiltered;
+        }
+    }
+    if (candidates.length === 0)
+        return null;
+    // Score and rank candidates
+    // Priority: Critical path > High priority > Most dependents > Shortest duration
+    const scored = candidates.map((task) => {
+        let score = 0;
+        if (task.isCritical)
+            score += 1000;
+        score += task.dependentCount * 100;
+        score += priorityScore(task.priority) * 10;
+        // Prefer shorter tasks (quick wins)
+        score += Math.max(0, 100 - getTaskDuration(task));
+        return { task, score };
+    });
+    scored.sort((a, b) => b.score - a.score);
+    return scored[0]?.task ?? null;
+}
+/**
+ * Convert priority to numeric score
+ */
+function priorityScore(priority) {
+    const scores = {
+        critical: 4,
+        high: 3,
+        medium: 2,
+        low: 1,
+    };
+    return scores[priority] ?? 2;
+}
+//# sourceMappingURL=critical-path.js.map

package/dist/algorithms/critical-path.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"critical-path.js","sourceRoot":"","sources":["../../src/algorithms/critical-path.ts"],"names":[],"mappings":"AACA,OAAO,EAAE,eAAe,EAAE,cAAc,EAAE,MAAM,uBAAuB,CAAC;AA0BxE,oDAAoD;AACpD,MAAM,gBAAgB,GAAG,EAAE,CAAC;AAE5B;;GAEG;AACH,SAAS,eAAe,CAAC,IAAU;IACjC,OAAO,IAAI,CAAC,QAAQ,EAAE,QAAQ,IAAI,gBAAgB,CAAC;AACrD,CAAC;AAED;;GAEG;AACH,SAAS,gBAAgB,CAAC,IAAU;IAClC,OAAO,CAAC,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,KAAK,YAAY,CAAC;SACtC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;AAC1B,CAAC;AAED;;GAEG;AACH,SAAS,kBAAkB,CAAC,WAAmB;IAC7C,MAAM,OAAO,GAAG,IAAI,GAAG,EAAmB,CAAC;IAE3C,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QACvC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE;YACnB,GAAG,IAAI;YACP,aAAa,EAAE,CAAC;YAChB,cAAc,EAAE,QAAQ;YACxB,WAAW,EAAE,QAAQ;YACrB,YAAY,EAAE,QAAQ;YACtB,KAAK,EAAE,CAAC;YACR,UAAU,EAAE,KAAK;YACjB,cAAc,EAAE,CAAC;SAClB,CAAC,CAAC;IACL,CAAC;IAED,OAAO,OAAO,CAAC;AACjB,CAAC;AAED;;;;GAIG;AACH,SAAS,WAAW,CAAC,WAAmB,EAAE,OAA6B;IACrE,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,OAAO;YAAE,SAAS;QAEvB,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;QAEpC,qCAAqC;QACrC,IAAI,gBAAgB,GAAG,CAAC,CAAC;QACzB,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,MAAM,GAAG,GAAG,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;YAC/B,IAAI,GAAG,EAAE,CAAC;gBACR,gBAAgB,GAAG,IAAI,CAAC,GAAG,CAAC,gBAAgB,EAAE,GAAG,CAAC,cAAc,CAAC,CAAC;YACpE,CAAC;QACH,CAAC;QAED,OAAO,CAAC,aAAa,GAAG,gBAAgB,CAAC;QACzC,OAAO,CAAC,cAAc,GAAG,OAAO,CAAC,aAAa,GAAG,QAAQ,CAAC;IAC5D,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,wBAAwB,CAAC,OAA6B;IAC7D,OAAO,IAAI,CAAC,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,CAAC,OAAO,CAAC,MAAM,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,CAAC,CAAC,CAAC;AAChF,CAAC;AAED;;GAEG;AACH,SAAS,uBAAuB,CAAC,WAAmB;IAClD,MAAM,mBAAmB,GAAG,IAAI,GAAG,EAAU,CAAC;IAE9C,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;QACpC,KAAK,MAAM,KAAK,IAAI,IAAI,EAAE,CAAC;YACzB,mBAAmB,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC;QACjC,CAAC;IACH,CAAC;IAED,OAAO,mBAAmB,CAAC;AAC7B,CAAC;AAED;;GAEG;AACH,SAAS,cAAc,CAAC,MAAc,EAAE,OAA6B;IACnE,MAAM,UAAU,GAAc,EAAE,CAAC;IAEjC,KAAK,MAAM,KAAK,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACrC,MAAM,SAAS,GAAG,gBAAgB,CAAC,KAAK,CAAC,CAAC;QAC1C,IAAI,SAAS,CAAC,QAAQ,CAAC,MAAM,CAAC,EAAE,CAAC;YAC/B,UAAU,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;QACzB,CAAC;IACH,CAAC;IAED,OAAO,UAAU,CAAC;AACpB,CAAC;AAED;;;;GAIG;AACH,SAAS,YAAY,CACnB,WAAmB,EACnB,OAA6B,EAC7B,eAAuB;IAEvB,MAAM,mBAAmB,GAAG,uBAAuB,CAAC,WAAW,CAAC,CAAC;IAEjE,kDAAkD;IAClD,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,IAAI,CAAC,mBAAmB,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;YACtC,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;YACvC,IAAI,CAAC,YAAY,GAAG,eAAe,CAAC;YACpC,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,YAAY,GAAG,QAAQ,CAAC;QAClD,CAAC;IACH,CAAC;IAED,uCAAuC;IACvC,MAAM,aAAa,GAAG,CAAC,GAAG,WAAW,CAAC,CAAC,OAAO,EAAE,CAAC;IAEjD,KAAK,MAAM,IAAI,IAAI,aAAa,EAAE,CAAC;QACjC,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,CAAC,OAAO;YAAE,SAAS;QAEvB,MAAM,QAAQ,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC;QACvC,MAAM,UAAU,GAAG,cAAc,CAAC,IAAI,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;QAEpD,IAAI,UAAU,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC1B,iCAAiC;YACjC,OAAO,CAAC,YAAY,GAAG,IAAI,CAAC,GAAG,CAAC,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,WAAW,CAAC,CAAC,CAAC;YACzE,OAAO,CAAC,WAAW,GAAG,OAAO,CAAC,YAAY,GAAG,QAAQ,CAAC;QACxD,CAAC;IACH,CAAC;AACH,CAAC;AAED;;;;GAIG;AACH,SAAS,yBAAyB,CAAC,OAA6B;IAC9D,MAAM,eAAe,GAAG,KAAK,CAAC;IAE9B,KAAK,MAAM,IAAI,IAAI,OAAO,CAAC,MAAM,EAAE,EAAE,CAAC;QACpC,IAAI,CAAC,KAAK,GAAG,IAAI,CAAC,WAAW,GAAG,IAAI,CAAC,aAAa,CAAC;QACnD,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC,GAAG,CAAC,IAAI,CAAC,KAAK,CAAC,GAAG,eAAe,CAAC;IAC3D,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,WAAmB,EAAE,WAAmB,EAAE,OAA6B;IAC9F,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,OAAO,GAAG,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACrC,IAAI,OAAO,EAAE,CAAC;YACZ,OAAO,CAAC,cAAc,GAAG,cAAc,CAAC,WAAW,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,MAAM,CAAC;QACvE,CAAC;IACH,CAAC;AACH,CAAC;AAED;;GAEG;AACH,SAAS,mBAAmB,CAAC,WAAmB,EAAE,OAA6B;IAC7E,OAAO,WAAW;SACf,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;SAC7B,MAAM,CAAC,CAAC,CAAC,EAAgB,EAAE,CAAC,CAAC,KAAK,SAAS,IAAI,CAAC,CAAC,UAAU,CAAC,CAAC;AAClE,CAAC;AAED;;GAEG;AACH,SAAS,eAAe,CAAC,YAAuB,EAAE,KAAK,GAAG,CAAC;IACzD,OAAO,CAAC,GAAG,YAAY,CAAC;SACrB,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,cAAc,GAAG,CAAC,CAAC,cAAc,CAAC;SACnD,KAAK,CAAC,CAAC,EAAE,KAAK,CAAC,CAAC;AACrB,CAAC;AAED;;;;;;;;;;GAUG;AACH,MAAM,UAAU,oBAAoB,CAAC,KAAa;IAChD,2CAA2C;IAC3C,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAC5D,CAAC;IAEF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;QAC7B,OAAO;YACL,KAAK,EAAE,EAAE;YACT,YAAY,EAAE,EAAE;YAChB,eAAe,EAAE,CAAC;YAClB,WAAW,EAAE,EAAE;SAChB,CAAC;IACJ,CAAC;IAED,qBAAqB;IACrB,MAAM,WAAW,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;IAEjD,uBAAuB;IACvB,MAAM,OAAO,GAAG,kBAAkB,CAAC,WAAW,CAAC,CAAC;IAEhD,gDAAgD;IAChD,WAAW,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAElC,6BAA6B;IAC7B,MAAM,eAAe,GAAG,wBAAwB,CAAC,OAAO,CAAC,CAAC;IAE1D,+CAA+C;IAC/C,YAAY,CAAC,WAAW,EAAE,OAAO,EAAE,eAAe,CAAC,CAAC;IAEpD,0CAA0C;IAC1C,yBAAyB,CAAC,OAAO,CAAC,CAAC;IAEnC,4CAA4C;IAC5C,eAAe,CAAC,WAAW,EAAE,WAAW,EAAE,OAAO,CAAC,CAAC;IAEnD,wBAAwB;IACxB,MAAM,YAAY,GAAG,mBAAmB,CAAC,WAAW,EAAE,OAAO,CAAC,CAAC;IAE/D,mBAAmB;IACnB,MAAM,WAAW,GAAG,eAAe,CAAC,YAAY,CAAC,CAAC;IAElD,OAAO;QACL,KAAK,EAAE,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAE,CAAC;QACjD,YAAY;QACZ,eAAe;QACf,WAAW;KACZ,CAAC;AACJ,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,iBAAiB,CAAC,KAAa;IAC7C,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAC5D,CAAC;IAEF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAExC,8CAA8C;IAC9C,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAC/D,CAAC;IAEF,MAAM,SAAS,GAAG,WAAW,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QAC5C,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;QACpC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAI,SAAS,CAAC,MAAM,IAAI,CAAC;QAAE,OAAO,CAAC,SAAS,CAAC,CAAC;IAE9C,8CAA8C;IAC9C,MAAM,MAAM,GAAa,EAAE,CAAC;IAC5B,MAAM,SAAS,GAAG,IAAI,GAAG,EAAU,CAAC;IAEpC,KAAK,MAAM,IAAI,IAAI,SAAS,EAAE,CAAC;QAC7B,IAAI,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;YAAE,SAAS;QAErC,MAAM,KAAK,GAAW,CAAC,IAAI,CAAC,CAAC;QAC7B,SAAS,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAEvB,KAAK,MAAM,KAAK,IAAI,SAAS,EAAE,CAAC;YAC9B,IAAI,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC;gBAAE,SAAS;YAEtC,uCAAuC;YACvC,MAAM,QAAQ,GAAG,CAAC,IAAI,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAChE,MAAM,SAAS,GAAG,CAAC,KAAK,CAAC,YAAY,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,CAAC,CAAC;YAElE,MAAM,WAAW,GACf,CAAC,QAAQ,CAAC,QAAQ,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,CAAC,SAAS,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAE/D,IAAI,WAAW,EAAE,CAAC;gBAChB,KAAK,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;gBAClB,SAAS,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC;YAC1B,CAAC;QACH,CAAC;QAED,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,CAAC;IACrB,CAAC;IAED,OAAO,MAAM,CAAC;AAChB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,eAAe,CAC7B,KAAa,EACb,UAGI,EAAE;IAEN,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,SAAS,IAAI,CAAC,CAAC,MAAM,KAAK,aAAa,CAC5D,CAAC;IAEF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAE1C,mBAAmB;IACnB,MAAM,GAAG,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;IAExC,sDAAsD;IACtD,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAC/D,CAAC;IAEF,IAAI,UAAU,GAAG,GAAG,CAAC,KAAK,CAAC,MAAM,CAAC,CAAC,IAAI,EAAE,EAAE;QACzC,MAAM,IAAI,GAAG,gBAAgB,CAAC,IAAI,CAAC,CAAC;QACpC,OAAO,IAAI,CAAC,KAAK,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,KAAK,CAAC,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,iCAAiC;IACjC,IAAI,OAAO,CAAC,QAAQ,EAAE,MAAM,EAAE,CAAC;QAC7B,MAAM,UAAU,GAAG,IAAI,GAAG,CAAC,OAAO,CAAC,QAAQ,CAAC,CAAC;QAC7C,MAAM,eAAe,GAAG,UAAU,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAC9C,CAAC,CAAC,CAAC,QAAQ,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAClD,CAAC;QACF,IAAI,eAAe,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC/B,UAAU,GAAG,eAAe,CAAC;QAC/B,CAAC;IACH,CAAC;IAED,8BAA8B;IAC9B,IAAI,OAAO,CAAC,UAAU,EAAE,CAAC;QACvB,MAAM,YAAY,GAAG,UAAU,CAAC,MAAM,CACpC,CAAC,CAAC,EAAE,EAAE,CAAC,eAAe,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,UAAW,CACjD,CAAC;QACF,IAAI,YAAY,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;YAC5B,UAAU,GAAG,YAAY,CAAC;QAC5B,CAAC;IACH,CAAC;IAED,IAAI,UAAU,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,IAAI,CAAC;IAEzC,4BAA4B;IAC5B,gFAAgF;IAChF,MAAM,MAAM,GAAG,UAAU,CAAC,GAAG,CAAC,CAAC,IAAI,EAAE,EAAE;QACrC,IAAI,KAAK,GAAG,CAAC,CAAC;QACd,IAAI,IAAI,CAAC,UAAU;YAAE,KAAK,IAAI,IAAI,CAAC;QACnC,KAAK,IAAI,IAAI,CAAC,cAAc,GAAG,GAAG,CAAC;QACnC,KAAK,IAAI,aAAa,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,EAAE,CAAC;QAC3C,oCAAoC;QACpC,KAAK,IAAI,IAAI,CAAC,GAAG,CAAC,CAAC,EAAE,GAAG,GAAG,eAAe,CAAC,IAAI,CAAC,CAAC,CAAC;QAClD,OAAO,EAAE,IAAI,EAAE,KAAK,EAAE,CAAC;IACzB,CAAC,CAAC,CAAC;IAEH,MAAM,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,KAAK,GAAG,CAAC,CAAC,KAAK,CAAC,CAAC;IACzC,OAAO,MAAM,CAAC,CAAC,CAAC,EAAE,IAAI,IAAI,IAAI,CAAC;AACjC,CAAC;AAED;;GAEG;AACH,SAAS,aAAa,CAAC,QAAgB;IACrC,MAAM,MAAM,GAA2B;QACrC,QAAQ,EAAE,CAAC;QACX,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,GAAG,EAAE,CAAC;KACP,CAAC;IACF,OAAO,MAAM,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;AAC/B,CAAC"}

package/dist/algorithms/critical-path.test.d.ts

@@ -0,0 +1,2 @@
+export {};
+//# sourceMappingURL=critical-path.test.d.ts.map

package/dist/algorithms/critical-path.test.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"critical-path.test.d.ts","sourceRoot":"","sources":["../../src/algorithms/critical-path.test.ts"],"names":[],"mappings":""}

package/dist/algorithms/critical-path.test.js

@@ -0,0 +1,194 @@
+import { describe, test, expect } from "bun:test";
+import { criticalPathAnalysis, findParallelTasks, suggestNextTask, } from "./critical-path.js";
+// Helper to create mock tasks
+function createTask(id, options = {}) {
+    const task = {
+        id,
+        title: `Task ${id}`,
+        status: (options.status ?? "pending"),
+        priority: (options.priority ?? "medium"),
+        projectId: "test-project",
+        createdAt: new Date().toISOString(),
+        updatedAt: new Date().toISOString(),
+        dependencies: (options.deps ?? []).map((depId) => ({
+            taskId: depId,
+            type: "blocked_by",
+        })),
+    };
+    if (options.estimate) {
+        task.estimate = { expected: options.estimate, confidence: "medium" };
+    }
+    if (options.contexts) {
+        task.contexts = options.contexts;
+    }
+    return task;
+}
+describe("criticalPathAnalysis", () => {
+    test("returns empty result for empty input", () => {
+        const result = criticalPathAnalysis([]);
+        expect(result.tasks).toEqual([]);
+        expect(result.criticalPath).toEqual([]);
+        expect(result.projectDuration).toBe(0);
+    });
+    test("returns empty for all completed tasks", () => {
+        const tasks = [createTask("A", { status: "completed" })];
+        const result = criticalPathAnalysis(tasks);
+        expect(result.tasks).toEqual([]);
+    });
+    test("calculates single task correctly", () => {
+        const tasks = [createTask("A", { estimate: 60 })];
+        const result = criticalPathAnalysis(tasks);
+        expect(result.projectDuration).toBe(60);
+        expect(result.criticalPath.length).toBe(1);
+        expect(result.criticalPath[0].id).toBe("A");
+        expect(result.criticalPath[0].isCritical).toBe(true);
+    });
+    test("identifies critical path in linear chain", () => {
+        // A -> B -> C (each 30 min)
+        const tasks = [
+            createTask("A", { estimate: 30 }),
+            createTask("B", { estimate: 30, deps: ["A"] }),
+            createTask("C", { estimate: 30, deps: ["B"] }),
+        ];
+        const result = criticalPathAnalysis(tasks);
+        expect(result.projectDuration).toBe(90);
+        expect(result.criticalPath.length).toBe(3);
+        expect(result.criticalPath.map((t) => t.id)).toEqual(["A", "B", "C"]);
+    });
+    test("calculates slack for parallel tasks", () => {
+        // A (60) and B (30) both lead to C
+        // A is on critical path, B has 30 min slack
+        const tasks = [
+            createTask("A", { estimate: 60 }),
+            createTask("B", { estimate: 30 }),
+            createTask("C", { estimate: 30, deps: ["A", "B"] }),
+        ];
+        const result = criticalPathAnalysis(tasks);
+        expect(result.projectDuration).toBe(90); // A + C
+        const taskA = result.tasks.find((t) => t.id === "A");
+        const taskB = result.tasks.find((t) => t.id === "B");
+        const taskC = result.tasks.find((t) => t.id === "C");
+        expect(taskA.isCritical).toBe(true);
+        expect(taskB.slack).toBe(30); // B can start 30 min late
+        expect(taskC.isCritical).toBe(true);
+    });
+    test("identifies bottlenecks by dependent count", () => {
+        // A blocks B, C, D
+        const tasks = [
+            createTask("A", { estimate: 30 }),
+            createTask("B", { estimate: 30, deps: ["A"] }),
+            createTask("C", { estimate: 30, deps: ["A"] }),
+            createTask("D", { estimate: 30, deps: ["A"] }),
+        ];
+        const result = criticalPathAnalysis(tasks);
+        expect(result.bottlenecks.length).toBeGreaterThan(0);
+        expect(result.bottlenecks[0].id).toBe("A"); // A blocks the most tasks
+    });
+});
+describe("findParallelTasks", () => {
+    test("returns empty for empty input", () => {
+        const result = findParallelTasks([]);
+        expect(result).toEqual([]);
+    });
+    test("returns single group for independent tasks", () => {
+        const tasks = [
+            createTask("A"),
+            createTask("B"),
+            createTask("C"),
+        ];
+        const result = findParallelTasks(tasks);
+        expect(result.length).toBe(1);
+        expect(result[0].length).toBe(3);
+    });
+    test("excludes tasks with uncompleted dependencies", () => {
+        const tasks = [
+            createTask("A"),
+            createTask("B", { deps: ["A"] }),
+        ];
+        const result = findParallelTasks(tasks);
+        // Only A is available (B is blocked)
+        expect(result.length).toBe(1);
+        expect(result[0].length).toBe(1);
+        expect(result[0][0].id).toBe("A");
+    });
+    test("includes task when dependency is completed", () => {
+        const tasks = [
+            createTask("A", { status: "completed" }),
+            createTask("B", { deps: ["A"] }),
+            createTask("C"),
+        ];
+        const result = findParallelTasks(tasks);
+        // B and C can run in parallel
+        expect(result.length).toBe(1);
+        expect(result[0].map((t) => t.id).sort()).toEqual(["B", "C"]);
+    });
+    test("excludes completed tasks from result", () => {
+        const tasks = [
+            createTask("A", { status: "completed" }),
+            createTask("B"),
+        ];
+        const result = findParallelTasks(tasks);
+        expect(result.length).toBe(1);
+        expect(result[0].length).toBe(1);
+        expect(result[0][0].id).toBe("B");
+    });
+});
+describe("suggestNextTask", () => {
+    test("returns null for empty input", () => {
+        const result = suggestNextTask([]);
+        expect(result).toBeNull();
+    });
+    test("returns null when all tasks completed", () => {
+        const tasks = [createTask("A", { status: "completed" })];
+        const result = suggestNextTask(tasks);
+        expect(result).toBeNull();
+    });
+    test("prefers critical path tasks", () => {
+        // A is critical (longer), B has slack
+        const tasks = [
+            createTask("A", { estimate: 60, priority: "low" }),
+            createTask("B", { estimate: 30, priority: "high" }),
+            createTask("C", { estimate: 30, deps: ["A", "B"] }),
+        ];
+        const result = suggestNextTask(tasks);
+        // A is on critical path, should be suggested first
+        expect(result.id).toBe("A");
+    });
+    test("filters by context when specified", () => {
+        const tasks = [
+            createTask("A", { priority: "critical", contexts: ["office"] }),
+            createTask("B", { priority: "high", contexts: ["focus"] }),
+        ];
+        const result = suggestNextTask(tasks, { contexts: ["focus"] });
+        expect(result.id).toBe("B");
+    });
+    test("filters by max time when specified", () => {
+        const tasks = [
+            createTask("A", { estimate: 120, priority: "critical" }),
+            createTask("B", { estimate: 30, priority: "high" }),
+        ];
+        const result = suggestNextTask(tasks, { maxMinutes: 60 });
+        expect(result.id).toBe("B");
+    });
+    test("skips blocked tasks", () => {
+        const tasks = [
+            createTask("A", { priority: "low" }),
+            createTask("B", { priority: "critical", deps: ["A"] }),
+        ];
+        const result = suggestNextTask(tasks);
+        // B is blocked, so A should be suggested
+        expect(result.id).toBe("A");
+    });
+    test("considers tasks with more dependents", () => {
+        const tasks = [
+            createTask("A", { priority: "medium" }),
+            createTask("B", { priority: "medium" }),
+            createTask("C", { priority: "medium", deps: ["A"] }),
+            createTask("D", { priority: "medium", deps: ["A"] }),
+        ];
+        const result = suggestNextTask(tasks);
+        // A blocks more tasks (C and D), should be preferred over B
+        expect(result.id).toBe("A");
+    });
+});
+//# sourceMappingURL=critical-path.test.js.map

package/dist/algorithms/critical-path.test.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"critical-path.test.js","sourceRoot":"","sources":["../../src/algorithms/critical-path.test.ts"],"names":[],"mappings":"AAAA,OAAO,EAAE,QAAQ,EAAE,IAAI,EAAE,MAAM,EAAE,MAAM,UAAU,CAAC;AAClD,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,eAAe,GAChB,MAAM,oBAAoB,CAAC;AAG5B,8BAA8B;AAC9B,SAAS,UAAU,CACjB,EAAU,EACV,UAMI,EAAE;IAEN,MAAM,IAAI,GAAS;QACjB,EAAE;QACF,KAAK,EAAE,QAAQ,EAAE,EAAE;QACnB,MAAM,EAAE,CAAC,OAAO,CAAC,MAAM,IAAI,SAAS,CAAmB;QACvD,QAAQ,EAAE,CAAC,OAAO,CAAC,QAAQ,IAAI,QAAQ,CAAqB;QAC5D,SAAS,EAAE,cAAc;QACzB,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,SAAS,EAAE,IAAI,IAAI,EAAE,CAAC,WAAW,EAAE;QACnC,YAAY,EAAE,CAAC,OAAO,CAAC,IAAI,IAAI,EAAE,CAAC,CAAC,GAAG,CAAC,CAAC,KAAK,EAAE,EAAE,CAAC,CAAC;YACjD,MAAM,EAAE,KAAK;YACb,IAAI,EAAE,YAAqB;SAC5B,CAAC,CAAC;KACJ,CAAC;IACF,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,EAAE,QAAQ,EAAE,OAAO,CAAC,QAAQ,EAAE,UAAU,EAAE,QAAiB,EAAE,CAAC;IAChF,CAAC;IACD,IAAI,OAAO,CAAC,QAAQ,EAAE,CAAC;QACrB,IAAI,CAAC,QAAQ,GAAG,OAAO,CAAC,QAAQ,CAAC;IACnC,CAAC;IACD,OAAO,IAAI,CAAC;AACd,CAAC;AAED,QAAQ,CAAC,sBAAsB,EAAE,GAAG,EAAE;IACpC,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,MAAM,MAAM,GAAG,oBAAoB,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACjC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACzC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,KAAK,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IACnC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,kCAAkC,EAAE,GAAG,EAAE;QAC5C,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC,CAAC,CAAC;QAClD,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAE3C,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;QAC7C,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,CAAC,CAAE,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACxD,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,0CAA0C,EAAE,GAAG,EAAE;QACpD,4BAA4B;QAC5B,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;YACjC,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9C,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;SAC/C,CAAC;QACF,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAE3C,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACxC,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC3C,MAAM,CAAC,MAAM,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACxE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qCAAqC,EAAE,GAAG,EAAE;QAC/C,mCAAmC;QACnC,4CAA4C;QAC5C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;YACjC,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;YACjC,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;SACpD,CAAC;QACF,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAE3C,MAAM,CAAC,MAAM,CAAC,eAAe,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,QAAQ;QAEjD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAE,CAAC;QACtD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAE,CAAC;QACtD,MAAM,KAAK,GAAG,MAAM,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,KAAK,GAAG,CAAE,CAAC;QAEtD,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACpC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,0BAA0B;QACxD,MAAM,CAAC,KAAK,CAAC,UAAU,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,2CAA2C,EAAE,GAAG,EAAE;QACrD,mBAAmB;QACnB,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,CAAC;YACjC,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9C,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAC9C,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;SAC/C,CAAC;QACF,MAAM,MAAM,GAAG,oBAAoB,CAAC,KAAK,CAAC,CAAC;QAE3C,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,MAAM,CAAC,CAAC,eAAe,CAAC,CAAC,CAAC,CAAC;QACrD,MAAM,CAAC,MAAM,CAAC,WAAW,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC,CAAC,0BAA0B;IACzE,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,mBAAmB,EAAE,GAAG,EAAE;IACjC,IAAI,CAAC,+BAA+B,EAAE,GAAG,EAAE;QACzC,MAAM,MAAM,GAAG,iBAAiB,CAAC,EAAE,CAAC,CAAC;QACrC,MAAM,CAAC,MAAM,CAAC,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;IAC7B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACtD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,CAAC;YACf,UAAU,CAAC,GAAG,CAAC;YACf,UAAU,CAAC,GAAG,CAAC;SAChB,CAAC;QACF,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAExC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;IACpC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,8CAA8C,EAAE,GAAG,EAAE;QACxD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,CAAC;YACf,UAAU,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;SACjC,CAAC;QACF,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAExC,qCAAqC;QACrC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,4CAA4C,EAAE,GAAG,EAAE;QACtD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;YACxC,UAAU,CAAC,GAAG,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YAChC,UAAU,CAAC,GAAG,CAAC;SAChB,CAAC;QACF,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAExC,8BAA8B;QAC9B,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC,IAAI,EAAE,CAAC,CAAC,OAAO,CAAC,CAAC,GAAG,EAAE,GAAG,CAAC,CAAC,CAAC;IACjE,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC;YACxC,UAAU,CAAC,GAAG,CAAC;SAChB,CAAC;QACF,MAAM,MAAM,GAAG,iBAAiB,CAAC,KAAK,CAAC,CAAC;QAExC,MAAM,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAC9B,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,MAAM,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QAClC,MAAM,CAAC,MAAM,CAAC,CAAC,CAAE,CAAC,CAAC,CAAE,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IACtC,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC;AAEH,QAAQ,CAAC,iBAAiB,EAAE,GAAG,EAAE;IAC/B,IAAI,CAAC,8BAA8B,EAAE,GAAG,EAAE;QACxC,MAAM,MAAM,GAAG,eAAe,CAAC,EAAE,CAAC,CAAC;QACnC,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,uCAAuC,EAAE,GAAG,EAAE;QACjD,MAAM,KAAK,GAAG,CAAC,UAAU,CAAC,GAAG,EAAE,EAAE,MAAM,EAAE,WAAW,EAAE,CAAC,CAAC,CAAC;QACzD,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QACtC,MAAM,CAAC,MAAM,CAAC,CAAC,QAAQ,EAAE,CAAC;IAC5B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,6BAA6B,EAAE,GAAG,EAAE;QACvC,sCAAsC;QACtC,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;YAClD,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;YACnD,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,IAAI,EAAE,CAAC,GAAG,EAAE,GAAG,CAAC,EAAE,CAAC;SACpD,CAAC;QACF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAEtC,mDAAmD;QACnD,MAAM,CAAC,MAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,mCAAmC,EAAE,GAAG,EAAE;QAC7C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,QAAQ,EAAE,CAAC,QAAQ,CAAC,EAAE,CAAC;YAC/D,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC;SAC3D,CAAC;QACF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,EAAE,QAAQ,EAAE,CAAC,OAAO,CAAC,EAAE,CAAC,CAAC;QAE/D,MAAM,CAAC,MAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,oCAAoC,EAAE,GAAG,EAAE;QAC9C,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,GAAG,EAAE,QAAQ,EAAE,UAAU,EAAE,CAAC;YACxD,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,EAAE,EAAE,QAAQ,EAAE,MAAM,EAAE,CAAC;SACpD,CAAC;QACF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,EAAE,EAAE,UAAU,EAAE,EAAE,EAAE,CAAC,CAAC;QAE1D,MAAM,CAAC,MAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,qBAAqB,EAAE,GAAG,EAAE;QAC/B,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,KAAK,EAAE,CAAC;YACpC,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,UAAU,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;SACvD,CAAC;QACF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAEtC,yCAAyC;QACzC,MAAM,CAAC,MAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;IAEH,IAAI,CAAC,sCAAsC,EAAE,GAAG,EAAE;QAChD,MAAM,KAAK,GAAG;YACZ,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;YACvC,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,CAAC;YACvC,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;YACpD,UAAU,CAAC,GAAG,EAAE,EAAE,QAAQ,EAAE,QAAQ,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,CAAC;SACrD,CAAC;QACF,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;QAEtC,4DAA4D;QAC5D,MAAM,CAAC,MAAO,CAAC,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAC/B,CAAC,CAAC,CAAC;AACL,CAAC,CAAC,CAAC"}

package/dist/algorithms/index.d.ts

@@ -0,0 +1,3 @@
+export { topologicalSort, wouldCreateCycle, findDependents, findDependencies, priorityToNumber, taskToNode, type TaskNode, } from "./topological-sort.js";
+export { criticalPathAnalysis, findParallelTasks, suggestNextTask, type CPMTask, type CPMResult, } from "./critical-path.js";
+//# sourceMappingURL=index.d.ts.map

package/dist/algorithms/index.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.d.ts","sourceRoot":"","sources":["../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,cAAc,EACd,gBAAgB,EAChB,gBAAgB,EAChB,UAAU,EACV,KAAK,QAAQ,GACd,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,eAAe,EACf,KAAK,OAAO,EACZ,KAAK,SAAS,GACf,MAAM,oBAAoB,CAAC"}

package/dist/algorithms/index.js

@@ -0,0 +1,3 @@
+export { topologicalSort, wouldCreateCycle, findDependents, findDependencies, priorityToNumber, taskToNode, } from "./topological-sort.js";
+export { criticalPathAnalysis, findParallelTasks, suggestNextTask, } from "./critical-path.js";
+//# sourceMappingURL=index.js.map

package/dist/algorithms/index.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"index.js","sourceRoot":"","sources":["../../src/algorithms/index.ts"],"names":[],"mappings":"AAAA,OAAO,EACL,eAAe,EACf,gBAAgB,EAChB,cAAc,EACd,gBAAgB,EAChB,gBAAgB,EAChB,UAAU,GAEX,MAAM,uBAAuB,CAAC;AAE/B,OAAO,EACL,oBAAoB,EACpB,iBAAiB,EACjB,eAAe,GAGhB,MAAM,oBAAoB,CAAC"}

package/dist/algorithms/topological-sort.d.ts

@@ -0,0 +1,41 @@
+import type { Task } from "../schemas/task.js";
+/**
+ * Node representation for graph algorithms
+ */
+export interface TaskNode {
+    id: string;
+    dependencies: string[];
+    priority: number;
+    estimate: number;
+}
+/**
+ * Convert priority string to numeric value
+ */
+export declare function priorityToNumber(priority: string): number;
+/**
+ * Convert Task to TaskNode
+ */
+export declare function taskToNode(task: Task): TaskNode;
+/**
+ * Topological sort using Kahn's algorithm with priority tie-breaking
+ *
+ * Returns tasks in optimal execution order:
+ * 1. Respects dependencies (blocked_by relationships)
+ * 2. Higher priority tasks come first when dependencies allow
+ *
+ * @throws Error if circular dependency detected
+ */
+export declare function topologicalSort(tasks: Task[]): Task[];
+/**
+ * Detect if adding a dependency would create a cycle
+ */
+export declare function wouldCreateCycle(tasks: Task[], fromId: string, toId: string): boolean;
+/**
+ * Find all tasks that depend on a given task (directly or transitively)
+ */
+export declare function findDependents(tasks: Task[], taskId: string): Task[];
+/**
+ * Find all tasks that a given task depends on (directly or transitively)
+ */
+export declare function findDependencies(tasks: Task[], taskId: string): Task[];
+//# sourceMappingURL=topological-sort.d.ts.map

package/dist/algorithms/topological-sort.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"topological-sort.d.ts","sourceRoot":"","sources":["../../src/algorithms/topological-sort.ts"],"names":[],"mappings":"AAAA,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,oBAAoB,CAAC;AAE/C;;GAEG;AACH,MAAM,WAAW,QAAQ;IACvB,EAAE,EAAE,MAAM,CAAC;IACX,YAAY,EAAE,MAAM,EAAE,CAAC;IACvB,QAAQ,EAAE,MAAM,CAAC;IACjB,QAAQ,EAAE,MAAM,CAAC;CAClB;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,QAAQ,EAAE,MAAM,GAAG,MAAM,CAQzD;AAED;;GAEG;AACH,wBAAgB,UAAU,CAAC,IAAI,EAAE,IAAI,GAAG,QAAQ,CAS/C;AAED;;;;;;;;GAQG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,EAAE,CAmErD;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAC9B,KAAK,EAAE,IAAI,EAAE,EACb,MAAM,EAAE,MAAM,EACd,IAAI,EAAE,MAAM,GACX,OAAO,CAqBT;AAED;;GAEG;AACH,wBAAgB,cAAc,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE,CAqBpE;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,EAAE,MAAM,EAAE,MAAM,GAAG,IAAI,EAAE,CA2BtE"}