Description: 1）编程实现n皇后算法，要求求出8皇后问题的所有解。
2）编程实现0-1背包问题的最优解。测试数据采用贪心算法一章的实验数据。
3）用图形输出中间过程。
4）在程序中添加统计扩展节点数，估计算法的复杂性。
-1) programming to achieve the queen n algorithm, the problem of all solutions to the 8 queens.
2) programming to realize the optimal solution of 0-1 knapsack problem. Test data using the greedy algorithm of the experimental data.
3) in the process of the middle process of graphic output.
4) the complexity of the algorithm is added to the program. Platform: |
Size: 10240 |
Author:陈倩 |
Hits:
Search - 8 queens greedy algorithm