By three methods we may learn wisdom: First, by reflection, which is noblest; Second,
by imitation, which is easiest; and third by experience, which is the bitterest.
- Confucius
Due Thursday, Decemeber 1 at 11:59pm
Starting withyour lab1 implementation for either Java, C++or C#, perform the following tasks:
chars=[' ','╶','╷','┌','╴','─','┐','┬','╵','└','│','├','┘','┴','┤','┼']
Include a README.txt file that explains how to build and run your program, the test cases selected and other implementation details.
Note, The traditional way of using Prim's algorithm to generate a maze would be to randomly pick an edge. Assigning random edge weights and getting the Minimum-Spanning Tree results in this random pick. However, as I mentioned in class, rand()/srand() and hence Random() is severely broken as rand is monotonic from srand. Use a large prime seed factor and a modulus operator to fix it.
You may use the following code base as a start if you wish or you can use your Lab1 results (with corrections pointed out by the grader). The sample provides an interface for the visitor and data accessor:
Students in the 10:30 section should submit their labs to /submit/c680ab - use the UNIX command "submit c680ab lab2 projDir".
Students in the 2:30 section should submit their labs to /submit/c680ab - use the UNIX command "submit c680ab lab2 projDir".