C DataStructure Homework help:

Using these codes from class, if possible please provide the adjustments you made. Thank you

I included the code here: First Code (Movement - using north, south, west, east commands.) https://pastebin.com/wXnGR1k2 || Second Code (Structure): https://pastebin.com/4FzDG5Ke

Objective: Using the example algorithms discussed in class as a starting point, add support for the additional directions of up and down Grading Table: Task Programming Guidelines are followed Report is created Map is created as described with additional directions of up and down Points 10 15 20 Depth-first search function works Breadth-first search function works Shortest Path function works User input driven traversal of the map is provided and supports the new directions Total (Points Possible) 20 20 20 20 125 Instructions: The goal of this project is to combine, modify, and expand on the examples I created in class and add support for additional directions (updating all functions in the process as needed) 1. Add 2 additional directions: up and down 2. Create a map consisting of 15 nodes and 3 levels. Dead ends are acceptable and expected but every node needs to be reachable and the two new directions of up and down need to be used (think floors or levels) Make sure the overall map is functional, meaning that there are the concepts of starting and ending nodes in the map 3. 4. Update and test (when the program launches) the three path finding functions discussed in class (depth-first, breadth-first, shortest-path). When the program launches the three path finding functions should run and provide output demonstrating their success After testing the path finding functions, the normal game or manual traversal of the map structure should start. 5. Objective: Using the example algorithms discussed in class as a starting point, add support for the additional directions of up and down Grading Table: Task Programming Guidelines are followed Report is created Map is created as described with additional directions of up and down Points 10 15 20 Depth-first search function works Breadth-first search function works Shortest Path function works User input driven traversal of the map is provided and supports the new directions Total (Points Possible) 20 20 20 20 125 Instructions: The goal of this project is to combine, modify, and expand on the examples I created in class and add support for additional directions (updating all functions in the process as needed) 1. Add 2 additional directions: up and down 2. Create a map consisting of 15 nodes and 3 levels. Dead ends are acceptable and expected but every node needs to be reachable and the two new directions of up and down need to be used (think floors or levels) Make sure the overall map is functional, meaning that there are the concepts of starting and ending nodes in the map 3. 4. Update and test (when the program launches) the three path finding functions discussed in class (depth-first, breadth-first, shortest-path). When the program launches the three path finding functions should run and provide output demonstrating their success After testing the path finding functions, the normal game or manual traversal of the map structure should start. 5