- Category:
- CSharp
- Tags:
-
- File Size:
- 12kb
- Update:
- 2015-11-04
- Downloads:
- 0 Times
- Uploaded by:
- 陈倩
Description: 1) programming to implement the knapsack problem greedy algorithm and minimum spanning tree prim algorithm. Through the concrete algorithm, it is understood how to achieve the global optimization through local optimization, and the time complexity of the algorithm is verified.
2) enter the adjacency matrix of the 5 graphs, add the number of nodes and the number of edges in the prim algorithm.
3) comparison of the number of statistics and the calculation of the complexity function, the comparison results are listed in the table.
4) the experimental data of knapsack problem are as follows: m=110, n=8
To Search:
File list (Check if you may need any files):
背包问题的贪心算法.docx
Download