mgs/a-star-maze-solver
1
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

Fix compiler warnings

Browse Source
This commit is contained in:
karl 2020-10-15 14:49:10 +02:00
parent 101b6e973a
commit cb99f52448
1 changed files with 2 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
main.cpp
View File

@ -36,8 +36,8 @@ Maze solve_maze(const Maze &maze) {
std::pop_heap(nodes.begin(), nodes.end(), [](MazeNode n1, MazeNode n2){return n1.priority > n2.priority;}); std::pop_heap(nodes.begin(), nodes.end(), [](MazeNode n1, MazeNode n2){return n1.priority > n2.priority;});
nodes.pop_back(); nodes.pop_back();
int current_x = best.v[0]; uint current_x = best.v[0];
int current_y = best.v[1]; uint current_y = best.v[1];
std::vector<uint> here = std::vector<uint>{current_x, current_y}; std::vector<uint> here = std::vector<uint>{current_x, current_y};
// Are we done? // Are we done?