分子结构中任意两个原子之间最短拓扑距离的求解是建立在采用队列数据结构的宽度优先搜索算法基础上的。
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.
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.
应用推荐