On Jan 24, 4:57 pm, Gabriele Carrettoni <gabriele.carrett...@gmail.com> wrote: > Hi, I'm trying to code the algorithm described > here<http://weblog.jamisbuck.org/2010/12/29/maze-generation-eller-s-algorithm> > with > no luck. > I'm struggling to find the best data structure to hold each cell, how to > random join cells and how to build the next row. > I'm not necessarily looking for code, but i would like to have some hints > because this algo is driving me nuts and i always end up with a lot of > messy code that doesn't feel right. (and in fact it isn't because it never > works). > > Thanks in advance. Using a disjoint-set forest (http://en.wikipedia.org/wiki/Disjoint- set_data_structure) is a very effective way to represent a row. You'll have to implement it though.
-- You received this message because you are subscribed to the Google Groups "Clojure" group. To post to this group, send email to clojure@googlegroups.com Note that posts from new members are moderated - please be patient with your first post. To unsubscribe from this group, send email to clojure+unsubscr...@googlegroups.com For more options, visit this group at http://groups.google.com/group/clojure?hl=en
