solving a maze created by disjoint set

[C++]

So I finally finished writing a program to build a maze using disjoint set (I just learned it =P). Anyway as I was writing my program, I was under the impression that I could start from the end of the maze and I could climb up to the parent node until I reach the entrance. However, I found out that...