Description: Known n city, city exists between any two up to three vehicles each kind of transport charges are not necessarily the same, different time:
Algorithm to achieve the N around the city and the least cost ( written procedures, including n<=10 )
At the time, taking into account each kind of traffic way to spend time within the prescribed time, around the n city and the least cost
To Search:
File list (Check if you may need any files):
问题二\data.txt
......\head.h
......\main.cpp
......\main.exe
....一\data.txt
......\head.h
......\main.cpp
......\main.exe
问题二
问题一
Download