Class for objects that plan using the Dijkstra algorithm.
Public Functions
-
Dijkstra(std::vector<std::vector<int>> grid)
Constructor.
- Return
- no return value
- Parameters
grid: the grid on which the planner is to plan
-
std::tuple<bool, std::vector<Node>>
Plan(const Node &start, const Node &goal)
Dijkstra algorithm implementation.
- Return
- tuple contatining a bool as to whether a path was found, and the path
- Parameters
start: start node goal: goal node