demo/grid_ugraph_demo.in
author kpeter
Sun, 13 Jan 2008 10:26:55 +0000
changeset 2555 a84e52e99f57
permissions -rw-r--r--
Reimplemented MinMeanCycle to be much more efficient.
The new version implements Howard's algorithm instead of Karp's algorithm and
it is at least 10-20 times faster on all the 40-50 random graphs we have tested.
deba@1979
     1
10 8
deba@1979
     2
1 1 10 8
deba@1979
     3
..X....X.X
deba@1979
     4
.XX.X.XX..
deba@1979
     5
....X..XX.
deba@1979
     6
XXXXXX.X..
deba@1979
     7
.........X
deba@1979
     8
.X.XXXXXXX
deba@1979
     9
.X...XX...
deba@1979
    10
.X.X....X.