Minimum vertex cover problem based on Ant Colony Algorithm

By applying Ant-Cycle model of Ant Colony Algorithm, and modifying the state transition probability, an approximation algorithm is obtained for the minimum vertex cover problem. The time complex of the algorithm is O(n²) , where n is the number of vertices in a network. In the end, an example is given to illustrate the process of the algorithm.