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

Both algorithms are based on successive shortest
path algorithm with dijkstra shortest path
finding
ladanyi@1919
     1
@nodeset
ladanyi@1919
     2
label
ladanyi@1919
     3
0
ladanyi@1919
     4
1
ladanyi@1919
     5
2
ladanyi@1919
     6
3
ladanyi@1919
     7
4
ladanyi@1919
     8
5
ladanyi@1919
     9
6
ladanyi@1919
    10
@edgeset
ladanyi@1919
    11
        weight
ladanyi@1919
    12
0   3   1
ladanyi@1919
    13
0   4   1
ladanyi@1919
    14
1   5   1
ladanyi@1919
    15
5   2   1
ladanyi@1919
    16
6   2   1
ladanyi@1919
    17
0   1   1
ladanyi@1919
    18
2   1   1
ladanyi@1919
    19
3   4   1
ladanyi@1919
    20
4   5   1
ladanyi@1919
    21
5   6   1
ladanyi@1919
    22
@end