Novel Degree Constrained Minimum Spanning Tree Algorithm Based on an Improved Multicolony Ant Algorithm

Algorithm 7

1-EdgeReplacement()

begin

 Sort in order of increasing edges cost

 repeat

  changed False

  Sort in order of increasing edges cost

  while   ≥ 0  do

   while   >   do

    if swapping and creates no cycle in and satisfies degree constraint then

     changed True

     break

until not changed

return