Description: Route choice problems described a country N cities, respectively, numbered from 1 to N. Ticket office learned that all flights between the N cities traveled through the country' s airports, each flight has two attributes, range and cost, the route is two-way. Traveler' s point of departure city, destination city N air tickets are expensive, and travelers carrying cash is very limited, and he hopes to use the limited cash to reach their destination as soon as possible. The programming task Traveller calculated, the shortest distance from the departure point to the destination, in the range of his carrying cash
To Search:
File list (Check if you may need any files):
airroute.cpp
airroute航线选择问题.pdf
Download