| author | klao |
| Thu, 26 Feb 2004 16:07:40 +0000 | |
| changeset 132 | 1ac27e476e25 |
| permissions | -rw-r--r-- |
| ladanyi@63 | 1 |
c |
| ladanyi@63 | 2 |
c This is a simple example file to demonstrate the |
| ladanyi@63 | 3 |
c DIMACS input file format for minimum-cost flow problems. |
| ladanyi@63 | 4 |
c |
| ladanyi@63 | 5 |
c problem line : |
| ladanyi@63 | 6 |
p min 4 5 |
| ladanyi@63 | 7 |
c |
| ladanyi@63 | 8 |
c node descriptor lines : |
| ladanyi@63 | 9 |
n 1 4 |
| ladanyi@63 | 10 |
n 4 -4 |
| ladanyi@63 | 11 |
c |
| ladanyi@63 | 12 |
c arc descriptor lines : |
| ladanyi@63 | 13 |
a 1 2 0 4 2 |
| ladanyi@63 | 14 |
a 1 3 0 2 2 |
| ladanyi@63 | 15 |
a 2 3 0 2 1 |
| ladanyi@63 | 16 |
a 2 4 0 3 3 |
| ladanyi@63 | 17 |
a 3 4 0 5 1 |