Research Article
Novel Degree Constrained Minimum Spanning Tree Algorithm Based on an Improved Multicolony Ant Algorithm
| ConstructSpanningTree() | | begin | | | | Sort in order of descreasing pheromone level | | top Candidates edges from | | Sort in order of increasing edges cost | | while do | | if then | | Let be the next edge in | | Remove from | | if adding e into with meet the degree constraint then | | | | else | | next Candidates edges from | | Sort in order of increasing edges cost | | return |
|
