优先搜索算法的英文

• bfs

• "优先"英文翻译    take precedence; have priori ...
• "搜索"英文翻译    search for; ferret about; hu ...
• "算法"英文翻译    algorithm
• "全搜索算法" 英文翻译 :    full search algorithm
• "搜索算法" 英文翻译 :    bfs; enns; search algorithm; seqsearch
• "长度优先搜索" 英文翻译 :    length first search
• "广度优先搜索" 英文翻译 :    bfs; breadth first search; breadth-first search
• "横向优先搜索" 英文翻译 :    breadth first search
• "宽度优先搜索" 英文翻译 :    breadth first search
• "深度优先搜索" 英文翻译 :    deep first search; depth-first exploration; depth-first search; dfs depth first search
• "最佳优先搜索" 英文翻译 :    best-first search
• "禁忌搜索算法" 英文翻译 :    tabu search algorithm
• "枚举搜索算法" 英文翻译 :    enumerative search
• "爬山搜索算法" 英文翻译 :    hill-climbing search
• "穷尽搜索算法" 英文翻译 :    full search algorithm
• "随机搜索算法" 英文翻译 :    random searching rs
• "通道搜索算法" 英文翻译 :    channel search algorithm
• "网络搜索算法" 英文翻译 :    tons
• "有序搜索算法" 英文翻译 :    ordered search algorithm
• "直接搜索算法" 英文翻译 :    direct search algorithm
• "最优搜索算法" 英文翻译 :    optimal searching algorithm
• "广度优先搜寻 [宽度优先搜索" 英文翻译 :    breadth-first search
• "广度优先搜索法" 英文翻译 :    bfs(breadth first search); breadth-first search
• "深度优先搜索程序" 英文翻译 :    depth-first search program; program for depth-first search
• "深度优先搜索法" 英文翻译 :    depth-first search; dfs(depth first search)

• E3d r - tree takes into account the features of moving object data and takes advantage of new cost parameters . in particular , least - cost - first search algorithm is used in the insertion algorithm to find the overall best way to insert a new record in e3d r - tree . the proof of the vidility of the algorithm is given
  在e3dr - tree中,结合移动对象数据特征引入空白区域作为新的插入代价参数,同时,在插入算法中利用最小代价优先搜索算法确定全局最优插入路径,并给出算法正确性证明。
• 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最小生成树算法自动生成屏内安装接线图和端子接线图。