Function advent_of_code_2021::day_23::find_shortest_path

fn find_shortest_path(start: &Burrow) -> Option<usize>

Use Dijkstra’s algorithm to represent the puzzle as a graph of states, and find the shortest path (i.e. lowest total move energy) for the Amphipods to all reach their desired tunnel.