本文提出了一种基于宽度优先搜索的路径生成算法，具有较好的时间复杂性和空间复杂性。
This article gives an algorithm of building search path, which has a more efficient space and time complexity.
分子结构中任意两个原子之间最短拓扑距离的求解是建立在采用队列数据结构的宽度优先搜索算法基础上的。
The shortest topological distance between two atoms in a structure was designed according to the widely used breadth first search algorithm which uses a data structure called Queue.
然后，用启发式宽度优先搜索算法进行路径规划，产生从初始位置到目标位置的最优路径，引导虚拟人对环境进行漫游。
Then, a heuristic breadth-first search is applied for path planning to find an optimal path from an original position to an aim, directing virtual human walkthrough in environments.
本文详细分析了防误操作闭锁逻辑的特点，并用启发式搜索和宽度优先搜索相结合的搜索方法实现了该逻辑的自动生成。
This paper analyzed the logic in detail and realized the logic automatically with the method of heuristic search based on width-first searching.
ERAMC算法利用预先计算来简化网络拓扑，然后采用带优先权的宽度优先搜索算法寻找满足多个限制条件的传输路径。
Making use of precomputation, algorithm ERAMC simplifies network topology and USES a breadth-first search algorithm with priority to find a transmission path that satisfies multiple constraints.
可在ORDERBY 子句中使用伪列LEVEL按照搜索宽度优先顺序返回结果集。
The pseudo column LEVEL can be used in the ORDER BY clause to return the result set in search breadth first sequence.
然后，它会用由下至上、宽度优先(bottomup,breadth - first)的搜索策略，同时构造所有可行的计划。
It will then construct all feasible plans simultaneously using a bottom up, breath-first search strategy.
人工智能里的图搜索技术，以宽度优先为搜索策略。
In artificial intelligence chart search technology, take width first as search strategy.
人工智能里的图搜索技术，以宽度优先为搜索策略。
In artificial intelligence chart search technology, take width first as search strategy.
应用推荐