[Rails] To RForum devs: Writing a reusable NestedSet implementation

[Rick Bradley]

* Rick Bradley (rick at rickbradley.com) [041205 17:06]:
> At first I misread (I think) this to imply that these were binary trees,
> but I take it that the 'left' and 'right' fields simply point to the
> leftmost and rightmost nodes in the child list of this set/tree node(?).

Probably bad form to reply to myself, but I see better now what you're
talking about (I'm digging through links I've collected over the last
week and one was the "Storing Hierarchical Data in a Database" article
you've linked).

I'm wondering now whether there's a straightforward generalization of
the traversal-id method to the general graph formulation I related in
the prior mail.

Best,
Rick
-- 
 http://www.rickbradley.com    MUPRN: 562
                       |  issues, not only
   random email haiku  |  surrounding this but other
                       |  decisions being made.