1）编程递归实现0-1背包问题并回溯求出问题的解向量（即X[N]的值）和多段图的最短路经问题的动态规划算法。

2）图的数据结构采用邻接表。

3）　　要求用文件装入5个多段图数据，编写从文件到邻接表的函数。

4）验证算法的时间复杂性。

5）0-1背包问题的实验数据见实验二的背包问题数据。

-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.