c 9th DIMACS Implementation Challenge: Shortest Paths c http://www.dis.uniroma1.it/~challenge9 c Sample single-source problem checking file c c problem and solver name line (first non-comment line): p chk sp ss mysolver c ---------------------------------------------------------------- c c info below refers to graph sample.0.gr and problem sample.0.ss: f sample.0.gr sample.0.ss c graph sample.0.gr has no negative-weight cycle D 0 c sums modulo 2^62 of distances from each source specified in sample.0.ss d 1 32948723948221 d 3 8456387465442 d 5 198345723847234 c c ---------------------------------------------------------------- c c info below refers to graph sample.1.gr and problem sample.1.ss: f sample.1.gr sample.1.ss c c the graph has 2048 nodes, 8192 arcs, and arc weights in [0,1024]: g 2048 8192 0 1024 c c graph sample.1.gr has a negative-weight cycle D 1 c no d lines since there is a negative-weight cycle