[prev in list] [next in list] [prev in thread] [next in thread] 

List:       ruby-talk
Subject:    Re: Managing Hierarchical Tree-Like Data
From:       poopdeville () gmail ! com
Date:       2006-10-31 21:35:16
Message-ID: 1162330219.986260.70540 () h48g2000cwc ! googlegroups ! com
[Download RAW message or body]

x1 wrote:
> Team:
> I'm looking for a pragmatic way of creating a tree from a list of
> items without knowing the depth of each.
>

Here's a good algorithm for constructing a formal concept lattice.
http://lanl.arxiv.org/pdf/cs.DM/0602069

It's not particularly pragmatic, but it's fast and ultimately
equivalent to what you're trying to do.  

'cid 'ooh


[prev in list] [next in list] [prev in thread] [next in thread]