分子结构中任意两个原子之间最短拓扑距离的求解是建立在采用队列数据结构的宽度优先搜索算法基础上的。
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.
最后，讨论了生成子的性质及连接策略，并在包含索引的基础上，给出了一种宽度优先的无冗余关联规则挖掘算法。
Finally, the characteristics and connection strategies of generator are presented, and based on subsume index, a breadth-first algorithm for mining non-redundant association rule is proposed.
本文提出了一种基于宽度优先搜索的路径生成算法，具有较好的时间复杂性和空间复杂性。
This article gives an algorithm of building search path, which has a more efficient space and time complexity.
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.
然后，用启发式宽度优先搜索算法进行路径规划，产生从初始位置到目标位置的最优路径，引导虚拟人对环境进行漫游。
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.
然后，用启发式宽度优先搜索算法进行路径规划，产生从初始位置到目标位置的最优路径，引导虚拟人对环境进行漫游。
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.
应用推荐