alpar@1: c sample.min
alpar@1: c
alpar@1: c This is an example of the minimum cost flow problem data
alpar@1: c in DIMACS format.
alpar@1: c
alpar@1: p min 9 14
alpar@1: c
alpar@1: n 1 20
alpar@1: n 9 -20
alpar@1: c
alpar@1: a 1 2 0 14 0
alpar@1: a 1 4 0 23 0
alpar@1: a 2 3 0 10 2
alpar@1: a 2 4 0  9 3
alpar@1: a 3 5 2 12 1
alpar@1: a 3 8 0 18 0
alpar@1: a 4 5 0 26 0
alpar@1: a 5 2 0 11 1
alpar@1: a 5 6 0 25 5
alpar@1: a 5 7 0  4 7
alpar@1: a 6 7 0  7 0
alpar@1: a 6 8 4  8 0
alpar@1: a 7 9 0 15 3
alpar@1: a 8 9 0 20 9
alpar@1: c
alpar@1: c eof