demo/grid_ugraph_demo.in
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
     1 10 8
     2 1 1 10 8
     3 ..X....X.X
     4 .XX.X.XX..
     5 ....X..XX.
     6 XXXXXX.X..
     7 .........X
     8 .X.XXXXXXX
     9 .X...XX...
    10 .X.X....X.