- From: Steve Harris <steve.harris@garlik.com>
- Date: Sat, 10 Oct 2009 12:17:26 +0100
- To: "Seaborne, Andy" <andy.seaborne@hp.com>
- Cc: "public-rdf-dawg@w3.org Group" <public-rdf-dawg@w3.org>
On 9 Oct 2009, at 18:06, Seaborne, Andy wrote: >> >>>> "Cycles in paths are possible and are handled." in any particular >>>> way? >>> >>> Rough wording. Cycles exist naturally so have to be handled but >>> that's an implementation issues. It might be by tracking visited >>> nodes, or it might be just part of some algorithm. (e.g. Floyd- >>> Walshall does not have special cases for cycles). >> >> OK, so you're not proposing any particular solution at this point? > > I think it is an implementation issue and outside the spec. I hope > I've shown there is more than one way of doing it and so a spec > should not choose. OK. I was thinking about interop, but I've not given enough thought to algorithms to know how restrictive, or hard, it would be to ensure consistent output across processors. - Steve -- Steve Harris Garlik Limited, 2 Sheen Road, Richmond, TW9 1AE, UK +44(0)20 8973 2465 http://www.garlik.com/ Registered in England and Wales 535 7233 VAT # 849 0517 11 Registered office: Thames House, Portsmouth Road, Esher, Surrey, KT10 9AD
Received on Saturday, 10 October 2009 11:17:56 UTC