| 每对结点间最短路径VC++实现 |
| |
| 引用本文： | 何建树,邱丽娟,栾爽. 每对结点间最短路径VC++实现[J]. 电脑编程技巧与维护, 2009, 0(Z1): 68-69 |
| |
| 作者姓名： | 何建树 邱丽娟 栾爽 |
| |
| 作者单位： | 空军航空大学计算机教研室;空军第一航空学院; |
| |
| 摘 要： | 最短路径问题应用广泛、实现多样。动态规划法能够有效计算出每对节点间的最短路径。本文利用VC++实现了动态规划法的每对节点间最短路径问题。
|
| 关 键 词： | 最短路径 动态规划法 |
Implementation of Shortest Paths Between Each Pair of Nodes Using VC++ |
| |
| HE Jianshu,QIU Lijuan,LUAN Shuang. Implementation of Shortest Paths Between Each Pair of Nodes Using VC++[J]. Computer Programming Skills & Maintenance, 2009, 0(Z1): 68-69 |
| |
| Authors: | HE Jianshu QIU Lijuan LUAN Shuang |
| |
| Affiliation: | HE Jianshu1,QIU Lijuan2,LUAN Shuang1(1.Department of Computer,Aviation University of Air Force,Changchun 130022,2. The First Aeronautical College of Air Force,Xinyang 464000) |
| |
| Abstract: | The shortest path problem is wide application and multiple realizability. Dynamic Programming can calculate the shortest path between each node.This text achieves the shortest path between each node by Dynamic Programming Using VC++. |
| |
| Keywords: | the shortest path Dynamic Programming |
| 本文献已被 CNKI 维普 等数据库收录！ |
