【摘要】 数学规划是研究最优化的一类数学问题,动态规划实际上是研究一类最优化问题的算法,因此其应用范围十分广泛.本文介绍了利用动态规划法来寻找图中任意两点间最短距离的算法,并将其时间复杂度与一般方法作了比较.更多还原

【Abstract】 The optimization of math problem is researched by a method called“math progra-mming,” and dynamic programming is to research the arithmetic of those problem.Thus the appli-cation is very wide.Introduces the algorithm using dynamic programming to search the shortest dis-tance between two points in graph,and compares the complexity with ordinary method.更多还原