@cleocode/cleo 2026.2.5

package/dist/core/tasks/graph-cache.js

@@ -0,0 +1,127 @@
+/**
+ * Graph cache - memoized dependency graph operations.
+ * Ported from lib/tasks/graph-cache.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+import { getDescendantIds, getChildIds } from './hierarchy.js';
+import { getDependentIds } from './dependency-check.js';
+import { computeDependencyWaves } from './graph-ops.js';
+/**
+ * Graph cache for expensive dependency calculations.
+ * Automatically invalidates when tasks change.
+ */
+export class GraphCache {
+    descendantsCache = new Map();
+    childrenCache = new Map();
+    dependentsCache = new Map();
+    wavesCache = null;
+    taskChecksum = '';
+    ttlMs;
+    constructor(options) {
+        this.ttlMs = options?.ttlMs ?? 30_000; // 30 second default TTL
+    }
+    /**
+     * Compute a simple checksum from task data to detect changes.
+     */
+    computeChecksum(tasks) {
+        // Use task count + IDs + statuses + deps as a quick checksum
+        const parts = tasks.map((t) => `${t.id}:${t.status}:${t.parentId ?? ''}:${(t.depends ?? []).join(',')}`);
+        return parts.sort().join('|');
+    }
+    /**
+     * Check if cache is still valid for given tasks.
+     */
+    isValid(tasks) {
+        return this.computeChecksum(tasks) === this.taskChecksum;
+    }
+    /**
+     * Check if a cache entry has expired.
+     */
+    isExpired(entry) {
+        return Date.now() - entry.timestamp > this.ttlMs;
+    }
+    /**
+     * Invalidate all caches.
+     */
+    invalidate() {
+        this.descendantsCache.clear();
+        this.childrenCache.clear();
+        this.dependentsCache.clear();
+        this.wavesCache = null;
+        this.taskChecksum = '';
+    }
+    /**
+     * Ensure cache is fresh for the given task set.
+     */
+    ensureFresh(tasks) {
+        if (!this.isValid(tasks)) {
+            this.invalidate();
+            this.taskChecksum = this.computeChecksum(tasks);
+        }
+    }
+    /**
+     * Get descendants of a task (cached).
+     */
+    getDescendants(taskId, tasks) {
+        this.ensureFresh(tasks);
+        const cached = this.descendantsCache.get(taskId);
+        if (cached && !this.isExpired(cached)) {
+            return cached.value;
+        }
+        const result = getDescendantIds(taskId, tasks);
+        this.descendantsCache.set(taskId, { value: result, timestamp: Date.now() });
+        return result;
+    }
+    /**
+     * Get children of a task (cached).
+     */
+    getChildren(taskId, tasks) {
+        this.ensureFresh(tasks);
+        const cached = this.childrenCache.get(taskId);
+        if (cached && !this.isExpired(cached)) {
+            return cached.value;
+        }
+        const result = getChildIds(taskId, tasks);
+        this.childrenCache.set(taskId, { value: result, timestamp: Date.now() });
+        return result;
+    }
+    /**
+     * Get dependents of a task (cached).
+     */
+    getDependents(taskId, tasks) {
+        this.ensureFresh(tasks);
+        const cached = this.dependentsCache.get(taskId);
+        if (cached && !this.isExpired(cached)) {
+            return cached.value;
+        }
+        const result = getDependentIds(taskId, tasks);
+        this.dependentsCache.set(taskId, { value: result, timestamp: Date.now() });
+        return result;
+    }
+    /**
+     * Get dependency waves (cached).
+     */
+    getWaves(tasks) {
+        this.ensureFresh(tasks);
+        if (this.wavesCache && !this.isExpired(this.wavesCache)) {
+            return this.wavesCache.value;
+        }
+        const result = computeDependencyWaves(tasks);
+        this.wavesCache = { value: result, timestamp: Date.now() };
+        return result;
+    }
+    /**
+     * Get cache statistics.
+     */
+    getStats() {
+        return {
+            descendantsSize: this.descendantsCache.size,
+            childrenSize: this.childrenCache.size,
+            dependentsSize: this.dependentsCache.size,
+            hasWaves: this.wavesCache !== null,
+        };
+    }
+}
+//# sourceMappingURL=graph-cache.js.map

package/dist/core/tasks/graph-cache.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-cache.js","sourceRoot":"","sources":["../../../src/core/tasks/graph-cache.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EAAE,gBAAgB,EAAE,WAAW,EAAE,MAAM,gBAAgB,CAAC;AAC/D,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AACxD,OAAO,EAAE,sBAAsB,EAAuB,MAAM,gBAAgB,CAAC;AAQ7E;;;GAGG;AACH,MAAM,OAAO,UAAU;IACb,gBAAgB,GAAG,IAAI,GAAG,EAAgC,CAAC;IAC3D,aAAa,GAAG,IAAI,GAAG,EAAgC,CAAC;IACxD,eAAe,GAAG,IAAI,GAAG,EAAgC,CAAC;IAC1D,UAAU,GAAwC,IAAI,CAAC;IACvD,YAAY,GAAW,EAAE,CAAC;IAC1B,KAAK,CAAS;IAEtB,YAAY,OAA4B;QACtC,IAAI,CAAC,KAAK,GAAG,OAAO,EAAE,KAAK,IAAI,MAAM,CAAC,CAAC,wBAAwB;IACjE,CAAC;IAED;;OAEG;IACK,eAAe,CAAC,KAAa;QACnC,6DAA6D;QAC7D,MAAM,KAAK,GAAG,KAAK,CAAC,GAAG,CACrB,CAAC,CAAC,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,EAAE,IAAI,CAAC,CAAC,MAAM,IAAI,CAAC,CAAC,QAAQ,IAAI,EAAE,IAAI,CAAC,CAAC,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAChF,CAAC;QACF,OAAO,KAAK,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,CAAC;IAChC,CAAC;IAED;;OAEG;IACK,OAAO,CAAC,KAAa;QAC3B,OAAO,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,KAAK,IAAI,CAAC,YAAY,CAAC;IAC3D,CAAC;IAED;;OAEG;IACK,SAAS,CAAI,KAAoB;QACvC,OAAO,IAAI,CAAC,GAAG,EAAE,GAAG,KAAK,CAAC,SAAS,GAAG,IAAI,CAAC,KAAK,CAAC;IACnD,CAAC;IAED;;OAEG;IACH,UAAU;QACR,IAAI,CAAC,gBAAgB,CAAC,KAAK,EAAE,CAAC;QAC9B,IAAI,CAAC,aAAa,CAAC,KAAK,EAAE,CAAC;QAC3B,IAAI,CAAC,eAAe,CAAC,KAAK,EAAE,CAAC;QAC7B,IAAI,CAAC,UAAU,GAAG,IAAI,CAAC;QACvB,IAAI,CAAC,YAAY,GAAG,EAAE,CAAC;IACzB,CAAC;IAED;;OAEG;IACK,WAAW,CAAC,KAAa;QAC/B,IAAI,CAAC,IAAI,CAAC,OAAO,CAAC,KAAK,CAAC,EAAE,CAAC;YACzB,IAAI,CAAC,UAAU,EAAE,CAAC;YAClB,IAAI,CAAC,YAAY,GAAG,IAAI,CAAC,eAAe,CAAC,KAAK,CAAC,CAAC;QAClD,CAAC;IACH,CAAC;IAED;;OAEG;IACH,cAAc,CAAC,MAAc,EAAE,KAAa;QAC1C,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAExB,MAAM,MAAM,GAAG,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QACjD,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YACtC,OAAO,MAAM,CAAC,KAAK,CAAC;QACtB,CAAC;QAED,MAAM,MAAM,GAAG,gBAAgB,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC/C,IAAI,CAAC,gBAAgB,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAC5E,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,WAAW,CAAC,MAAc,EAAE,KAAa;QACvC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAExB,MAAM,MAAM,GAAG,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAC9C,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YACtC,OAAO,MAAM,CAAC,KAAK,CAAC;QACtB,CAAC;QAED,MAAM,MAAM,GAAG,WAAW,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC1C,IAAI,CAAC,aAAa,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QACzE,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,aAAa,CAAC,MAAc,EAAE,KAAa;QACzC,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAExB,MAAM,MAAM,GAAG,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,CAAC,CAAC;QAChD,IAAI,MAAM,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,MAAM,CAAC,EAAE,CAAC;YACtC,OAAO,MAAM,CAAC,KAAK,CAAC;QACtB,CAAC;QAED,MAAM,MAAM,GAAG,eAAe,CAAC,MAAM,EAAE,KAAK,CAAC,CAAC;QAC9C,IAAI,CAAC,eAAe,CAAC,GAAG,CAAC,MAAM,EAAE,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC,CAAC;QAC3E,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,QAAQ,CAAC,KAAa;QACpB,IAAI,CAAC,WAAW,CAAC,KAAK,CAAC,CAAC;QAExB,IAAI,IAAI,CAAC,UAAU,IAAI,CAAC,IAAI,CAAC,SAAS,CAAC,IAAI,CAAC,UAAU,CAAC,EAAE,CAAC;YACxD,OAAO,IAAI,CAAC,UAAU,CAAC,KAAK,CAAC;QAC/B,CAAC;QAED,MAAM,MAAM,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;QAC7C,IAAI,CAAC,UAAU,GAAG,EAAE,KAAK,EAAE,MAAM,EAAE,SAAS,EAAE,IAAI,CAAC,GAAG,EAAE,EAAE,CAAC;QAC3D,OAAO,MAAM,CAAC;IAChB,CAAC;IAED;;OAEG;IACH,QAAQ;QAMN,OAAO;YACL,eAAe,EAAE,IAAI,CAAC,gBAAgB,CAAC,IAAI;YAC3C,YAAY,EAAE,IAAI,CAAC,aAAa,CAAC,IAAI;YACrC,cAAc,EAAE,IAAI,CAAC,eAAe,CAAC,IAAI;YACzC,QAAQ,EAAE,IAAI,CAAC,UAAU,KAAK,IAAI;SACnC,CAAC;IACJ,CAAC;CACF"}

package/dist/core/tasks/graph-ops.d.ts

@@ -0,0 +1,36 @@
+/**
+ * Task graph operations - dependency waves, ordering, and critical path.
+ * Ported from lib/tasks/graph-ops.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+import type { Task } from '../../types/task.js';
+/** A wave of parallelizable tasks. */
+export interface DependencyWave {
+    wave: number;
+    taskIds: string[];
+}
+/**
+ * Compute dependency waves for parallel execution.
+ * Tasks in the same wave can run in parallel; waves must be sequential.
+ */
+export declare function computeDependencyWaves(tasks: Task[]): DependencyWave[];
+/**
+ * Get the next task to work on (highest priority ready task).
+ */
+export declare function getNextTask(tasks: Task[]): Task | null;
+/**
+ * Calculate the critical path (longest dependency chain).
+ * Returns task IDs along the critical path.
+ */
+export declare function getCriticalPath(tasks: Task[]): string[];
+/**
+ * Get task ordering by dependency + priority.
+ */
+export declare function getTaskOrder(tasks: Task[]): string[];
+/**
+ * Get parallelizable tasks (tasks with no unmet dependencies).
+ */
+export declare function getParallelTasks(tasks: Task[]): string[];
+//# sourceMappingURL=graph-ops.d.ts.map

package/dist/core/tasks/graph-ops.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-ops.d.ts","sourceRoot":"","sources":["../../../src/core/tasks/graph-ops.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAGhD,sCAAsC;AACtC,MAAM,WAAW,cAAc;IAC7B,IAAI,EAAE,MAAM,CAAC;IACb,OAAO,EAAE,MAAM,EAAE,CAAC;CACnB;AAED;;;GAGG;AACH,wBAAgB,sBAAsB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,cAAc,EAAE,CA8DtE;AAED;;GAEG;AACH,wBAAgB,WAAW,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,IAAI,GAAG,IAAI,CA8BtD;AAED;;;GAGG;AACH,wBAAgB,eAAe,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAuDvD;AAED;;GAEG;AACH,wBAAgB,YAAY,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAepD;AAED;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,KAAK,EAAE,IAAI,EAAE,GAAG,MAAM,EAAE,CAGxD"}

package/dist/core/tasks/graph-ops.js

@@ -0,0 +1,173 @@
+/**
+ * Task graph operations - dependency waves, ordering, and critical path.
+ * Ported from lib/tasks/graph-ops.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+import { topologicalSort } from './dependency-check.js';
+/**
+ * Compute dependency waves for parallel execution.
+ * Tasks in the same wave can run in parallel; waves must be sequential.
+ */
+export function computeDependencyWaves(tasks) {
+    const activeTasks = tasks.filter((t) => t.status !== 'done' && t.status !== 'cancelled');
+    if (activeTasks.length === 0)
+        return [];
+    const taskMap = new Map(activeTasks.map((t) => [t.id, t]));
+    const completedIds = new Set(tasks.filter((t) => t.status === 'done' || t.status === 'cancelled').map((t) => t.id));
+    // Compute in-degree for each task (only counting active deps)
+    const inDegree = new Map();
+    for (const task of activeTasks) {
+        const activeDeps = (task.depends ?? []).filter((d) => !completedIds.has(d) && taskMap.has(d));
+        inDegree.set(task.id, activeDeps.length);
+    }
+    const waves = [];
+    const assigned = new Set();
+    let waveNum = 0;
+    while (assigned.size < activeTasks.length) {
+        // Find all tasks with in-degree 0 that haven't been assigned
+        const wave = [];
+        for (const [id, degree] of inDegree) {
+            if (!assigned.has(id) && degree === 0) {
+                wave.push(id);
+            }
+        }
+        if (wave.length === 0) {
+            // Remaining tasks have cycles - add them all to final wave
+            const remaining = activeTasks
+                .filter((t) => !assigned.has(t.id))
+                .map((t) => t.id);
+            if (remaining.length > 0) {
+                waves.push({ wave: waveNum, taskIds: remaining });
+            }
+            break;
+        }
+        waves.push({ wave: waveNum, taskIds: wave.sort() });
+        // Mark wave tasks as assigned and reduce in-degree
+        for (const id of wave) {
+            assigned.add(id);
+            // Reduce in-degree for dependents
+            for (const task of activeTasks) {
+                if (task.depends?.includes(id) && !assigned.has(task.id)) {
+                    inDegree.set(task.id, (inDegree.get(task.id) ?? 1) - 1);
+                }
+            }
+        }
+        waveNum++;
+    }
+    return waves;
+}
+/**
+ * Get the next task to work on (highest priority ready task).
+ */
+export function getNextTask(tasks) {
+    const completedIds = new Set(tasks.filter((t) => t.status === 'done' || t.status === 'cancelled').map((t) => t.id));
+    const priorityOrder = {
+        critical: 0,
+        high: 1,
+        medium: 2,
+        low: 3,
+    };
+    const ready = tasks
+        .filter((t) => {
+        if (t.status === 'done' || t.status === 'cancelled')
+            return false;
+        if (t.status === 'active')
+            return true; // Already active = highest priority
+        if (!t.depends?.length)
+            return true;
+        return t.depends.every((d) => completedIds.has(d));
+    })
+        .sort((a, b) => {
+        // Active tasks first
+        if (a.status === 'active' && b.status !== 'active')
+            return -1;
+        if (b.status === 'active' && a.status !== 'active')
+            return 1;
+        // Then by priority
+        const pa = priorityOrder[a.priority] ?? 2;
+        const pb = priorityOrder[b.priority] ?? 2;
+        return pa - pb;
+    });
+    return ready[0] ?? null;
+}
+/**
+ * Calculate the critical path (longest dependency chain).
+ * Returns task IDs along the critical path.
+ */
+export function getCriticalPath(tasks) {
+    const activeTasks = tasks.filter((t) => t.status !== 'done' && t.status !== 'cancelled');
+    if (activeTasks.length === 0)
+        return [];
+    const sorted = topologicalSort(activeTasks);
+    if (!sorted)
+        return []; // Cycle detected
+    const taskMap = new Map(activeTasks.map((t) => [t.id, t]));
+    const dist = new Map();
+    const prev = new Map();
+    // Initialize distances
+    for (const id of sorted) {
+        dist.set(id, 0);
+    }
+    // Process in topological order
+    for (const id of sorted) {
+        const task = taskMap.get(id);
+        if (!task?.depends)
+            continue;
+        for (const depId of task.depends) {
+            if (!taskMap.has(depId))
+                continue;
+            const newDist = (dist.get(depId) ?? 0) + 1;
+            if (newDist > (dist.get(id) ?? 0)) {
+                dist.set(id, newDist);
+                prev.set(id, depId);
+            }
+        }
+    }
+    // Find the task with maximum distance
+    let maxDist = 0;
+    let endId = '';
+    for (const [id, d] of dist) {
+        if (d >= maxDist) {
+            maxDist = d;
+            endId = id;
+        }
+    }
+    if (!endId)
+        return [];
+    // Trace back the path
+    const path = [endId];
+    let current = endId;
+    while (prev.has(current)) {
+        current = prev.get(current);
+        path.unshift(current);
+    }
+    return path;
+}
+/**
+ * Get task ordering by dependency + priority.
+ */
+export function getTaskOrder(tasks) {
+    const sorted = topologicalSort(tasks);
+    if (sorted)
+        return sorted;
+    // Fallback: sort by priority if cycle detected
+    const priorityOrder = {
+        critical: 0,
+        high: 1,
+        medium: 2,
+        low: 3,
+    };
+    return [...tasks]
+        .sort((a, b) => (priorityOrder[a.priority] ?? 2) - (priorityOrder[b.priority] ?? 2))
+        .map((t) => t.id);
+}
+/**
+ * Get parallelizable tasks (tasks with no unmet dependencies).
+ */
+export function getParallelTasks(tasks) {
+    const waves = computeDependencyWaves(tasks);
+    return waves[0]?.taskIds ?? [];
+}
+//# sourceMappingURL=graph-ops.js.map

package/dist/core/tasks/graph-ops.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-ops.js","sourceRoot":"","sources":["../../../src/core/tasks/graph-ops.ts"],"names":[],"mappings":"AAAA;;;;;;GAMG;AAGH,OAAO,EAAE,eAAe,EAAE,MAAM,uBAAuB,CAAC;AAQxD;;;GAGG;AACH,MAAM,UAAU,sBAAsB,CAAC,KAAa;IAClD,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CACvD,CAAC;IAEF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAExC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACtF,CAAC;IAEF,8DAA8D;IAC9D,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;QAC/B,MAAM,UAAU,GAAG,CAAC,IAAI,CAAC,OAAO,IAAI,EAAE,CAAC,CAAC,MAAM,CAC5C,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,OAAO,CAAC,GAAG,CAAC,CAAC,CAAC,CAC9C,CAAC;QACF,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,UAAU,CAAC,MAAM,CAAC,CAAC;IAC3C,CAAC;IAED,MAAM,KAAK,GAAqB,EAAE,CAAC;IACnC,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAU,CAAC;IAEnC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,OAAO,QAAQ,CAAC,IAAI,GAAG,WAAW,CAAC,MAAM,EAAE,CAAC;QAC1C,6DAA6D;QAC7D,MAAM,IAAI,GAAa,EAAE,CAAC;QAC1B,KAAK,MAAM,CAAC,EAAE,EAAE,MAAM,CAAC,IAAI,QAAQ,EAAE,CAAC;YACpC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,MAAM,KAAK,CAAC,EAAE,CAAC;gBACtC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;YAChB,CAAC;QACH,CAAC;QAED,IAAI,IAAI,CAAC,MAAM,KAAK,CAAC,EAAE,CAAC;YACtB,2DAA2D;YAC3D,MAAM,SAAS,GAAG,WAAW;iBAC1B,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;iBAClC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;YACpB,IAAI,SAAS,CAAC,MAAM,GAAG,CAAC,EAAE,CAAC;gBACzB,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,SAAS,EAAE,CAAC,CAAC;YACpD,CAAC;YACD,MAAM;QACR,CAAC;QAED,KAAK,CAAC,IAAI,CAAC,EAAE,IAAI,EAAE,OAAO,EAAE,OAAO,EAAE,IAAI,CAAC,IAAI,EAAE,EAAE,CAAC,CAAC;QAEpD,mDAAmD;QACnD,KAAK,MAAM,EAAE,IAAI,IAAI,EAAE,CAAC;YACtB,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;YACjB,kCAAkC;YAClC,KAAK,MAAM,IAAI,IAAI,WAAW,EAAE,CAAC;gBAC/B,IAAI,IAAI,CAAC,OAAO,EAAE,QAAQ,CAAC,EAAE,CAAC,IAAI,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,EAAE,CAAC;oBACzD,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC;gBAC1D,CAAC;YACH,CAAC;QACH,CAAC;QAED,OAAO,EAAE,CAAC;IACZ,CAAC;IAED,OAAO,KAAK,CAAC;AACf,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,WAAW,CAAC,KAAa;IACvC,MAAM,YAAY,GAAG,IAAI,GAAG,CAC1B,KAAK,CAAC,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CACtF,CAAC;IAEF,MAAM,aAAa,GAA2B;QAC5C,QAAQ,EAAE,CAAC;QACX,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,GAAG,EAAE,CAAC;KACP,CAAC;IAEF,MAAM,KAAK,GAAG,KAAK;SAChB,MAAM,CAAC,CAAC,CAAC,EAAE,EAAE;QACZ,IAAI,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW;YAAE,OAAO,KAAK,CAAC;QAClE,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ;YAAE,OAAO,IAAI,CAAC,CAAC,oCAAoC;QAC5E,IAAI,CAAC,CAAC,CAAC,OAAO,EAAE,MAAM;YAAE,OAAO,IAAI,CAAC;QACpC,OAAO,CAAC,CAAC,OAAO,CAAC,KAAK,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,YAAY,CAAC,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IACrD,CAAC,CAAC;SACD,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE;QACb,qBAAqB;QACrB,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ;YAAE,OAAO,CAAC,CAAC,CAAC;QAC9D,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ,IAAI,CAAC,CAAC,MAAM,KAAK,QAAQ;YAAE,OAAO,CAAC,CAAC;QAC7D,mBAAmB;QACnB,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC1C,MAAM,EAAE,GAAG,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC;QAC1C,OAAO,EAAE,GAAG,EAAE,CAAC;IACjB,CAAC,CAAC,CAAC;IAEL,OAAO,KAAK,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC;AAC1B,CAAC;AAED;;;GAGG;AACH,MAAM,UAAU,eAAe,CAAC,KAAa;IAC3C,MAAM,WAAW,GAAG,KAAK,CAAC,MAAM,CAC9B,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,MAAM,KAAK,MAAM,IAAI,CAAC,CAAC,MAAM,KAAK,WAAW,CACvD,CAAC;IAEF,IAAI,WAAW,CAAC,MAAM,KAAK,CAAC;QAAE,OAAO,EAAE,CAAC;IAExC,MAAM,MAAM,GAAG,eAAe,CAAC,WAAW,CAAC,CAAC;IAC5C,IAAI,CAAC,MAAM;QAAE,OAAO,EAAE,CAAC,CAAC,iBAAiB;IAEzC,MAAM,OAAO,GAAG,IAAI,GAAG,CAAC,WAAW,CAAC,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAC3D,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IACvC,MAAM,IAAI,GAAG,IAAI,GAAG,EAAkB,CAAC;IAEvC,uBAAuB;IACvB,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC;IAClB,CAAC;IAED,+BAA+B;IAC/B,KAAK,MAAM,EAAE,IAAI,MAAM,EAAE,CAAC;QACxB,MAAM,IAAI,GAAG,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAC7B,IAAI,CAAC,IAAI,EAAE,OAAO;YAAE,SAAS;QAE7B,KAAK,MAAM,KAAK,IAAI,IAAI,CAAC,OAAO,EAAE,CAAC;YACjC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,KAAK,CAAC;gBAAE,SAAS;YAClC,MAAM,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC;YAC3C,IAAI,OAAO,GAAG,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,CAAC,CAAC,EAAE,CAAC;gBAClC,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,OAAO,CAAC,CAAC;gBACtB,IAAI,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;YACtB,CAAC;QACH,CAAC;IACH,CAAC;IAED,sCAAsC;IACtC,IAAI,OAAO,GAAG,CAAC,CAAC;IAChB,IAAI,KAAK,GAAG,EAAE,CAAC;IACf,KAAK,MAAM,CAAC,EAAE,EAAE,CAAC,CAAC,IAAI,IAAI,EAAE,CAAC;QAC3B,IAAI,CAAC,IAAI,OAAO,EAAE,CAAC;YACjB,OAAO,GAAG,CAAC,CAAC;YACZ,KAAK,GAAG,EAAE,CAAC;QACb,CAAC;IACH,CAAC;IAED,IAAI,CAAC,KAAK;QAAE,OAAO,EAAE,CAAC;IAEtB,sBAAsB;IACtB,MAAM,IAAI,GAAa,CAAC,KAAK,CAAC,CAAC;IAC/B,IAAI,OAAO,GAAG,KAAK,CAAC;IACpB,OAAO,IAAI,CAAC,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC;QACzB,OAAO,GAAG,IAAI,CAAC,GAAG,CAAC,OAAO,CAAE,CAAC;QAC7B,IAAI,CAAC,OAAO,CAAC,OAAO,CAAC,CAAC;IACxB,CAAC;IAED,OAAO,IAAI,CAAC;AACd,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,YAAY,CAAC,KAAa;IACxC,MAAM,MAAM,GAAG,eAAe,CAAC,KAAK,CAAC,CAAC;IACtC,IAAI,MAAM;QAAE,OAAO,MAAM,CAAC;IAE1B,+CAA+C;IAC/C,MAAM,aAAa,GAA2B;QAC5C,QAAQ,EAAE,CAAC;QACX,IAAI,EAAE,CAAC;QACP,MAAM,EAAE,CAAC;QACT,GAAG,EAAE,CAAC;KACP,CAAC;IAEF,OAAO,CAAC,GAAG,KAAK,CAAC;SACd,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,CAAC,CAAC;SACnF,GAAG,CAAC,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC,CAAC;AACtB,CAAC;AAED;;GAEG;AACH,MAAM,UAAU,gBAAgB,CAAC,KAAa;IAC5C,MAAM,KAAK,GAAG,sBAAsB,CAAC,KAAK,CAAC,CAAC;IAC5C,OAAO,KAAK,CAAC,CAAC,CAAC,EAAE,OAAO,IAAI,EAAE,CAAC;AACjC,CAAC"}

package/dist/core/tasks/graph-rag.d.ts

@@ -0,0 +1,49 @@
+/**
+ * Semantic relationship discovery for CLEO tasks.
+ * Discovers related tasks via shared labels, description keywords, files, and hierarchy.
+ * Ported from lib/tasks/graph-rag.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+import type { Task } from '../../types/task.js';
+import type { RelatesType } from './crossref-extract.js';
+/** Discovery method. */
+export type DiscoveryMethod = 'labels' | 'description' | 'files' | 'hierarchy' | 'auto';
+/** A single discovery match. */
+export interface DiscoveryMatch {
+    taskId: string;
+    type: RelatesType;
+    reason: string;
+    score: number;
+    _hierarchyBoost?: number;
+    _relationship?: string;
+}
+/**
+ * Discover related tasks by shared labels.
+ */
+export declare function discoverByLabels(taskId: string, tasks: Task[]): DiscoveryMatch[];
+/**
+ * Discover related tasks by description similarity (keyword-based Jaccard).
+ */
+export declare function discoverByDescription(taskId: string, tasks: Task[]): DiscoveryMatch[];
+/**
+ * Discover related tasks by shared files.
+ */
+export declare function discoverByFiles(taskId: string, tasks: Task[]): DiscoveryMatch[];
+/**
+ * Discover related tasks by hierarchical proximity (siblings and cousins).
+ */
+export declare function discoverByHierarchy(taskId: string, tasks: Task[], options?: {
+    siblingBoost?: number;
+    cousinBoost?: number;
+}): DiscoveryMatch[];
+/**
+ * Discover related tasks using all methods combined.
+ */
+export declare function discoverRelatedTasks(taskId: string, tasks: Task[], method?: DiscoveryMethod): DiscoveryMatch[];
+/**
+ * Suggest relates entries filtered by threshold.
+ */
+export declare function suggestRelates(taskId: string, tasks: Task[], threshold?: number): DiscoveryMatch[];
+//# sourceMappingURL=graph-rag.d.ts.map

package/dist/core/tasks/graph-rag.d.ts.map

@@ -0,0 +1 @@
+{"version":3,"file":"graph-rag.d.ts","sourceRoot":"","sources":["../../../src/core/tasks/graph-rag.ts"],"names":[],"mappings":"AAAA;;;;;;;GAOG;AAEH,OAAO,KAAK,EAAE,IAAI,EAAE,MAAM,qBAAqB,CAAC;AAChD,OAAO,KAAK,EAAE,WAAW,EAAgB,MAAM,uBAAuB,CAAC;AAEvE,wBAAwB;AACxB,MAAM,MAAM,eAAe,GAAG,QAAQ,GAAG,aAAa,GAAG,OAAO,GAAG,WAAW,GAAG,MAAM,CAAC;AAExF,gCAAgC;AAChC,MAAM,WAAW,cAAc;IAC7B,MAAM,EAAE,MAAM,CAAC;IACf,IAAI,EAAE,WAAW,CAAC;IAClB,MAAM,EAAE,MAAM,CAAC;IACf,KAAK,EAAE,MAAM,CAAC;IACd,eAAe,CAAC,EAAE,MAAM,CAAC;IACzB,aAAa,CAAC,EAAE,MAAM,CAAC;CACxB;AA4CD;;GAEG;AACH,wBAAgB,gBAAgB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,cAAc,EAAE,CA2BhF;AAED;;GAEG;AACH,wBAAgB,qBAAqB,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,cAAc,EAAE,CAkCrF;AAED;;GAEG;AACH,wBAAgB,eAAe,CAAC,MAAM,EAAE,MAAM,EAAE,KAAK,EAAE,IAAI,EAAE,GAAG,cAAc,EAAE,CA8B/E;AAED;;GAEG;AACH,wBAAgB,mBAAmB,CACjC,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,IAAI,EAAE,EACb,OAAO,CAAC,EAAE;IAAE,YAAY,CAAC,EAAE,MAAM,CAAC;IAAC,WAAW,CAAC,EAAE,MAAM,CAAA;CAAE,GACxD,cAAc,EAAE,CA+ClB;AAED;;GAEG;AACH,wBAAgB,oBAAoB,CAClC,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,IAAI,EAAE,EACb,MAAM,GAAE,eAAwB,GAC/B,cAAc,EAAE,CA+ClB;AAED;;GAEG;AACH,wBAAgB,cAAc,CAC5B,MAAM,EAAE,MAAM,EACd,KAAK,EAAE,IAAI,EAAE,EACb,SAAS,GAAE,MAAY,GACtB,cAAc,EAAE,CAmBlB"}

package/dist/core/tasks/graph-rag.js

@@ -0,0 +1,253 @@
+/**
+ * Semantic relationship discovery for CLEO tasks.
+ * Discovers related tasks via shared labels, description keywords, files, and hierarchy.
+ * Ported from lib/tasks/graph-rag.sh
+ *
+ * @epic T4454
+ * @task T4529
+ */
+/** Common English stopwords for text comparison. */
+const STOPWORDS = new Set([
+    'a', 'an', 'the', 'and', 'or', 'but', 'in', 'on', 'at', 'to', 'for',
+    'of', 'with', 'by', 'from', 'as', 'is', 'was', 'are', 'were', 'be',
+    'been', 'being', 'have', 'has', 'had', 'do', 'does', 'did', 'will',
+    'would', 'could', 'should', 'may', 'might', 'must', 'shall', 'can',
+    'this', 'that', 'these', 'those', 'i', 'you', 'he', 'she', 'it', 'we',
+    'they', 'what', 'which', 'who', 'when', 'where', 'why', 'how', 'all',
+    'each', 'every', 'both', 'few', 'more', 'most', 'other', 'some', 'such',
+    'no', 'nor', 'not', 'only', 'own', 'same', 'so', 'than', 'too', 'very',
+    'just', 'also', 'now', 'then', 'here', 'there', 'if', 'else', 'any',
+]);
+/**
+ * Tokenize text: lowercase, remove punctuation, split, remove stopwords.
+ */
+function tokenize(text) {
+    const tokens = text
+        .toLowerCase()
+        .replace(/[^a-z0-9\s]/g, ' ')
+        .split(/\s+/)
+        .filter((t) => t.length > 0 && !STOPWORDS.has(t));
+    return new Set(tokens);
+}
+/**
+ * Calculate Jaccard similarity between two sets.
+ */
+function jaccardSimilarity(a, b) {
+    if (a.size === 0 && b.size === 0)
+        return 0;
+    let intersection = 0;
+    for (const item of a) {
+        if (b.has(item))
+            intersection++;
+    }
+    const union = new Set([...a, ...b]).size;
+    if (union === 0)
+        return 0;
+    return intersection / union;
+}
+/**
+ * Discover related tasks by shared labels.
+ */
+export function discoverByLabels(taskId, tasks) {
+    const source = tasks.find((t) => t.id === taskId);
+    if (!source?.labels?.length)
+        return [];
+    const sourceLabels = new Set(source.labels);
+    const results = [];
+    for (const task of tasks) {
+        if (task.id === taskId)
+            continue;
+        if (!task.labels?.length)
+            continue;
+        const taskLabels = new Set(task.labels);
+        const shared = [...sourceLabels].filter((l) => taskLabels.has(l));
+        if (shared.length === 0)
+            continue;
+        const allLabels = new Set([...sourceLabels, ...taskLabels]);
+        const score = shared.length / allLabels.size;
+        results.push({
+            taskId: task.id,
+            type: 'relates-to',
+            reason: `${shared.length} shared label(s): ${shared.join(', ')}`,
+            score: Math.round(score * 100) / 100,
+        });
+    }
+    return results.sort((a, b) => b.score - a.score);
+}
+/**
+ * Discover related tasks by description similarity (keyword-based Jaccard).
+ */
+export function discoverByDescription(taskId, tasks) {
+    const source = tasks.find((t) => t.id === taskId);
+    if (!source)
+        return [];
+    const sourceText = `${source.title ?? ''} ${source.description ?? ''}`;
+    const sourceTokens = tokenize(sourceText);
+    if (sourceTokens.size === 0)
+        return [];
+    const results = [];
+    for (const task of tasks) {
+        if (task.id === taskId)
+            continue;
+        const text = `${task.title ?? ''} ${task.description ?? ''}`;
+        const tokens = tokenize(text);
+        if (tokens.size === 0)
+            continue;
+        const score = jaccardSimilarity(sourceTokens, tokens);
+        if (score <= 0)
+            continue;
+        let sharedCount = 0;
+        for (const t of sourceTokens) {
+            if (tokens.has(t))
+                sharedCount++;
+        }
+        results.push({
+            taskId: task.id,
+            type: 'relates-to',
+            reason: `${sharedCount} shared keyword(s)`,
+            score: Math.round(score * 100) / 100,
+        });
+    }
+    return results.sort((a, b) => b.score - a.score);
+}
+/**
+ * Discover related tasks by shared files.
+ */
+export function discoverByFiles(taskId, tasks) {
+    const source = tasks.find((t) => t.id === taskId);
+    if (!source?.files?.length)
+        return [];
+    const sourceFiles = new Set(source.files);
+    const results = [];
+    for (const task of tasks) {
+        if (task.id === taskId)
+            continue;
+        if (!task.files?.length)
+            continue;
+        const taskFiles = new Set(task.files);
+        const shared = [...sourceFiles].filter((f) => taskFiles.has(f));
+        if (shared.length === 0)
+            continue;
+        const allFiles = new Set([...sourceFiles, ...taskFiles]);
+        const score = shared.length / allFiles.size;
+        const preview = shared.slice(0, 3).join(', ');
+        const suffix = shared.length > 3 ? '...' : '';
+        results.push({
+            taskId: task.id,
+            type: 'relates-to',
+            reason: `${shared.length} shared file(s): ${preview}${suffix}`,
+            score: Math.round(score * 100) / 100,
+        });
+    }
+    return results.sort((a, b) => b.score - a.score);
+}
+/**
+ * Discover related tasks by hierarchical proximity (siblings and cousins).
+ */
+export function discoverByHierarchy(taskId, tasks, options) {
+    const { siblingBoost = 0.15, cousinBoost = 0.08 } = options ?? {};
+    const source = tasks.find((t) => t.id === taskId);
+    if (!source)
+        return [];
+    const results = [];
+    // Find siblings (same parent)
+    if (source.parentId) {
+        const siblings = tasks.filter((t) => t.parentId === source.parentId && t.id !== taskId);
+        for (const sib of siblings) {
+            results.push({
+                taskId: sib.id,
+                type: 'relates-to',
+                reason: `sibling (shared parent ${source.parentId})`,
+                score: siblingBoost,
+                _hierarchyBoost: siblingBoost,
+                _relationship: 'sibling',
+            });
+        }
+        // Find cousins (same grandparent, different parent)
+        const parent = tasks.find((t) => t.id === source.parentId);
+        if (parent?.parentId) {
+            const auntsUncles = tasks.filter((t) => t.parentId === parent.parentId && t.id !== source.parentId);
+            const auntUncleIds = new Set(auntsUncles.map((t) => t.id));
+            const cousins = tasks.filter((t) => t.parentId && auntUncleIds.has(t.parentId));
+            for (const cousin of cousins) {
+                results.push({
+                    taskId: cousin.id,
+                    type: 'relates-to',
+                    reason: `cousin (shared grandparent ${parent.parentId})`,
+                    score: cousinBoost,
+                    _hierarchyBoost: cousinBoost,
+                    _relationship: 'cousin',
+                });
+            }
+        }
+    }
+    return results.sort((a, b) => b.score - a.score);
+}
+/**
+ * Discover related tasks using all methods combined.
+ */
+export function discoverRelatedTasks(taskId, tasks, method = 'auto') {
+    const task = tasks.find((t) => t.id === taskId);
+    if (!task)
+        return [];
+    switch (method) {
+        case 'labels':
+            return discoverByLabels(taskId, tasks);
+        case 'description':
+            return discoverByDescription(taskId, tasks);
+        case 'files':
+            return discoverByFiles(taskId, tasks);
+        case 'hierarchy':
+            return discoverByHierarchy(taskId, tasks);
+        case 'auto':
+        default: {
+            const labels = discoverByLabels(taskId, tasks);
+            const description = discoverByDescription(taskId, tasks);
+            const files = discoverByFiles(taskId, tasks);
+            const hierarchy = discoverByHierarchy(taskId, tasks);
+            // Merge: group by taskId, apply hierarchy boost
+            const combined = new Map();
+            // Add base results (take highest score per taskId)
+            for (const match of [...labels, ...description, ...files]) {
+                const existing = combined.get(match.taskId);
+                if (!existing || match.score > existing.score) {
+                    combined.set(match.taskId, { ...match });
+                }
+            }
+            // Apply hierarchy boosts
+            for (const hMatch of hierarchy) {
+                const existing = combined.get(hMatch.taskId);
+                if (existing) {
+                    existing.score = Math.min(existing.score + (hMatch._hierarchyBoost ?? 0), 1.0);
+                    existing._hierarchyBoost = hMatch._hierarchyBoost;
+                    existing._relationship = hMatch._relationship;
+                }
+                else {
+                    // Task only found via hierarchy
+                    combined.set(hMatch.taskId, { ...hMatch });
+                }
+            }
+            return [...combined.values()].sort((a, b) => b.score - a.score);
+        }
+    }
+}
+/**
+ * Suggest relates entries filtered by threshold.
+ */
+export function suggestRelates(taskId, tasks, threshold = 0.5) {
+    const task = tasks.find((t) => t.id === taskId);
+    if (!task)
+        return [];
+    const all = discoverRelatedTasks(taskId, tasks, 'auto');
+    // Exclude already-related tasks
+    const existingRelates = new Set();
+    // Tasks may have a `relates` field (not in the type but used at runtime)
+    const taskAny = task;
+    if (taskAny.relates) {
+        for (const r of taskAny.relates) {
+            existingRelates.add(r.taskId);
+        }
+    }
+    return all.filter((m) => m.score >= threshold && !existingRelates.has(m.taskId));
+}
+//# sourceMappingURL=graph-rag.js.map