摘要
最短路径问题应用广泛、实现多样。动态规划法能够有效计算出每对节点间的最短路径。本文利用VC++实现了动态规划法的每对节点间最短路径问题。
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++.
出处
《电脑编程技巧与维护》
2009年第S1期68-69,共2页
Computer Programming Skills & Maintenance
关键词
最短路径
动态规划法
the shortest path
Dynamic Programming
