首页>
外国专利>
Method of searching nodes of tree in data information system by passing level (n) to next level (n+1) takes place only if all objects of level (n) have been analyzed
Method of searching nodes of tree in data information system by passing level (n) to next level (n+1) takes place only if all objects of level (n) have been analyzed
A level of a node defines a number of branches that it is necessary to browse the root to this node for selecting all or some elements of the node included in a domain. The objects of a level of the tree are successively analyzed until the name of the selected node is identified. The passage a level (n) to a next level (n+1) taking place only if all objects of the level (n) have been analyzed. An Independent claim is included for: (a) a graphical interface for showing on screen a tree structure of information system
展开▼