c 9th DIMACS Implementation Challenge: Shortest Paths
c http://www.dis.uniroma1.it/~challenge9
c Sample point-to-point problem checking file
c
c problem and solver name line (first non-comment line):
p chk sp p2p mysolver
c ----------------------------------------------------------------
c
c info below refers to graph sample.0.gr and problem sample.0.p2p:
f sample.0.gr sample.0.p2p
c
c the graph has 1024 nodes, 4096 arcs, and arc weights in [0,1024]:
g 1024 4094 0 1024
c
c distances computed by the solver:
d 1 5 435
d 5 1 754
d 1 2 23
c ----------------------------------------------------------------
c
c info below refers to graph sample.1.gr and problem sample.1.p2p:
f sample.1.gr sample.1.p2p
c
c the graph has 2048 nodes, 8192 arcs, and arc weights in [0,1024]:
g 2048 8192 0 1024
c
c distances computed by the solver:
d 1 5 4351
d 5 1 7541
d 1 2 231