Investigation of a shortest path algorithm based on Kruskal algorithm
Tianshi Liu · Journal of Chongqing University of Arts and Sciences · 2009
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.