一个用Dijkstra算法实现的路由算法的java程序——9 图信息文件示例

图信息文件一 CityGraph.txt
NodeNum = 25
Node0 = (1,242)
Node1 = (0,242)(2,305)
Node2 = (1,305)(3,397)(4,704)
Node3 = (2,397)
Node4 = (2,704)(5,674)(14,137)
Node5 = (4,674)(6,651)(13,349)
Node6 = (5,651)(7,825)
Node7 = (6,825)(8,622)(9,367)
Node8 = (7,622)
Node9 = (7,367)(10,675)(12,409)(22,902)(23,672)
Node10 = (9,675)(11,140)
Node11 = (10,140)
Node12 = (9,409)(13,534)
Node13 = (5,349)(12,534)(14,695)(19,511)
Node14 = (4,137)(13,695)(15,668)
Node15 = (14,668)(16,1145)
Node16 = (15,1145)(17,216)(18,1892)(19,676)
Node17 = (16,216)
Node18 = (16,1892)
Node19 = (13,511)(16,676)(20,842)
Node20 = (19,842)(21,1100)(22,967)
Node21 = (20,1100)(22,639)
Node22 = (9,902)(20,967)(21,639)
Node23 = (9,672)(22,607)(24,255)
Node24 = (23,255)

图信息文件二 CityPosition.txt
0(37,5)
1(34,8)
2(31,11)
3(30,14)
4(26,13)
5(26,17)
6(31,20)
7(25,23)
8(31,26)
9(20,24)
10(20,30)
11(24,32)
12(21,20)
13(20,16)
14(21,11)
15(15,9)
16(10,14)
17(6,13)
18(3,5)
19(14,17)
20(12,22)
21(10,27)
22(14,26)
23(17,28)
24(15,32)

图信息文件三 CityID.txt
0 (哈尔滨)
1 (长春)
2 (沈阳)
3 (大连)
4 (天津)
5 (徐州)
6 (上海)
7 (南京)
8 (福州)
9 (株洲)
10 (广州)
11 (深圳)
12 (武汉)
13 (郑州)
14 (北京)
15 (呼和浩特)
16 (兰州)
17 (西宁)
18 (乌鲁木齐)
19 (西安)
20 (成都)
21 (昆明)
22 (贵阳)
23 (柳州)
24 (南宁)