• To: "Hunsberger, Peter" <Peter.Hunsberger@S...>
• Subject: Re: After XQuery, are we done?
• From: Elliotte Harold <elharo@m...>
• Date: Tue, 26 Oct 2004 11:14:24 -0400
• Cc: XML Developers List <xml-dev@l...>
• In-reply-to: <1E0CC447E59C974CA5C7160D2A2854EC02FECF39@S...>
• References: <1E0CC447E59C974CA5C7160D2A2854EC02FECF39@S...>
• User-agent: Mozilla/5.0 (Macintosh; U; PPC Mac OS X Mach-O; en-US; rv:1.7.3) Gecko/20040910

Hunsberger, Peter wrote:


> Which still leaves the original question; once you've got a way of
> managing and manipulate graphs, why would you need a way to distinguish
> trees?  What does recognizing the special case get you?

Because some things are true of trees which are not true of all graphs, 
the algorithms to process them can be made simpler and/or faster. For 
instance, you can do a depth first search or breadth first search 
without worrying about cycle detection.

-- 
Elliotte Rusty Harold  elharo@m...
XML in a Nutshell 3rd Edition Just Published!
http://www.cafeconleche.org/books/xian3/
http://www.amazon.com/exec/obidos/ISBN=0596007647/cafeaulaitA/ref=nosim

• References:
  • RE: After XQuery, are we done?
    • From: "Hunsberger, Peter" <Peter.Hunsberger@S...>

• Prev by Date: RE: After XQuery, are we done?
• Next by Date: Re: RELAX NG pluggable type libraries
• Previous by thread: RE: After XQuery, are we done?
• Next by thread: RE: After XQuery, are we done?
• Index(es):
  • Date
  • Thread