author | Alpar Juttner <alpar@cs.elte.hu> |
Mon, 06 Dec 2010 13:09:21 +0100 | |
changeset 1 | c445c931472f |
permissions | -rw-r--r-- |
alpar@1 | 1 |
c sample.min |
alpar@1 | 2 |
c |
alpar@1 | 3 |
c This is an example of the minimum cost flow problem data |
alpar@1 | 4 |
c in DIMACS format. |
alpar@1 | 5 |
c |
alpar@1 | 6 |
p min 9 14 |
alpar@1 | 7 |
c |
alpar@1 | 8 |
n 1 20 |
alpar@1 | 9 |
n 9 -20 |
alpar@1 | 10 |
c |
alpar@1 | 11 |
a 1 2 0 14 0 |
alpar@1 | 12 |
a 1 4 0 23 0 |
alpar@1 | 13 |
a 2 3 0 10 2 |
alpar@1 | 14 |
a 2 4 0 9 3 |
alpar@1 | 15 |
a 3 5 2 12 1 |
alpar@1 | 16 |
a 3 8 0 18 0 |
alpar@1 | 17 |
a 4 5 0 26 0 |
alpar@1 | 18 |
a 5 2 0 11 1 |
alpar@1 | 19 |
a 5 6 0 25 5 |
alpar@1 | 20 |
a 5 7 0 4 7 |
alpar@1 | 21 |
a 6 7 0 7 0 |
alpar@1 | 22 |
a 6 8 4 8 0 |
alpar@1 | 23 |
a 7 9 0 15 3 |
alpar@1 | 24 |
a 8 9 0 20 9 |
alpar@1 | 25 |
c |
alpar@1 | 26 |
c eof |