对一个运输商来说要把货运到收货地点选择最短的路线运输是其实现最大利润的要求，那么怎样选择最短的运输路线呢？在运输交通图中，我们设每一个城市为一个结点（vertextype类型）点并把他们分别用关键字代表（关键字int key ），也就是说把每个城市给出一个整数编码；一个城市直接到另一个城市的交通路线为边且这两个城市为相邻结点，不妨设这条路线的距离为边的权值（权值int weight ），易知距离越短运费就越低。这样就可以建立一个无向有权图，那么求最短的运输路线问题就转化为求图中一顶点到其余各个顶点的最短路径问题了。-right to run a transport freight to the place of receipt to choose the shortest route transportation is the biggest achievement of their profits to the request, then how to choose the shortest route? In the transportation plan, We set up a city for every one node (vertextype type) and point them were used on behalf of the keyword (keyword int key), each city is given an integer coding; one city to another city direct traffic routes to the edge and the two neighboring cities nodes, may wish to set up this line of the distance between the edge weights (weights int weight), Yi known as short distance from the lower the freight. This can be established without a map to the right, then seeking the shortest route into the problem for a map of the rest of Vertex Vertex all the shortest path probl