The problem can't be solved without specifying what the legal moves are. Solutions have been given for the case where the only moves are down and right. However, if other moves are allowed the result will be different, and if cycles are allowed the answer could be infinite. Stating problems precisely is very important.
BFS is not a workable solution. For any matrix larger than about 10x10 it will take longer than you want to wait. Don On Feb 21, 2:56 am, shady <sinv...@gmail.com> wrote: > Given a matrix of size mXn, find the number of paths from the top left cell > to the bottom right cell. > > BFS is one way... any other approach ? -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To unsubscribe from this group and stop receiving emails from it, send an email to algogeeks+unsubscr...@googlegroups.com. For more options, visit https://groups.google.com/groups/opt_out.
