Struct aoc::year2022::day16::Input

pub struct Input {
    size: usize,
    aa: usize,
    all_valves: usize,
    flow: Vec<u32>,
    distance: Vec<u32>,
    closest: Vec<u32>,
}

Simplified graph of valves. Valves are stored in descending order of flow so the valve at index 0 has the highest flow, valve at index 1 the second highest and so on. This descending order is used by the heuristic to prune branches.

• size Number of non-zero valves plus 1 for AA
• todo Bitmask with a 1 for each initial unopened non-zero valve. For example if there are 5 valves this would be binary 11111.
• flow Stores the flow for each valve
• distance Adjacency matrix of distances between each pair of valves.

Fields

size: usize

aa: usize

all_valves: usize

flow: Vec<u32>

distance: Vec<u32>

closest: Vec<u32>