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

背包问题的贪心算法.docx

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．