{"id":"think_classical_task_dag_kahn","name":"Task DAG 依赖拓扑卡片","dimension":"think","school":"classical","description":"拒绝空洞长规划，运用 Kahn 拓扑排序解析原子任务依赖，检测循环死锁并规划最优并行度。","parameters_schema":{"properties":{"task_nodes":{"description":"候选任务清单与前置依赖","items":{"type":"string"},"type":"array"}},"required":["task_nodes"],"type":"object"},"output_schema":{"properties":{"execution_order":{"items":{"type":"string"},"type":"array"},"has_cycle":{"type":"boolean"}},"type":"object"},"default_timeout_secs":15,"tags":["拓扑排序","DAG 依赖","Kahn 算法"],"origin_chapter":"第 21 篇：巴克罗夫特 Task DAG 调度"}