c 9th DIMACS Implementation Challenge: Shortest Paths
c http://www.dis.uniroma1.it/~challenge9
c Sample dynamic single-source problem performance report file
c
c problem and solver name line (first non-comment line):
p res sp dss mysolver
c ----------------------------------------------------------------
c
c performance figures below refer to graph sample.0.gr and problem sample.0.dss:
f sample.0.gr sample.0.dss
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 0.31 msec:
t 0.31
c
c the solver uses 1234 KB on this instance:
s 1234
c
c the solver performed avg 133.54 node scans per operation on this instance:
v 133.54
c
c the solver performed avg 215.24 arc scans per operation on this instance:
e 215.24
c
c the solver performed avg 171.11 distance improvements per operation on this instance:
i 171.11
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 and problem sample.1.dss:
f sample.1.gr sample.1.dss
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 0.62 msec:
t 0.62
c
c the solver uses 2465 KB on this instance:
s 2465
c
c the solver performed avg 213.33 node scans per operation on this instance:
v 213.33
c
c the solver performed avg 332.73 arc scans per operation on this instance:
e 332.73
c
c the solver performed avg 276.25 distance improvements per operation on this instance:
i 276.25
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