Objectives
- Convert a maze into a graph
- Solve a maze using a graph shortest path algorithm
- Modify a graph implementation to display required information from the graph
- Test and debug a complex application
This assignment is heavily oriented towards solving a graph problem using Java. You are given a Graph class that implements core graph functionality and algorithms. You should use that class (with one minor modification) to solve this graph problem. The major work involves extending a maze generating algorithm from a previous assignment. First, you must convert the generated maze into a graph. Then you feed the graph data into the supplied Graph class and request that it find the shortest path from start to finish.