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