Research Article
Automatically Produced Algorithms for the Generalized Minimum Spanning Tree Problem
Input: Graph | Output: Generalized minimum spanning tree | (1) repeat | (2) condition-repeat1 ← false | (3) condition-repeat2 ← false | (4) if least-cluster-initial-connection () or tree-leaf-connection-improvement () | (5) condition-repeat1 ← true | (6) else | (7) while1 [condition-repeat1 ← connect-cluster-with-fewer- vertices ()] = true do | (8) tree-leaf-connection-improvement () | (9) end while1 | (10) end if | (11) if condition-repeat1 = true | (12) repeat | (13) flag ← connection-cluster-improvement () | (14) if internal-edge-connection-improvement () | (15) while1 [flag2 ← subtree-4-cluster-connection-improvement ()] = true do | (16) connect-smallest-edge-with-the-tree () | (17) end while1 | (18) else | (19) flag2 ← false | (20) end if | (21) if flag = flag2 | (22) condition-repeat2 ← true | (23) while1 connect-cluster-with-fewer-vertices() do | (24) connect-cluster-with-fewer- vertices () | (25) end while1 | (26) end if | (27) until condition-repeat2 | (28) end if | (29) until condition-repeat1 | (30) return GMSTP |
|