最短路径的c++实现。从图中某顶点出发，沿图的边到达另一顶点所经过的路径中， 各边上权值之和最小的一条路径——最短路径：从某个源点到其余各顶点的最短路径。 -c++ shortest path implementation. A vertex the figure, the figure reaches the other side along the path through the vertex, each edge and the minimum weight of a path-