The algorithm of Dijkstra is academic foundation that many engineerings were solved in the shortest path issue, but people must improve and optimize to this algorithm what involves many limitative condition in the real engineering. The minimum labeling algorithm for the shortest path problem is put forward in the paper to avoid burdensome calculation process and failure in display of concrete routes of shortest paths in Dijkstra algorithm. Comparison between the two calculation processes of the minimum labeling algorithm and Dijkstra algorithm on calculation examples in the paper shows the simplification of calculation process in minimum labeling algorithm.
展开▼
