用动态规划方法求解最短运输路线问题

摘要

In daily life, many fields are concerned with the shortest route problem. It is very important to find the solution to the shortest route problem. The basic ideas of the dynamic programming, the procedure of the solution to the shortest problem are presented and finally the shortest route problem is solved by using C language. And the feasibility of the dynamic programming for solving the shortest route problem is explained.%在日常生活中,很多领域都要涉及到最短路径问题,如何求解最短路径的问题是非常重要的.阐述了动态规划方法的基本思想、求解最短路径问题的步骤,并使用C语言编程解决了最短运输路线问题,说明了动态规划求解最短路径的可行性.