Question Answered step-by-step #include typedef std::vector>… #include typedef std::vector> grid; /****************************DEFINE_FUNCTIONS_HERE*****************************/// header: grid algorithm(const grid&, int, int)grid dfs(const grid& maze, int r, int c) { return {};}/******************************************************************************/ void print_solution(const grid& maze, int startY, int startX, grid (*f)(const grid&, int, int)) { grid path = (*f)(maze, startY, startX); std::cout << "{"; for (int i = 0; i < path.size(); ++i) { std::cout << "{" << path[i][0] << "," << path[i][1] << "}" << (i == path.size() - 1 ? "" : ","); } std::cout << "}n";} /****************************DEFINE_PARAMETERS_HERE****************************/int main() { // Define search algorithm grid (*algorithm)(const grid&, int, int) = dfs; // Define maze to search grid maze = { {0,0,0,0,0,0,1,1,1,0}, {0,1,0,1,0,1,0,1,0,0}, {1,0,0,1,0,0,0,0,0,1}, {0,0,1,1,0,1,1,0,1,0}, {0,1,1,0,0,1,0,0,1,0}, {1,0,0,0,1,0,1,0,1,0}, {0,1,0,1,0,0,0,0,0,0}, {0,0,0,0,1,0,1,1,0,1}, {1,0,1,0,0,1,0,0,0,0}, {0,2,0,1,0,0,1,0,1,0} }; // define position to start at int startY = 0, startX = 0; print_solution(maze, startY, startX, algorithm); return 0;} complete grid dfs , function Computer Science Engineering & Technology C++ Programming CS 1D Share QuestionEmailCopy link Comments (0)
