Comments on Code How Tos: Building a Maze

Noting there on your site anymore :(

2021-03-17T01:53:09.451+02:00

Noting there on your site anymore :(

cool bro!!

2014-11-02T16:47:18.764+02:00

cool bro!!

Ankur, you can see that when joining 2 groups, I j...

2011-04-03T03:09:14.960+03:00

Ankur, you can see that when joining 2 groups, I join the small one into the bigger one.
This is important for the complexity of the data structure. If you don't do this, you might get a spaghetti structure where each node points to the next and then find will be O(n).

When joining the smaller into the bigger group, the find will be divided by 2 each time, and this will give you complexity of O(Log*n) which is practically O(1).

Great idea. Keeping the sizes of each group seems ...

2011-04-03T02:27:30.663+03:00

Great idea. Keeping the sizes of each group seems unnecessary, though.

That maze looks good. I am always trying to think ...

2011-04-02T16:59:13.771+03:00

That maze looks good. I am always trying to think up ways to draw mazes for games. I want to figure out the algorithm for myself. But it looks like good algorightms are out there.