文件名称:Some-ergodic-map
介绍说明－－下载内容均来自于网络，请自行研究使用
已知n个城市，任意两个城市之间存在最多三种交通工具；每种交通方式产生的费用不一定相同，时间不同：
1算法实现周游这n个城市并且费用最少（写程序，其中n<=10）
2、在规定的时间里，同时考虑每种交通方式花费时间；在规定时间内，周游这n个城市且费用最少-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
1算法实现周游这n个城市并且费用最少（写程序，其中n<=10）
2、在规定的时间里，同时考虑每种交通方式花费时间；在规定时间内，周游这n个城市且费用最少-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
(系统自动生成,下载前可以参看下载内容)
下载文件列表
问题二\data.txt
......\head.h
......\main.cpp
......\main.exe
....一\data.txt
......\head.h
......\main.cpp
......\main.exe
问题二
问题一