摘要
首先对传统的Dijkstra算法进行分析,然后依据Kruskal算法给出一种求解最短路径的方法,并对该方法的核心思想、具体实现步骤和求解过程进行详细描述,最后通过实例将该方法与Dijkstra算法进行对比,验证该方法的有效性.
The Dijkstra algorithm was analyzed firstly in this paper, and then a method for solving the shortest path was given based on the Kruskal algorithm. The core concept of the method, and its specific implementation steps and solution process were described. Finally, the method is compared with the Dijkstra algorithm to verify its validation.
出处
《重庆文理学院学报（自然科学版）》
2009年第6期37-39,共3页
Journal of Chongqing University of Arts and Sciences
