Given a cost matrix cost and a position (m, n) in cost, write a function that returns cost of minimum cost path to reach (m, n) from (0, 0). Each cell of the matrix represents a cost to traverse through that cell. Total cost of a path to reach (m, n) is sum of all the costs on that path (including both source and destination). You can only traverse down, right and diagonally lower cells from a given cell, i.e., from a given cell (i, j), cells (i+1, j), (i, j+1) and (i+1, j+1) can be traversed. You may assume that all costs are positive integers.
The path with minimum cost is highlighted in the following figure. The path is (0, 0) –> (0, 1) –> (1, 2) –> (2, 2). The cost of the path is 8 (1 + 2 + 2 + 3).
minimum cost to reach (2, 2) = 8
Please refer complete article on Dynamic Programming | Set 6 (Min Cost Path) for more details!
Don’t stop now and take your learning to the next level. Learn all the important concepts of Data Structures and Algorithms with the help of the most trusted course: DSA Self Paced. Become industry ready at a student-friendly price.
- C Program for Min Cost Path
- Python Program for Min Cost Path
- Min Cost Path | DP-6
- Minimum odd cost path in a matrix
- Minimum cost path in a Matrix by moving only on value difference of X
- Java Program for Dijkstra's shortest path algorithm | Greedy Algo-7
- Maximum cost path in an Undirected Graph such that no edge is visited twice in a row
- Minimum Cost Path with Left, Right, Bottom and Up moves allowed
- Dijkstra's shortest path algorithm in Java using PriorityQueue
- Java Program for Program to calculate area of a Tetrahedron
- Java Program for Program to find area of a circle
- Java Program for Program for array rotation
- Java Program for ShellSort
- Java Program to Add two Matrices
- Java Program to take Screenshots
- Java Program for Cutting a Rod | DP-13
- Java Program for QuickSort
- Java Program for Comb Sort
- Java Program for Gnome Sort
- Java Program to find whether a no is power of two