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