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.
分子结构中任意两个原子之间最短拓扑距离的求解是建立在采用队列数据结构的宽度优先搜索算法基础上的。
Based on the shortest path problem and classical absolute center model, an algorithm of absolute center problem is discussed, by using the least distance matrix and the optimum path matrix.
在最短路算法和传统的绝对中心点模型的基础上介绍了一种利用最小距离矩阵和最优路径矩阵求取绝对中心点的算法。
Introduces the algorithm using dynamic programming to search the shortest distance between two points in graph, and compares the complexity with ordinary method.
本文介绍了利用动态规划法来寻找图中任意两点间最短距离的算法，并将其时间复杂度与一般方法作了比较。
Introduces the algorithm using dynamic programming to search the shortest distance between two points in graph, and compares the complexity with ordinary method.
本文介绍了利用动态规划法来寻找图中任意两点间最短距离的算法，并将其时间复杂度与一般方法作了比较。
应用推荐