Graph-Native Change Intelligence

// Cascade impact traversal — Rust implementation
pub fn compute_impact(
    graph: &ProductKnowledgeGraph,
    seed: NodeId,
    filters: &[RelationshipType],
    max_depth: Option<u32>,
) -> ImpactReport {
    let mut visited: HashSet<NodeId> = HashSet::new();
    let mut queue: VecDeque<(NodeId, u32)> = VecDeque::new();
    let mut report = ImpactReport::new(seed);
    
    queue.push_back((seed, 0));
    visited.insert(seed);

    while let Some((node, depth)) = queue.pop_front() {
        if max_depth.map_or(false, |d| depth >= d) { continue; }
        
        // Traverse all filtered relationships from current node
        for edge in graph.edges_from(node, filters) {
            let target = edge.target();
            if visited.insert(target) {
                // Classify the reached node by domain
                match graph.node_domain(target) {
                    Domain::BOM(view) => report.add_bom_impact(target, view),
                    Domain::Procurement => report.add_po_impact(target),
                    Domain::Manufacturing => report.add_wo_impact(target),
                    Domain::Quality => report.add_qual_impact(target),
                    Domain::Regulatory => report.add_reg_impact(target),
                    Domain::Supplier => report.add_supplier_impact(target),
                }
                queue.push_back((target, depth + 1));
            }
        }
    }
    report.estimate_cost(graph); // Roll up financial impact
    report
}