c 9th DIMACS Implementation Challenge: Shortest Paths
c http://www.dis.uniroma1.it/~challenge9
c Sample dynamic all-pairs problem specification file
c
p aux sp dap 6
c sequence contains 6 operations
c the sequence should be applied to graph sample.gr
c
q 4 1
i 1 2 71
i 2 3 14
q 1 3
d 4 2
q 1 4