Solves the degree constrained minimum spanning tree problem (DCMST) with an ant based algorithm.
Python Implementation of :
An Ant-Based Algorithm for Finding Degree-Constrained Minimum Spanning Tree.
Algorithm authors : Thang N. Bui and Catherine M. Zrncic
Algoritm paper can be found here:
http://www.cs.york.ac.uk/rts/docs/GECCO_2006/docs/p11.pdf
Test data from http://cs.hbg.psu.edu/benchmarks/file_instances/spanning_tree/SHRD-Graphs/