Function build_conflict_tree

atomic-core/src/output/alive/order.rs:524–545

Build the conflict tree from SCCs. This creates a simple linear conflict tree. More sophisticated conflict detection (order conflicts) would enhance this.

(graph: &AliveGraph, result: &mut OrderResult)

/// This creates a simple linear conflict tree. More sophisticated
/// conflict detection (order conflicts) would enhance this.
fn build_conflict_tree(graph: &AliveGraph, result: &mut OrderResult) {
    let mut path = ConflictPath::new();

    // Add SCCs in reverse order (they come out in reverse topological order)
    for (i, scc) in result.sccs.iter().enumerate().rev() {
        let scc_id = SccId::new(i);

        // For multi-span SCCs, we could create nested conflict structures
        // For now, just add them as SCCs
        path.push(PathElement::scc(scc_id));

        // Track if any span in this SCC is a zombie
        let _has_zombie = scc.iter().any(|&vid| {
            graph
                .try_get_vertex(vid)
                .map(|v| v.is_zombie())
                .unwrap_or(false)
        });
    }

    result.conflict_tree = ConflictTree::from_path(path);
}

// TESTS