On 10/17/2010 10:59 PM, doug foxvog wrote:
> It seems to me that the graph would have many disconnected subgraphs,
> and certainly not be a single tree. (01)
Yes. Technically, it would be a forest. (02)
> The unusual case would be when there was a loop. This could happen if
> a professor were to go for another PhD after a number of years, and
> have as a thesis advisor in the new field a former student or even
> student of a student. (03)
Yes. (04)
On 10/17/2010 11:20 PM, Rich Cooper wrote:
> Is there any looser constraint, or must the graph be a DAG at all to be
> fully distinguishable<persons/objects/things> among the paths? (05)
If all relations are symmetric, the graph would not be directed.
But most relations are not symmetric. (06)
John (07)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Config Subscr: http://ontolog.cim3.net/mailman/listinfo/ontolog-forum/
Unsubscribe: mailto:ontolog-forum-leave@xxxxxxxxxxxxxxxx
Shared Files: http://ontolog.cim3.net/file/
Community Wiki: http://ontolog.cim3.net/wiki/
To join: http://ontolog.cim3.net/cgi-bin/wiki.pl?WikiHomePage#nid1J
To Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (08)
|