RE: [xml-dev] An elegant implementation of an XML graph traversal

From
David Lee <>
To
'Chris Burdess' <>, 'Richard Salz' <>
Date
2011-10-09T12:31:31Z
ID
<[email protected]>
Thread
RE: [xml-dev] An elegant implementation of an XML graph traversal
I think Roger was referring to XML documents which represent graph data, not
that XML markup itself is a graph.

Here's a trivial example

<document>
   <element sibling_ref="a" xml:id="b"/>
   <element sibling_ref="b" xml:id="a"/>
</document>


This could a valid representation of the graph     
	 a<->b



----------------------------------------
David A. Lee

http://www.xmlsh.org

-----Original Message-----
From: Chris Burdess [mailto:] 
Sent: Sunday, October 09, 2011 8:06 AM
To: Richard Salz
Cc: Costello, Roger L.; 
Subject: Re: [xml-dev] An elegant implementation of an XML graph traversal


Richard Salz wrote:
>> Recall that, while an XML document is sometimes a tree, in the 
>> general case it is a graph. And that graph may have loops.
> 
> Could you post an example of this?  I've never seen an XML document with 
> loops.

It would indeed be astonishing since the specification precludes it:
http://www.w3.org/TR/REC-xml/#norecursion
_______________________________________________________________________

XML-DEV is a publicly archived, unmoderated list hosted by OASIS
to support XML implementation and development. To minimize
spam in the archives, you must subscribe before posting.

[Un]Subscribe/change address: http://www.oasis-open.org/mlmanage/
Or unsubscribe: 
subscribe: 
List archive: http://lists.xml.org/archives/xml-dev/
List Guidelines: http://www.oasis-open.org/maillists/guidelines.php