Description: 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.
To Search:
File list (Check if you may need any files):
多段图.doc
Download