- From: Irene Polikoff <irene@topquadrant.com>
- Date: Wed, 18 Mar 2015 18:10:39 -0400
- To: Arthur Ryman <arthur.ryman@gmail.com>, <kcoyle@kcoyle.net>
- CC: "public-data-shapes-wg@w3.org" <public-data-shapes-wg@w3.org>
<It illustrates a real-world example where one cannot navigate from a starting node to all other nodes.> I am not quite sure what is special about this concept. I do not believe that in general one can assume that given a set of triples (a graph), there will be a node from which all other nodes in the graph could be reached. Am I missing something? On 3/18/15, 5:40 PM, "Arthur Ryman" <arthur.ryman@gmail.com> wrote: >It >illustrates a real-world example where one cannot navigate from a >starting node to all other nodes.
Received on Wednesday, 18 March 2015 22:27:17 UTC