On Mar 26, Robin Berjon wrote:DAGs wouldn't enough though, most XML tree representations aren't really trees, they're very cyclic.
Pardon me? Could you please provide an example?
XML per se, using an impoverished Information Set (no IDs) can be considered to be a tree, which would naturally make it a DAG.
However that's pretty much an abstract representation that is rarely of much use in actual XML programming. In your typical DOM, children point to their parent, siblings point to each other, everything points back to the root document, attributes point to their owner element, etc. Even if you remove some of those that are infrequently used, you can't remove all the cycles (or absences of direction as you may wish to see it) and have something useful. It gets worse with linking.
-- Robin Berjon <[EMAIL PROTECTED]> Research Engineer, Expway http://expway.fr/ 7FC0 6F5F D864 EFB8 08CE 8E74 58E6 D5DB 4889 2488
