迭代进度跟踪管理工具：2026年研发效能的阵列化重构

/**
 * 迭代依赖穿透跟踪器
 * 识别上游迭代延迟对下游迭代的级联影响
 */
class CrossIterationDependencyTracker {
    constructor(iterations) {
        this.iterations = iterations;  // 迭代阵列数据集
        this.dependencyGraph = new Map();
    }
    
    buildPenetrationGraph() {
        // 构建跨迭代的依赖映射
        for (const iteration of this.iterations) {
            for (const card of iteration.cards) {
                if (card.upstreamDeps && card.upstreamDeps.length > 0) {
                    card.upstreamDeps.forEach(upstreamId => {
                        const key = `${upstreamId}->${card.id}`;
                        this.dependencyGraph.set(key, {
                            targetIteration: iteration.name,
                            targetCard: card,
                            penetrationDepth: this.calcPenetrationDepth(upstreamId, 1)
                        });
                    });
                }
            }
        }
    }
    
    calcPenetrationDepth(cardId, currentDepth) {
        // 递归计算依赖链长度，超过3层触发预警
        const card = this.findCardById(cardId);
        if (!card || !card.upstreamDeps) return currentDepth;
        
        let maxDepth = currentDepth;
        for (const depId of card.upstreamDeps) {
            const depth = this.calcPenetrationDepth(depId, currentDepth + 1);
            maxDepth = Math.max(maxDepth, depth);
        }
        return maxDepth;
    }
    
    identifyBlockingChains() {
        const alerts = [];
        for (const [depKey, depInfo] of this.dependencyGraph) {
            if (depInfo.penetrationDepth > 3) {
                alerts.push({
                    chain: depKey,
                    depth: depInfo.penetrationDepth,
                    suggestion: `依赖链超过3层，建议在迭代规划时拆分或合并卡片`,
                    severity: 'high'
                });
            }
        }
        return alerts;
    }
}