This project is a great example of how disjoint set forrest data structue works. This program creates a maze of N cells. This program also assures that every maze has a beggining to an end and that every maze is different from each other, since it is created at runtime.