pub fn shortest_path_roomxy<P, G>( start: RoomXY, goal_fn: &P, cost_fn: G, ) -> DijkstraSearchResults<RoomXY>where P: Fn(RoomXY) -> bool, G: Fn(RoomXY) -> u32,