Dijkstra(迪杰斯特拉)算法是典型的单源最短路径算法，用于计算一个节点到其他所有节点的最短路径。主要特点是以起始点为中心向外层层扩展，直到扩展到终点为止。Dijkstra算法是很有代表性的最短路径算法，在很多专业课程中都作为基本内容有详细的介绍，如数据结构，图论，运筹学等等。注意该算法要求图中不存在负权边。

问题描述：在无向图 G=(V,E) 中，假设每条边 E[i] 的长度为 w[i]，找到由顶点 V0 到其余各点的最短路径。（单源最短路径）(Dijkstra (Dijkstra) algorithm is a typical single source shortest path algorithm. It is used to calculate the shortest path of a node to all other nodes. The main feature is that the starting point is centered and extended outward until the end of the expansion. Dijkstra algorithm is a typical shortest path algorithm, in many professional courses as a basic content, a detailed introduction, such as data structure, graph theory, operations research, and so on. Note that the algorithm requires no negative edges in the graph.
Problem Descr iption: in undirected graph G= (V, E), assume that the length of each edge E[i] is w[i], and find the shortest path from vertex V0 to the rest of the points. (single source shortest path))