parid2188
| Mon, 24 Feb 2003 12:55:12
An itinerary of arcs and intervening nodes through a topic map
graph, by means of which traversal can be made from one node (node n[0])
to another (node n[n]). Given node n[0], the path to node n[n] is a
finite alternating sequence n[0], arc[1], n[1], arc[2], n[3]... n[n]
such that each arc[i] in the sequence connects node[i-1] and node[i].)
An alternating sequence of nodes and edges, representing continuous
traversal (with no repetition of nodes or edges) from node[0] to node[n].
Simplified. |