多段图问题的动态规划算法与实现

功能：求源点到汇点的最短路径及决策过程。

要求：用向前处理和向后处理方法分别对给出的数据，进行求解（注意在文档中画出多段图）。给出复杂性分析。

输入：多段图的段数，顶点数，以及每条边的权重。

输出：多段图的最短路径和决策过程。

-Many of the map of the dynamic programming algorithm and implementation features: seeking the source point to the Meeting Point of the shortest path and the decision-making process. Requirements: forward and backward approach given data to solve (Note that in the document to draw more of the map). Given the complexity of the analysis. Input: Multi-segment, the number of vertices, and the weight of each edge. Output: the shortest path and the decision-making process more of the map.