demo/graph_orientation.lgf
author kpeter
Sun, 13 Jan 2008 10:26:55 +0000
changeset 2555 a84e52e99f57
parent 1687 7dc3abbb7636
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 coordinates_x	coordinates_y	f	label	
     3 -198	-73	2	7	
     4 120	30	4	6	
     5 -17	222	1	5	
     6 328	147	1	4	
     7 247	-179	0	3	
     8 -28	-93	1	2	
     9 -131	83	3	1	
    10 @edgeset 
    11 		label	
    12 7	6	3	
    13 1	6	2	
    14 2	6	1	
    15 4	5	10	
    16 6	5	6	
    17 3	4	9	
    18 6	4	7	
    19 2	3	12	
    20 6	3	8	
    21 7	2	4	
    22 5	1	11	
    23 7	1	5	
    24 @nodes 
    25 @edges 
    26 @attributes 
    27 @end