Function collect_nodes

src/analysis/header.rs:164–184

Recursively collect all nodes and dependency relationships

(
        node: &'a TreeNode, 
        all_nodes: &mut HashMap<&'a str, &'a TreeNode>,
        included_by_others: &mut HashSet<&'a str>,
        includes_map: &mut HashMap<&'a str, HashSet<&'a str>>

    
    // Recursively collect all nodes and dependency relationships
    fn collect_nodes<'a>(
        node: &'a TreeNode, 
        all_nodes: &mut HashMap<&'a str, &'a TreeNode>,
        included_by_others: &mut HashSet<&'a str>,
        includes_map: &mut HashMap<&'a str, HashSet<&'a str>>
    ) {
        let name = node.get_name();
        all_nodes.insert(name, node);
        
        let mut children_set = HashSet::new();
        
        // Collect all child nodes, which are included by the current node
        for child in &node.children {
            let child_name = child.get_name();
            included_by_others.insert(child_name);
            children_set.insert(child_name);
            collect_nodes(child, all_nodes, included_by_others, includes_map);
        }
        
        includes_map.insert(name, children_set);
    }
    
    // Collect nodes for each tree
    for tree in trees {