求从源点到其余各顶点的最短路径，用Dijkstra算法

程序要输入各边顶点和边长，用Dijkstra输出最短路径长度和最短路径

-Demand from the source point to the rest of the vertices of the shortest path using Dijkstra algorithm program to enter each side of vertex and edge length, with the output of Dijkstra shortest path length and the shortest path