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).
Please refer complete article on Dynamic Programming | Set 6 (Min Cost Path) for more details!
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
- Java Program for Min Cost Path
- Python Program for Min Cost Path
- Min Cost Path | DP-6
- Minimum Cost Path with Left, Right, Bottom and Up moves allowed
- Minimum odd cost path in a matrix
- Minimum cost path in a Matrix by moving only on value difference of X
- Maximum cost path in an Undirected Graph such that no edge is visited twice in a row
- C / C++ Program for Dijkstra's shortest path algorithm | Greedy Algo-7
- Remove minimum elements from either side such that 2*min becomes more than max
- Min number of operations to reduce N to 0 by subtracting any digits from N
- Convert 1 into X in min steps by multiplying with 2 or 3 or by adding 1
- Minimum removals from array to make max - min <= K
- Minimum Cost Polygon Triangulation
- Find the minimum cost to reach destination using a train
- Find minimum adjustment cost of an array
- Minimum Cost To Make Two Strings Identical
- Minimum cost to fill given weight in a bag
- Minimum cost to sort strings using reversal operations of different costs
- Minimum cost to make two strings identical by deleting the digits
- Minimum cost to make Longest Common Subsequence of length k