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.
     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.