| author | beckerjc |
| Sat, 17 Apr 2004 19:19:57 +0000 | |
| changeset 349 | 42c660f58702 |
| permissions | -rw-r--r-- |
1 c
2 c This is a simple example file to demonstrate the
3 c DIMACS input file format for minimum-cost flow problems.
4 c
5 c problem line :
6 p min 4 5
7 c
8 c node descriptor lines :
9 n 1 4
10 n 4 -4
11 c
12 c arc descriptor lines :
13 a 1 2 0 4 2
14 a 1 3 0 2 2
15 a 2 3 0 2 1
16 a 2 4 0 3 3
17 a 3 4 0 5 1