demo/coloring.lgf
author kpeter
Sun, 13 Jan 2008 10:26:55 +0000
changeset 2555 a84e52e99f57
parent 1901 723b2b81d900
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 @nodeset 
     2 coords	label	
     3 (162, 142)	10	
     4 (169, -35)	9	
     5 (-154, -37)	8	
     6 (-1, 12)	7	
     7 (-87, -197)	6	
     8 (360, 54)	5	
     9 (193, 257)	4	
    10 (-89, 224)	3	
    11 (-327, 46)	2	
    12 (157, -150)	1	
    13 (-282, -149)	0	
    14 @uedgeset 
    15 		label	
    16 9	10	17	
    17 1	9	15	
    18 3	9	14	
    19 2	8	4	
    20 6	8	1	
    21 0	8	0	
    22 8	7	7	
    23 0	6	2	
    24 9	5	16	
    25 4	5	13	
    26 1	5	12	
    27 10	4	18	
    28 3	4	11	
    29 10	3	19	
    30 7	3	10	
    31 1	3	6	
    32 2	3	3	
    33 0	2	5	
    34 7	1	9	
    35 6	1	8	
    36 @end