Topical Information

This project will help you show your mastery of spanning tree algorithms.

Program Information

Explore the idea in problem P-13.13 (C++) or P-14.80 (Java) and use that to create a maze.

Use the various spanning tree algorithms described in chapter 13/14 to generate mazes of dimensions specified by the user. As noted in the problem statement, presume that each edge represents a wall between two nodes. Now as each edge is added to the spanning tree, this removes that wall.

Draw the maze in the terminal screen with *'s for walls and .'s for nodes and removed walls.

Your program should probably take command-line parameters or have a start-up menu to allow the user to choose which method to use in making their maze.

This assignment is (Level 6).