train.txt

全国交通算法,求最短路径,最省时间,最少工作量. VC开发的,很有借鉴意义

9
24
0,1,北京
1,1,天津
2,1,徐州
3,1,上海
4,1,长春
5,1,沈阳
6,1,大连
7,1,南昌
8,1,长沙
0,1
20,540,660,120
T13
0,1
30,1140,1200,60
K21
0,1
40,580,700,120
K222
0,3
245,490,865,375
456
1,5
180,710,1130,420
K222
1,0
40,1100,1220,120
K221
1,0
30,380,480,100
K22
1,2
70,670,1090,420
T13
1,0
20,1160,1280,120
T14
1,2
100,1210,70,300
K21
2,1
70,730,1150,420
T14
2,3
70,1100,1420,320
T13
2,1
100,70,370,300
K22
2,3
100,80,420,340
K21
3,2
70,360,720,360
T14
3,2
100,1200,60,300
K22
3,6
669,758,225,907
4578
4,5
60,360,540,180
K221
5,1
180,540,1080,540
K221
5,4
60,1140,1260,120
K222
5,6
80,1090,1330,240
T111
6,5
80,360,600,240
T110
7,3
180,980,520,980
K445
8,7
63,350,750,400
T147