Solving the shortest route problem using dynamic programming
Wang Jian-xin · Modern Electronics Technique · 2012
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.