c 9th DIMACS Implementation Challenge: Shortest Paths
c http://www.dis.uniroma1.it/~challenge9
c Sample negative cycle detection problem checking file
c
c problem and solver name line (first non-comment line):
p chk sp ncd mysolver
c ----------------------------------------------------------------
c
c info below refers 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 the graph contains a negative-weight cycle
D 1
c
c
c ----------------------------------------------------------------
c
c info below refers 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 the graph contains no negative-weight cycle
D 0