In Chapter 5 we discussed the class MazeTest, which reads a rectangUlar maze as a sequence of lines consisting of Os and 1s, where a 0 represents an open square and a 1 represents a closed one. For example, the maze shown in Figure 10.21 and reproduced here has the following input file:
Write a pr am that reads inptn in this form t and fin the shortest path, where the distance along a path is defined � the number of squares covere.
Already registered? Login
Not Account? Sign up
Enter your email address to reset your password
Back to Login? Click here