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.
分子结构中任意两个原子之间最短拓扑距离的求解是建立在采用队列数据结构的宽度优先搜索算法基础上的。
The algorithm adopts a hierarchical structure in knowledge rule while the breadth and depth, first search is integrated in reasoning strategy.
该算法应用的知识规则采用分层结构，在推理策略上综合应用深度和广度优先搜索。
Genetic-saving hybrid algorithm constructed in this paper is a double -deck pseudo-parallel structure. It makes the best of search methods in different fields.
本文构造的遗传节约混合算法是一个两层的伪并行搜索结构，充分利用了不同的领域搜索方法。
应用推荐