| 摘要 |
A relationship among data in a tree data structure can be effectively traced according to the present invention. Nodes are assigned their respective unique node identifiers, a parent-child relationship is represented by a C->P array containing the node identifiers for parent nodes associated with the node identifiers for non-root nodes that are nodes other than a root node, a list of vertex nodes is provided by storing the node identifiers for the respective vertex nodes in order to represent one or more node groups, each node group including a particular node, which is the vertex node, and descendant nodes of the particular node, and the node identifier for the vertex node belonging to other vertex nodes are deleted from the list of the vertex nodes by referring to the C->P array such that neither the vertex nodes nor the respective descendant nodes of the vertex nodes duplicate each other across the vertex nodes identified by the node identifiers included in the list of the vertex nodes.
|
