| 摘要 |
PROBLEM TO BE SOLVED: To eliminate the loss of the file perusal history to improve the communication efficiency by regarding the history of perusal as a node indicating address information of each file and expressing the reference relations with a directed graph coupled by branches showing directivities. SOLUTION: The perusal history regards address information (URL) of each file as a node, and reference relations are expressed with a directed graph coupled by branches indicating directivities. Generally, reference relations of perusal histories are cross reference or circular reference and are faithfully expressed with the directed graph. When files are traced by a perusal program, address information of files referred to till then are displayed by the directed graph. When the operation to return to the file referred to just before is repeated, address information of files referred to before this time are left without being erased, thus performing the file reference without perusing files, which are perused in the past, again.
|
