Function get_reachable_nodes

src/analysis/header.rs:269–294

Helper function: get all nodes reachable from a given node

(
    start: &'a str, 
    includes_map: &HashMap<&'a str, HashSet<&'a str>>
)

// Helper function: get all nodes reachable from a given node
fn get_reachable_nodes<'a>(
    start: &'a str, 
    includes_map: &HashMap<&'a str, HashSet<&'a str>>
) -> HashSet<&'a str> {
    let mut reachable = HashSet::new();
    let mut stack = vec![start];
    let mut visited = HashSet::new();
    
    while let Some(current) = stack.pop() {
        if visited.contains(current) {
            continue;
        }
        visited.insert(current);
        reachable.insert(current);
        
        if let Some(children) = includes_map.get(current) {
            for &child in children {
                if !visited.contains(child) {
                    stack.push(child);
                }
            }
        }
    }
    
    reachable
}


fn is_a_lib_header(name: &str) -> bool {