Minimum Transport Cost |

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.

where *a*_{ij} is the transport cost from city *i* to city *j*,
*a*_{ij} = -1 indicates there is no direct path between
city *i* and city *j*. *b*_{i} represents the tax of passing through city *i*. And
the cargo is to be delivered from
city *c* to city *d*, city *e* to city *f*, ..., and city *g* to city *h*.

`From `*c*` to `*d*` :`

`Path:` *c*`->`*c*_{1}`->``->`*c*_{k}`->`*d*

`Total cost :`

`From `*e*` to `*f*` :`

`Path:` *e*`->`*e*_{1}`->``->`*e*_{k}`->`*f*

`Total cost :`

0 3 22 -1 4 3 0 5 -1 -1 22 5 0 9 20 -1 -1 9 0 4 4 -1 20 4 0 5 17 8 3 1 1 3 3 5 2 4

From 1 to 3 : Path: 1-->5-->4-->3 Total cost : 21 From 3 to 5 : Path: 3-->4-->5 Total cost : 16 From 2 to 4 : Path: 2-->1-->5-->4 Total cost : 17