迪杰斯特拉算法

系统设计采用了迪杰斯特拉算法和图形函数，以便用户更容易理解。

The system is designed by means of Dijkstra algorithm and graph function so as to understand it more easily for the consumer .

迪杰斯特拉算法是目前公认的较好的最短路径算法。

The algorithm of Dijkstra is an acknowledged better algorithm of shortest route .

将迪杰斯特拉算法与克鲁斯卡尔算法相结合，求在不同约束下的最短路径的选取方法，有较强的可适应性及较高的计算效率。

Will di jester pull algorithm combining with cruise Carl algorithm , and in different under the restriction of the shortest path selection method , and have strong adaptability and can be high computing efficiency .

重点介绍了最短路径规划中Dijkstra（迪杰斯特拉）算法及其编程实现；（5）提出了系统测试的方法并给出了系统测试的建议。

Focusing on the shortest path planning in the Dijkstra ( di jester pull ) algorithm and its programming ;( 5 ) Puts forward the system test method and gives the suggestions of the system test .