Understanding maze generation code

[kleynah22]

So I have been interested in mazes recently(you can even see I made a thread about it earlier, haha) and I was trying to understand this cool software's code:

https://www.dropbox.com/sh/3tl3vmsd8ebxo...=maze51.py

What maze generation algorithm is used here in the generator function?


I can kind of get how the DFS/BFS is implemented, but the parts I can not understand/follow are the A* and Greedy and Djikstra's implementation even after seeing their Wikipedia pages.

So if someone here could break down some of those things and help understand it, it would be great. If you could spare some time we could also talk via PM :) I'm gonna be starting school soon so these would be really helpful for me.

[sparkz_alot]

Way to much code for me to read in a short amount of time, however, this article http://www.geeksforgeeks.org/a-search-algorithm/ gives a pretty complete description of the different algorithms and when to use them.