demo/digraph.lgf
author Peter Kovacs <kpeter@inf.elte.hu>
Fri, 17 Apr 2009 18:04:36 +0200
changeset 601 e6927fe719e6
permissions -rw-r--r--
Support >= and <= constraints in NetworkSimplex (#219, #234)

By default the same inequality constraints are supported as by
Circulation (the GEQ form), but the LEQ form can also be selected
using the problemType() function.

The documentation of the min. cost flow module is reworked and
extended with important notes and explanations about the different
variants of the problem and about the dual solution and optimality
conditions.
deba@164
     1
@nodes
deba@164
     2
label
deba@164
     3
0
deba@164
     4
1
deba@164
     5
2
deba@164
     6
3
deba@164
     7
4
deba@164
     8
5
deba@164
     9
6
deba@164
    10
7
deba@164
    11
@arcs
deba@164
    12
		label capacity
deba@164
    13
0 	1 	0  	  16
deba@164
    14
0 	2 	1 	  12
deba@164
    15
0 	3 	2 	  20
deba@164
    16
1 	2 	3 	  10
deba@164
    17
1 	4 	4 	  10
deba@164
    18
1 	5 	5 	  13
deba@164
    19
2 	3 	6 	  10
deba@164
    20
2 	4 	7 	  8
deba@164
    21
2 	6 	8 	  8
deba@164
    22
5 	3 	9 	  20
deba@164
    23
3 	6 	10 	  25
deba@164
    24
4 	7 	11 	  15
deba@164
    25
5 	7 	12 	  15
deba@164
    26
6 	7 	13 	  18
deba@164
    27
@attributes
deba@164
    28
source 0
deba@164
    29
target 7