c 9th DIMACS Implementation Challenge: Shortest Paths
c http://www.dis.uniroma1.it/~challenge9
c Sample dynamic all-pairs problem performance report file
c
c problem and solver name line (first non-comment line):
p res sp dap mysolver
c ----------------------------------------------------------------
c
c performance figures below refer to graph sample.0.gr and problem sample.0.dap:
f sample.0.gr sample.0.dap
c
c the graph has 1024 nodes, 4096 arcs, and arc weights in [0,1024]:
g 1024 4094 0 1024
c
c the average time per operation on sample.0.gr is 21.93 msec:
t 21.93
c
c the solver uses 11234 KB on this instance:
s 11234
c
c the solver performed avg 1330.57 node scans per operation on this instance:
v 1330.57
c
c the solver performed avg 2152.73 arc scans per operation on this instance:
e 2152.73
c
c the solver performed avg 1715.76 distance improvements per operation on this instance:
i 1715.76
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 performance figures below refer to graph sample.1.gr and problem sample.1.dap:
f sample.1.gr sample.1.dap
c
c the graph has 2048 nodes, 8192 arcs, and arc weights in [0,1024]:
g 2048 8192 0 1024
c
c the average time per operation on sample.1.gr is 45.12 msec:
t 45.12
c
c the solver uses 21465 KB on this instance:
s 21465
c
c the solver performed avg 2137.16 node scans per operation on this instance:
v 2137.16
c
c the solver performed avg 3327.32 arc scans per operation on this instance:
e 3327.32
c
c the solver performed avg 2766.47 distance improvements per operation on this instance:
i 2766.47
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