Solution to shortest path with dynamic programming
PANG Su-chao, CHEN Shi(Management Department, Mudanjiang University, Mudanjiang, Heilongjiang 157011, China )
To solve the shortest path with dynamic programming calls for the fact that the problem should have obvious stages, but in fact some problems cannot be divided into stages directly and cannot be solved directly with dynamic programming. Therefore this paper puts forward a changeable method to solve it. That is to change practical problem into standard model to solve with dynamic programming method. The practical example shows that the method is simple in changeable process and the result of calculation is reliable.
【CateGory Index】： F224