CSE 101 Maze Generation UCSD

For: Miles Jones, CSE 101: Design and Analysis of Algorithms

Algorithm Specifications:
Random Maze Generation implemented via Kruskal's Algorithm. Most optimal path solution found via Dijkstra's Algorithm. Non-optimal path solution implemented via Depth First Search.

Note: Since All edges are of equal weight Dijkstra will perform equivalently to Breath First Search.

Created By: Jose Jorge Jimenez-Olivas

_________________