|
|||||
|
|
| 动态规划法在寻找图中最短距离中的应用 | |
| 引用本文： | 俞夏琴. 动态规划法在寻找图中最短距离中的应用[J]. 江汉大学学报(自然科学版), 2007, 35(2): 21-23 |
| 作者姓名： | 俞夏琴 |
| 作者单位： | 江汉大学,物理与信息工程学院,武汉,430056 |
| 摘 要： | 数学规划是研究最优化的一类数学问题,动态规划实际上是研究一类最优化问题的算法,因此其应用范围十分广泛.本文介绍了利用动态规划法来寻找图中任意两点间最短距离的算法,并将其时间复杂度与一般方法作了比较. |
| 关 键 词： | 动态规划法 时间复杂度 最短距离 重复平方技术 |
| 文章编号： | 1673-0143（2007）02-0021-03 |
| 修稿时间： | 2007-02-28 |
Application of Dynamic Programming Technique on Shortest Distance of Graph |
|
| YU Xia-qing. Application of Dynamic Programming Technique on Shortest Distance of Graph[J]. Journal of Jianghan University(Natural Sciences), 2007, 35(2): 21-23 | |
| Authors: | YU Xia-qing |
| Affiliation: | School of Physics and Information Engineering, Jianghan University, Wuhan 430056, China |
| 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. |
| Keywords: | dynamic programming complexity of time the shortest distance technique of repeated square |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ | |