CS261 Fall 98 Assignment # 3.

Written component: due Weds 11/18/98, hardcopy, in class
To be done using the starting code linked at the bottom of this page.

• Draw the graph corresponding to the adjacency matrix in the the code.
• Draw the maze corresponding to the adjacency matrix in the code.
• Draw boxes and arrows for the edge-list representation of the graph.

• Implement and run Warshall's algorithm and print the resulting adjacency matrix, one line per row.
• Implement and run find reachable, printing out each grid location as it is reached.
• As usual, all this should be in a single program, with no input required.

Grading

1. Written: 1 pt each problem (TA will grade)
2. Comments and header block present - 1 pt.
3. Submitted code compiles without error - 1 pt
4. Output Adjacency matrix correct - 1 pt
5. Output Adjacency matrix computed using Warshall's alg - 2 pts.
6. Output of find-reachable correct - 2 pts.

Note - the attached code uses inner classes - if this won't compile on your machine, separate out the classes in to separate files.

Maze code