News for hackers. Stuff that matters.
Re:In Lisp, should lists be replaced with trees? by Turing_Machine on Monday May 16, 2011 @08:01AM (#2552273)
To take a familiar example, the Web is not a tree. While you might argue that each page has unique children (outlinks), there is no unique parent -- a page can have an arbitrarily large number of incoming links, and the page can link back to those pages in turn, producing cyclic structures of immense complexity.

For some interesting discussion on the limits of tree structures with respect to urban planning see A City is Not a Tree by Christopher Alexander (who is also the inspiration for the Design Patterns movement in software engineering). http://www.rudi.net/node/317

Re:In Lisp, should lists be replaced with trees? by Deestan on Monday May 16, 2011 @08:55AM (#2552372)
All good, just a nitpick: You don't need a unique parent to have a tree. You don't even need directed edges. :)

The purest definition of a tree graph is "a graph with no cycles".

Re:In Lisp, should lists be replaced with trees? by sesqu on Monday May 16, 2011 @02:38PM (#2553632)
We use different definitions. My trees are acyclic connected graphs with one root.