- Category:
- CSharp
- Tags:
-
- File Size:
- 12kb
- Update:
- 2015-11-04
- Downloads:
- 0 Times
- Uploaded by:
- 陈倩
Description: 1) programming recursive implementation of the 0-1 knapsack problem and backtracking to solve the problem of the solution vector (i.e. X[N] value) and the shortest path problem of multi segment graph by the dynamic programming algorithm.
2) the data structure of the graph uses the adjacency list.
3) the requirement to load the file into 5 multi- section data, write the function the file to the adjacency list.
4) the time complexity of the algorithm is verified.
5) the experimental data of the 0-1 knapsack problem is found in the experimental data of two knapsack problem.
To Search:
File list (Check if you may need any files):
include.docx
Download