Skip to content

Added Minimum Cost Path Algorithm #446

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Merged
pomkarnath98 merged 1 commit into from
Oct 10, 2020
+37 −0
Merged

Added Minimum Cost Path Algorithm #446

Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
37 changes: 37 additions & 0 deletions Dynamic-Programming/MinimumCostPath.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,37 @@
// youtube Link -> https://www.youtube.com/watch?v=lBRtnuxg-gU

const minCostPath = (matrix) => {
/*
Find the min cost path from top-left to bottom-right in matrix
>>> minCostPath([[2, 1], [3, 1], [4, 2]])
6
*/
const n = matrix.length
const m = matrix[0].length

// Preprocessing first row
for (let i = 1; i < m; i++) {
matrix[0][i] += matrix[0][i - 1]
}

// Preprocessing first column
for (let i = 1; i < n; i++) {
matrix[i][0] += matrix[i - 1][0]
}

// Updating cost to current position
for (let i = 1; i < n; i++) {
for (let j = 1; j < m; j++) {
matrix[i][j] += Math.min(matrix[i - 1][j], matrix[i][j - 1])
}
}

return matrix[n - 1][m - 1]
}

const main = () => {
console.log(minCostPath([[2, 1], [3, 1], [4, 2]]))
console.log(minCostPath([[2, 1, 4], [2, 1, 3], [3, 2, 1]]))
}

main()