- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

# Python Program for Min Cost Path

In this article, we will learn about the solution to the problem statement given below.

**Problem statement** − We are given a cost matrix and a position (m, n), we need to find the cost of minimum cost path to reach (m, n) from (0, 0). Each cell represents a cost to traverse from one cell to another.

Now let’s observe the solution in the implementation below −

## Example

# dynamic approach R = 3 C = 3 def minCost(cost, m, n): # initialization tc = [[0 for x in range(C)] for x in range(R)] # base case tc[0][0] = cost[0][0] # total cost(tc) array for i in range(1, m + 1): tc[i][0] = tc[i-1][0] + cost[i][0] # tc array for j in range(1, n + 1): tc[0][j] = tc[0][j-1] + cost[0][j] # rest tc array for i in range(1, m + 1): for j in range(1, n + 1): tc[i][j] = min(tc[i-1][j-1], tc[i-1][j], tc[i][j-1]) + cost[i][j] return tc[m][n] # main cost = [[1, 5, 3], [7, 7, 4], [8, 5, 3]] print("Total Cost:",minCost(cost, 2, 1))

## Output

Total Cost: 13

All the variables are declared in the local scope and their references are seen in the figure above.

## Conclusion

In this article, we have learned about how we can make a Python Program for Min Cost Path

- Related Questions & Answers
- Min Cost Path
- C Program for Minimum Cost Path
- Min Cost Climbing Stairs in Python
- Program for longest common directory path in Python
- C++ program to find out the shortest cost path in a given graph for q queries
- Program to find minimum cost for painting houses in Python
- Program to find total cost for completing all shipments in python
- Program to find minimum total cost for equalizing list elements in Python
- Program to find out if a vertex in an undirected graph has a lesser cost path in Python
- Program to find out the minimum cost path between the lowest value vertex to the highest value vertex (Python)
- Program to find closest dessert cost in Python
- C++ Program for Dijkstra’s shortest path algorithm?
- Min Stack in Python
- Program to fill Min-max game tree in Python
- Program to find maximum subarray min-product in Python

Advertisements