说明：  Dijkstra 贪心法求单源最短路径.Dijkstra算法是解单源最短路径问题的一个贪心算法。
(Dijkstra greedy method for single-source shortest path. Dijkstra algorithm is the solution of single-source shortest path problem, a greedy algorithm.)