繁體版 English Francais한국어РусскийไทยViệt
登录 注册

广度优先搜索的英文

发音:  
"广度优先搜索"怎么读用"广度优先搜索"造句

英文翻译手机手机版

  • bfs
  • breadth first search
  • breadth-first search

例句与用法

  • A clustering algorithm based on broad first searching neighbors
    一种基于广度优先搜索邻居的聚类算法
  • At the same time , this paper discussed the inference machine of failure diagnosis expert system for pressure vessels . the expert system was made with forward reasoning , breadth first search and reliability theory
    本文同时讨论了压力容器失效分析专家系统推理机制,选择正向推理和广度优先搜索的推理控制策略,运用可信度理论的不精确推理方法建立了压力容器失效分析专家系统。
  • Existent search mechanisms either only find some special peers and search files in those peers so that many available peers are ignored , or scale of indices peers is proportion of scale of shared files so that indices is too large . the thesis researches those points and imports the dynamic route idea , then introduces some main amendments , the keys are as follows : 1
    采用动态路由方法来捕获网络中发生的变化,克服了定向广度优先搜索法只搜索特征点的缺点,采用路由表指示查找的方向,从而使得路由表的大小与邻节点的数量成正比,而不是与共享文件数量成正比,减少了网络中的流量。
  • Firstly , the connected end sets of the relay lines are got using the breadth first search algorithm and the connected relationship of wiring terms is got in the electrical circuit diagram according to different cad block structure of different element type . secondly , the appropriate specification of the relay element is chosen by using the equinoctial graph algorithm , and the panel layout diagram is generated automatically by the combining automatic layout and manual intervention . finally , the optimized path algorithm which passes each vertex in the completed non - directional graph once and only once is put forward , this algorithm and the prim minimum spanning tree algrotithm can generate the inner panel wiring diagram and terminal wiring diagram automatically
    首先,采用广度优先搜索算法查找电气原理图中的连通导线端点集,并根据不同类型的继电元件对应的cad图块结构的不同,得到电气原理图中元件接线端子之间的连接关系;其次,根据二分图匹配算法为电气原理图中继电元件选择合适的型号和规格,并采用人工干预和自动布置相结合的方法完成屏面布置图的自动生成;最后,提出了完全无向图中经过每个顶点一次且仅一次的优化路径算法,利用该算法和经过预处理的prim最小生成树算法自动生成屏内安装接线图和端子接线图。
  • In generation of concept lattice , the thesis first reviews existing generation algorithms and analyzes their principles of generation , then presents a top - down algorithm based on optimal - incomplete cover . the algorithm will generate concept set and hasse diagram used width - first search of the line diagram
    在概念格的构造方面,本文总结已有的构造算法,提出一种基于最佳不完全覆盖的概念格构造算法,算法至上而下,以图的广度优先搜索方式生成概念节点和概念的图表结构。
用"广度优先搜索"造句  

其他语种

百科解释

广度优先搜索算法(Breadth-First-Search),又译作宽度优先搜索,或横向优先搜索,简称BFS,是一种图形搜索算法。简单的说,BFS是从根节点开始,沿着树的宽度遍历树的节点。
详细百科解释
广度优先搜索的英文翻译,广度优先搜索英文怎么说,怎么用英语翻译广度优先搜索,广度优先搜索的英文意思,廣度優先搜索的英文广度优先搜索 meaning in English廣度優先搜索的英文广度优先搜索怎么读,发音,例句,用法和解释由查查在线词典提供,版权所有违者必究。