fn search_best_path(
    current_id: usize,
    shortest_paths: &HashMap<(usize, usize), usize>,
    valves: &HashMap<usize, Valve>,
    time_left: usize,
    flow: usize,
    active: HashSet<usize>
) -> usize