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
     1 @nodeset 
     2 label
     3 6
     4 5
     5 4
     6 3
     7 2
     8 1
     9 0
    10 @edgeset 
    11                 label      length
    12 5       6       9       4
    13 4       6       8       2
    14 3       5       7       1
    15 2       5       6       3
    16 2       6       5       5
    17 2       4       4       2
    18 1       4       3       3
    19 0       3       2       1
    20 0       2       1       2
    21 0       1       0       3
    22 @nodes 
    23 source 0
    24 target 6
    25 @edges 
    26 @attributes 
    27 @end