/// Provides methods for pathfinding using the A* algorithm.
///
/// You most likely want to start with one of the following:
/// - [shortest_path_roomxy_single_goal](crate::algorithms::astar::shortest_path_roomxy_single_goal)
/// - [shortest_path_position_single_goal](crate::algorithms::astar::shortest_path_position_single_goal)
/// Provides methods for pathfinding using Dijkstra's Shortest Paths algorithm