ソースの整理１。

プログラム全体を見直し、少しは使い易くなった。
これからは高速かつ、メモリを食わないデータ構造を探していきたいと思う。


Xeon 3.0GHz / Mem 8GByte

c USA.p2p
c point-to-point shotest path
c for USA
p aux sp p2p 10
q 957498 10453327
q 19200797 7727679
q 13006257 40639
q 4314559 22779984
q 17261435 8424294
q 8077810 13186938
q 3048748 1475829
q 21869636 3531883
q 13446936 4981527
q 18549540 3230879



$ time ./sp_tree USA-road-d.USA.gr USA.p2p
shortest path route start at Thu Nov 29 17:12:47 2007
algorithm is dijkstra method
data structure is binary tree
input file is USA-road-d.USA.gr & USA.p2p
query num is 10
query type is point-to-point
graph type is dimacs graph
node / arc is 23947347 / 58333344
[ 1/10] 957498-10453327
Distance = 39503661, ScanNode = 20253158, CalcTime : 5566.2[ms]

[ 2/10] 19200797-7727679
Distance = 6652463, ScanNode = 4020891, CalcTime : 1192.8[ms]

[ 3/10] 13006257-40639
Distance = 15806743, ScanNode = 12775136, CalcTime : 4480.3[ms]

[ 4/10] 4314559-22779984
Distance = 31900664, ScanNode = 11812148, CalcTime : 3254.5[ms]

[ 5/10] 17261435-8424294
Distance = 2928315, ScanNode = 779311, CalcTime : 288.0[ms]

[ 6/10] 8077810-13186938
Distance = 33411726, ScanNode = 19326314, CalcTime : 5464.2[ms]

[ 7/10] 3048748-1475829
Distance = 13958246, ScanNode = 6669378, CalcTime : 1860.7[ms]

[ 8/10] 21869636-3531883
Distance = 18762398, ScanNode = 4643327, CalcTime : 1208.8[ms]

[ 9/10] 13446936-4981527
Distance = 36604539, ScanNode = 17550812, CalcTime : 5007.2[ms]

[10/10] 18549540-3230879
Distance = 20809134, ScanNode = 16722303, CalcTime : 5612.1[ms]

File Read Time : 48953.6[ms]
Total Calc Time : 33934.8[ms]

real 1m24.134s
user 1m22.888s
sys 0m1.246s