| 1. | Floyd - dijkstra algorithm applied to the design of cable laying
算法在电缆敷设设计中的应用 |
| 2. | The calculation of the shortest path using modified dijkstra algorithm in gis
算法实现最短路径的计算 |
| 3. | A heuristic optimization path - finding algorithm based on dijkstra algorithm
算法的启发式最优路径搜索算法 |
| 4. | Dijkstra ' s shortest path first algorithm
最短路径算法 |
| 5. | Anthinetic of dijkstra yield an effective way to solve this question
Dijkstra算法为解决这类问题提供了一种很好的算法。 |
| 6. | An efficient method of computing the shortest path algorithm which is based on dijkstra algorithm is presented ; 4
对经典dijkstra最短路径搜索算法采用空间换时间的方法，提高了搜索效率； 4 |
| 7. | Finally i implement two location model with common di jkstra algorithm and stimulation annealing merged with gas , at the same time i give out some experiment datas and the idea of algorithm
最后对两类选地址模型分别用传统的dijkstra算法和模拟退火遗传混合算法实现，并给出相应的实验数据和算法思想。 |
| 8. | The dijkstra algorithm of the least of hops is used for path calculated in olsr . but the protocol only tries its best to transmit data , not considering the state of wireless link
它采用dijkstra算法计算跳数最短路径,并尽力而为地传送数据包,没有考虑无线链路时延、带宽等状态和节点拥塞程度,这样的路径计算方式已经不能满足用户对网络提供服务质量的要求。 |
| 9. | Choosing route for passengers is the key technology in the bus information system . there are many classic algorithms such as dijkstra algorithm and floyd algorithm to solve the problem . but they do n ' t fit for this problem
选择路径是公交信息系统中的关键技术，有很多经典的算法解决最短路径问题，如dijkstra算法和floyd算法，但大都不适合于公交查询最短路径。 |
