/**
 * Dependency graph analysis — pure functions for computing reverse dependencies,
 * depth layers, and cascade values from a task dependency graph.
 *
 * These algorithms are adapted from WorkDistributionService's scoring patterns
 * but operate on builder Task types rather than GitHub TaskData.
 */
import type { Task } from './types.js';
/** For each task, which other tasks depend on it. */
export declare function buildReverseDeps(tasks: readonly Task[]): Map<string, string[]>;
/**
 * Dependency depth: layer 0 = no dependencies, layer N = depends on something in layer N-1.
 * Uses DFS with memoization.
 */
export declare function computeDepthLayers(tasks: readonly Task[]): Map<string, number>;
/**
 * Cascade value: how many downstream tasks depend on this one, depth-weighted.
 * BFS on the reverse dependency graph. Depth 1 dependents score 15, depth 2
 * score 8, depth 3+ score 4. Capped at 40. Adapted from WorkDistributionService.
 */
export declare function computeCascadeValues(tasks: readonly Task[], reverseDeps: ReadonlyMap<string, readonly string[]>): Map<string, number>;
//# sourceMappingURL=dependency-graph.d.ts.map