lexicographically smallest path in a grid

Revision en1, by Traktour, 2021-01-16 20:51:31

Hello, I have some difficulties with this problem. Given a grid, you are initially in (1,1) and you want to go to (n,m) but you can't step in a cell with '#' you want to check if it is possible and show the lexicographically smallest path ( DDDRL)example of a path I thought of using bfs but it didn't work Thanks


  Rev. Lang. By When Δ Comment
en1 English Traktour 2021-01-16 20:51:31 360 Initial revision (published)