W3C home > Mailing lists > Public > public-rdf-dawg@w3.org > January to March 2010

[TF-PP] cycles - simple or a walk

From: Andy Seaborne <andy.seaborne@talis.com>
Date: Thu, 04 Mar 2010 14:47:52 +0000
Message-ID: <4B8FC818.6050709@talis.com>
To: SPARQL Working Group <public-rdf-dawg@w3.org>

In
http://lists.w3.org/Archives/Public/public-rdf-dawg-comments/2010Feb/0012.html

Jeremy Carroll raises the issue of cycles.

Given:

eg:a eg:p eg:a
eg:a eg:p eg:b

does "?a eg:p {3, 7} ?b" match ?b to both eg:a and eg:b by going round 
the loop in eg:a ex:p eg:a a few times.

One possibility is to allow this.

The other is to spec that this does not contribute to the length of the 
path.  A "simple path" in the graph theory terminology.

http://en.wikipedia.org/wiki/Path_%28graph_theory%29

	Andy
Received on Thursday, 4 March 2010 14:48:28 GMT

This archive was generated by hypermail 2.3.1 : Tuesday, 26 March 2013 16:15:41 GMT