NOTE: use Perl; is on undef hiatus. You can read content, but you can't post it. More info will be forthcoming forthcomingly.
All the Perl that's Practical to Extract and Report
--Mark Hahn, <hahn@neurocog.lrdc.pitt.edu>
Stories, comments, journals, and other submissions on use Perl; are Copyright 1998-2006, their respective owners.
Woow! (Score:1)
Cool post! I added your Perl6::Literate to the http://www.perlfoundation.org/perl6/index.cgi?perl6_modules_list [perlfoundation.org]
Re: (Score:1)
Page name is changed:
http://www.perlfoundation.org/perl6/index.cgi?perl6_apps_and_modules [perlfoundation.org]
Nice, a list of apps (Score:1)
That's a brave thing to do, knowing that the work required updating and maintaining that list by hand will only become harder and harder, and eventually impossible. :)
If you want ideas for things you might have missed in that list, the projects.list file in proto should be fairly comprehensive.
Very interesting (Score:1)
You know, if you swap the word "labyrinth" for "molecule" and "cell" for "atom" and "wall" for "bond"....
The whole flattening hierarchy approach also sounds a bit like a data structure I read about on wikipedia called a "disjoint-set forest" (link [wikipedia.org]).
Anyway, it seems like the method works because labyrinths (and molecules!) have a restricted dimension. For labyrinths in 100 dimensions, the equivalence classes would have few members, and the complexity would again be closer to O(N^2). I guessing, of course :)
Re: (Score:1)
Even in a moderately "small" labyrinth in 100 dimensions, the distinction between O(N) and O(N^2) won't be your biggest concern... :)
The reference to TAOCP (Score:1)
For people with their own copy of TAOCP, you'll find the algorithm used for
Cell.joinas Algorithm E in section 2.3.3. Knuth uses the word "parent" instead of "leader", and he checks for the case where cells A and B are the same cell, but otherwise the details match.