demo/sub_gad_input.lgf
author deba
Fri, 14 Apr 2006 18:07:33 +0000
changeset 2051 08652c1763f6
parent 1577 15098fb5275c
permissions -rw-r--r--
MaxWeightedBipartiteMatching
MinCostMaxBipartiteMatching

Both algorithms are based on successive shortest
path algorithm with dijkstra shortest path
finding
athos@1577
     1
@nodeset 
deba@1901
     2
label
athos@1577
     3
6
athos@1577
     4
5
athos@1577
     5
4
athos@1577
     6
3
athos@1577
     7
2
athos@1577
     8
1
athos@1577
     9
0
athos@1577
    10
@edgeset 
deba@1901
    11
                label      length
athos@1577
    12
5       6       9       4
athos@1577
    13
4       6       8       2
athos@1577
    14
3       5       7       1
athos@1577
    15
2       5       6       3
athos@1577
    16
2       6       5       5
athos@1577
    17
2       4       4       2
athos@1577
    18
1       4       3       3
athos@1577
    19
0       3       2       1
athos@1577
    20
0       2       1       2
athos@1577
    21
0       1       0       3
athos@1577
    22
@nodes 
athos@1577
    23
source 0
athos@1577
    24
target 6
athos@1577
    25
@edges 
athos@1577
    26
@attributes 
athos@1577
    27
@end