Dear Matthew, Pat, Chris, and Ed, (01)
Since other people have responded very well, I'd just like to
comment on one point: (02)
CM> ... in fact, you can define a tree to be a connected acyclic graph. (03)
That is only true for undirected trees and graphs. For most of our
purposes (is-a and part hierarchies, for example), the links are
definitely ordered. You can have graphs like lattices that have
multiple paths between two nodes, but no cycles that follow the
arrows. (04)
John (05)
_________________________________________________________________
Message Archives: http://ontolog.cim3.net/forum/ontolog-forum/
Subscribe/Config: 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 Post: mailto:ontolog-forum@xxxxxxxxxxxxxxxx (06)
|