| 摘要 |
<p>PROBLEM TO BE SOLVED: To ease a problem at the time of using a tree for expressing a non- tree graph. SOLUTION: A processing for obtaining node-link data for defining a graph is started (100), and tree definition data included in the node-link data is obtained as one part of the obtaining processing (102). The node-link data having the tree definition data define a tree in the graph, and the tree definition data indicates the set of the elements of the graph expressed in the tree, and indicates which expression has a descendant in the tree and which expression does not have any descendant in the tree related with at least one element having more than one expressions in the tree. This processing is repeatedly executed to the same graph, and different definition data are obtained by each repetition. Afterwards, the processing for obtaining the node-link data for defining the graph is ended (104).</p> |
