Tag Archives: dynamic programming

Minimum Cost Path Finder

Minimum Cost Path Finder

Given a 2D matrix where each cell has a cost to travel. Find a path from left-top corner to bottom-right corner with minimum travel cost. Constraint: You can move only right or down.

Latest Source Code:
Github: MinimumCostPathFinder.java


Output:

1 7 9 2 
8 6 3 2 
1 6 7 8 
2 9 8 2 
Minimum Cost : 29