Given the input, use a known graphing algorithm (using boost library for c++ or

Question

Given the input, use a known graphing algorithm (using boost library for c++ or networkx for python) Traverse the maze and output the result:

The output file should contain one line for each instance. There should be a blank line between consecutive instances.
The output should consist of a path from the bottom level to the top level for each instance. There should be a single line of output which indicates the path the itsy bitsy spider should take. Each move should be represented by a direction where
each move is exactly one square in the maze. The direction should be represented using N, S, E, W, U, D to represent orth", south", east", west", up", and down", respectively. Each move should be separated by a space.
Example: Suppose your rst move takes the itsy bitsy spider from the start position west one block, the up one block,
then north three blocks. This sequence of moves should be displayed in your output as follows:
W U N N N
Note that if there is more than one path from start to nish then any path will suffice.

Explanation / Answer

MazeInput.txt

'X' = walls and spaces are traversable paths.

Note:: I used '|' to show that there are spaces before it, though leaving it there won't break the program not having the spaces will.

MazeDriver.d

output

Related Questions

Navigate

• Browse (All)
• Browse G
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.