Description: Set up a plane m n of the grid, will be the lower-left corner of the grid points marked as (0,0) and the upper right corner of the grid point marked as (m, n). A person from (0,0) along the starting grid to reach the road (m, n), but the grid point (i, j) Department only him right up the road or the road, up the road price for the aij ( amj = ￥), the road to the right price is bij (bin = ￥). Try to design a dynamic programming algorithm, in this grid for travelers to find a minimum cost of travel routes. Advanced programming language used to write programs to solve dynamic programming model.
File list (Check if you may need any files):
Download