shortest path finding algorithms 最短路径寻优算法
shortest path finding algorithm 最短路径算法
finding the shortest path 最短路径查找
finding fuzzy shortest path 模糊最短路
shortest-path finding 最小路径搜索
shortest path-finding 最短通路搜索
The paper introduced two kinds of graph theory algorithm which is suitable to select other nodes and estimate relating path in actual system on basis of finding out shortest path of node.
在分析过程中以寻求节点最短路径为基础，介绍了两条图论算法，并且这种算法适用于实际系统中其它节点选取以及关联路径的判断。
Most of the developed algorithms are based on the improvement to the shortest path finding algorithm, however, the algorithm is essentially unsuitable for querying transit network.
目前绝大多数公交查询算法是基于最短路径查找算法的改进，但最短路径算法本质上不适合公交线路的查询。
Most automated navigation systems rely on computing the solution to the shortest path problem, and not the problem of finding the simplest path.
在很多情形下，我们所需要的不是到达目的地的最短路径，而是一条最简单路径，也就是容易描述、理解、记忆或者执行路线的导航指令。
应用推荐