Finding shortest path through a maze using B-Tree

后端 未结 0 1068
攒了一身酷
攒了一身酷 2021-02-05 19:10

We are given an M by N maze and we should find the shortest path to the exit. The natural thing to do would be BFS and find the shortest path. It is stated that we are required

相关标签:
回答
  • 消灭零回复
提交回复
热议问题