dc-mst-hssga

Third-party implementation of A hybrid genetic algorithm for the degree-constrained minimum spanning tree problem. Homework 3 of Intelligent Optimization Methods, UCAS course 070105M05002H.

求解带度约束的最小生成树问题的算法复现. 中国科学院大学现代智能优化方法第三次作业.

Requirements

• python 3.8.3

Getting Started

Open dc_mst_ga.py and run the example code.

Given an adjacency matrix

and a degree constraint .

We can find the exact solution shown below.

License

MIT

Acknowledgments

Intelligent Optimization Methods, UCAS course: 070105M05002H