c 9th DIMACS Implementation Challenge: Shortest Paths c http://www.dis.uniroma1.it/~challenge9 c Sample dynamic single-source problem checking file c c problem and solver name line (first non-comment line): p chk sp dss mysolver c ---------------------------------------------------------------- c c info below refers 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 distances computed by the solver: d 2 4 227 d 2 3 654 d 2 4 51 c c ---------------------------------------------------------------- c c info below refers 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 distances computed by the solver: d 2 4 2271 d 2 3 6541 d 2 4 511