Find minimum cost path in a matrix using dp?

Revision en1, by acash, 2019-06-27 10:30:38

we have to find min cost path in a mtrix from top left to bottom right.

Move allowed -> Right,left,Bottom,Up.

I know suitable approach will be using Dijkstra But can we do this using Dp because here we can move in all 4 direction ,If yes then How?

Tags dp


  Rev. Lang. By When Δ Comment
en1 English acash 2019-06-27 10:30:38 299 Initial revision (published)