Description: 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
File list (Check if you may need any files):
Download