首页> 外国专利> Quasi-minimum tree creating method, involves creating path to form optimum network configuration, creating multiple trees that do not share vertexes and edges, and connecting multiple trees

Quasi-minimum tree creating method, involves creating path to form optimum network configuration, creating multiple trees that do not share vertexes and edges, and connecting multiple trees

机译:准最小树创建方法,包括创建路径以形成最佳网络配置,创建不共享顶点和边的多个树以及连接多个树

摘要

The method involves creating a path for forming, searching or generating an optimum network configuration by selecting the vertexes and edges. Multiple trees, which do not share the vertexes and edges with one another, are created by connecting vertexes to one another. Multiple trees are then connected to one another to provide a quasi-minimum tree with which all the vertexes defined are connected to one another. An Independent claim is also included for a computer readable information recording medium.
机译:该方法包括通过选择顶点和边缘来创建用于形成,搜索或生成最佳网络配置的路径。通过将顶点相互连接,可以创建多个彼此不共享顶点和边的树。然后将多个树相互连接以提供一棵拟最小树,通过该树,所有定义的顶点都相互连接。还包括针对计算机可读信息记录介质的独立权利要求。

著录项

  • 公开/公告号FR2831295A1

    专利类型

  • 公开/公告日2003-04-25

    原文格式PDF

  • 申请/专利权人 BOGENPFEIL CO LTD;

    申请/专利号FR20020013284

  • 发明设计人 YAMAMOTO HARUO;

    申请日2002-10-24

  • 分类号G06F17/50;G06F17/17;

  • 国家 FR

  • 入库时间 2022-08-21 23:37:50

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号