c 9th DIMACS Implementation Challenge: Shortest Paths
c http://www.dis.uniroma1.it/~challenge9
c Sample point-to-point problem preprocessing performance report file
c
c problem and solver name line (first non-comment line):
p res sp p2p p mysolver
c ----------------------------------------------------------------
c
c performance figures below refer to graph sample.0.gr:
f sample.0.gr
c
c the graph has 1024 nodes, 4096 arcs, and arc weights in [0,1024]:
g 1024 4094 0 1024
c
c the time to preprocess graph sample.0.gr is 12000.71 msec:
t 12000.71
c 
c the preprocessing computation uses 724000 KB on this instance:
s 724000
c additional user-defined lines: number of "blue" and "red" paths scanned
u myaddress@mydomain.org blue-paths 22714
u myaddress@mydomain.org red-paths 2714
c
c ----------------------------------------------------------------
c
c performance figures below refer to graph sample.1.gr:
f sample.1.gr
c
c the graph has 2048 nodes, 8192 arcs, and arc weights in [0,1024]:
g 2048 8192 0 1024
c
c the time to preprocess graph sample.1.gr is 25000.42 msec:
t 25000.42
c 
c the preprocessing computation uses 1449000 KB on this instance:
s 1449000
c additional user-defined lines: number of "blue" and "red" paths scanned
u myaddress@mydomain.org blue-paths 44714
u myaddress@mydomain.org red-paths 3714