/**
 * plan-graph — 计划阶段 CLI 算图模块
 *
 * 核心原则：CLI 做确定性计算（依赖图、拓扑排序、关键路径），
 * AI 只做判断（优先级冲突、资源冲突、风险）。
 */
import { TaskState } from './state';
export interface Batch {
    batch: number;
    tasks: string[];
}
export interface Conflict {
    type: 'resource' | 'dependency' | 'priority';
    description: string;
    involved: string[];
}
export interface PlanGraph {
    tasks: TaskMeta[];
    batches: Batch[];
    criticalPath: string[];
    totalDuration: number;
    conflicts: Conflict[];
    platformCoverage: Record<string, number>;
}
export interface TaskMeta {
    id: string;
    name: string;
    depends_on: string[];
    platforms: string[];
    estimated_hours: number;
    priority: string;
    assignee: string;
    status: string;
}
/**
 * 构建依赖图并计算执行批次（拓扑排序分层）
 */
export declare function computeBatches(tasks: TaskState[]): Batch[];
/**
 * 计算关键路径（耗时最长的依赖链）
 */
export declare function findCriticalPath(tasks: TaskState[], batches: Batch[]): string[];
/**
 * 检测资源冲突（同一人在同一批次有多个任务）
 */
export declare function detectResourceConflicts(tasks: TaskState[], batches: Batch[]): Conflict[];
/**
 * 计算端覆盖统计
 */
export declare function calculatePlatformCoverage(tasks: TaskState[]): Record<string, number>;
/**
 * 构建完整的计划图（CLI 算图结果）
 */
export declare function buildPlanGraph(tasks: TaskState[]): PlanGraph;
/**
 * 生成结构化 JSON（给 AI 的输入）
 */
export declare function generatePlanJson(graph: PlanGraph): string;
/**
 * 构建 AI 决策 Prompt（基于 CLI 算好的图）
 */
export declare function buildPlanDecisionPrompt(json: string): string;
//# sourceMappingURL=plan-graph.d.ts.map