c 9th DIMACS Implementation Challenge: Shortest Paths
c http://www.dis.uniroma1.it/~challenge9
c Sample negative cycle detection problem performance report file
c
c problem and solver name line (first non-comment line):
p res sp ncd 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 average time per ncd computation on sample.0.gr is 12.71 msec:
t 12.71
c
c the solver uses 724 KB on this instance:
s 724
c
c the solver performed avg 1024 node scans on this instance:
v 1024.0
c
c the solver performed avg 4096 arc scans on this instance:
e 4096.0
c
c the solver performed avg 1712.13 distance improvements on this instance:
i 1712.13
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 average time per ncd computation on sample.1.gr is 25.42 msec:
t 25.42
c
c the solver uses 1449 KB on this instance:
s 1449
c
c the solver performed avg 2048.0 node scans on this instance:
v 2048.0
c
c the solver performed avg 8192.0 arc scans on this instance:
e 8192.0
c
c the solver performed avg 2451.73 distance improvements on this instance:
i 2451.73
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