There are N cities in Spring country. Between each pair of cities there may be one transportation track or none. Now there is some cargo that should be delivered from one city to another. The transportation fee consists of two parts:

1.
the cost of the transportation on the path between these cities, and
2.
a certain tax which will be charged whenever any cargo passing through one city, except for the source and the destination cities.
You must write a program to find the route which has the minimum cost.

這個資源應顯示在彈出視窗
如果未生效,請點選這裡: UVa 523: Minimum Transport Cost