首页> 外国专利> Method to efficiently process and present possible arrangements of a set of contiguous peer-to-peer links

Method to efficiently process and present possible arrangements of a set of contiguous peer-to-peer links

机译:有效处理和呈现一组连续的对等链路的可能安排的方法

摘要

A method for displaying knowledge nodes within a set of knowledge nodes, stored as a set of contiguous peer-to-peer relationships, including: choosing interactively any knowledge node within the set as a root, and dynamically creating a tree from the root by selecting a contiguous relationship, from the set, between a first and a second knowledge node in which the first knowledge node is a node at a tip of the tree, checking to see whether the second knowledge node is a real or virtual leaf, adding the second knowledge node to the tip creating a new branch and defining another tip, deducing that the new branch is fully developed and excluding the second knowledge node from being considered as a first knowledge node in reiteration if the second knowledge node is a real or virtual leaf, and reiterating until each peer-to-peer relationship in the set is selected.
机译:一种用于显示存储在一组连续的对等关系中的知识节点集中的知识节点的方法,该方法包括:以交互方式选择该集合内的任何知识节点作为根,并通过选择从根动态创建树在该集合中,第一知识节点和第二知识节点之间的连续关系(其中第一知识节点是树顶端的节点)检查第二知识节点是真实叶还是虚拟叶,并添加第二个提示的知识节点创建一个新分支并定义另一个提示,从而推论该新分支已得到充分开发,并且如果第二知识节点是真实叶或虚拟叶,则将第二知识节点排除为重复的第一知识节点,并重复直到选择了集合中的每个对等关系。

著录项

  • 公开/公告号US7359904B2

    专利类型

  • 公开/公告日2008-04-15

    原文格式PDF

  • 申请/专利权人 BRENDAN V. NOLAN;GUY M. B. VERRET;

    申请/专利号US20020171722

  • 发明设计人 BRENDAN V. NOLAN;GUY M. B. VERRET;

    申请日2002-06-14

  • 分类号G06F7/00;G06F17/00;G06F17/30;

  • 国家 US

  • 入库时间 2022-08-21 20:11:09

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号