demo/strongly_connected_orientation.lgf
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 @nodeset 
     2 coords  	label	
     3 (12,6)	        9	
     4 (-12,3)	        8	
     5 (-34,6)	        7	
     6 (-23,22)	6	
     7 (16,26)	        5	
     8 (43,8)	        4	
     9 (24,-8)	        3	
    10 (-4,-14)	2	
    11 (-29,-11)	1	
    12 @uedgeset 
    13 		label	
    14 5	9	9	
    15 9	8	5	
    16 7	6	7	
    17 8	6	6	
    18 4	5	11	
    19 6	5	8	
    20 3	4	12	
    21 9	4	10	
    22 3	2	4	
    23 8	2	3	
    24 1	2	2	
    25 7	1	1	
    26 @end