demo/sample.lgf
author kpeter
Thu, 28 Feb 2008 02:54:27 +0000
changeset 2581 054566ac0934
parent 1901 723b2b81d900
permissions -rw-r--r--
Query improvements in the min cost flow algorithms.

- External flow and potential maps can be used.
- New query functions: flow() and potential().
- CycleCanceling also provides dual solution (node potentials).
- Doc improvements.
athos@1530
     1
@nodeset
deba@1901
     2
label      coordinates_x   coordinates_y
athos@1530
     3
5       796.398 208.035
athos@1530
     4
4       573.002 63.002
athos@1530
     5
3       568.549 401.748
athos@1530
     6
2       277.889 68.476
athos@1530
     7
1       288.248 397.327
athos@1530
     8
0       102.239 257.532
athos@1530
     9
@edgeset
deba@1901
    10
                label      capacity
athos@1530
    11
4       5       6       8
athos@1530
    12
3       5       5       8
athos@1530
    13
2       4       4       5
athos@1530
    14
1       4       3       8
athos@1530
    15
1       3       2       5
athos@1530
    16
0       2       1       10
athos@1530
    17
0       1       0       10
athos@1540
    18
#This is a comment here
athos@1530
    19
@nodes
athos@1528
    20
source 0
athos@1528
    21
target 5
athos@1528
    22
@edges 
deba@2416
    23
@attributes
deba@2416
    24
name "Simple Sample Graph"
athos@1541
    25
author "Attila BERNATH"
athos@1528
    26
@end