I need an algorithm for finding the shortest path in a maze that will use recursion. It is my understanding that algorithms that use recursion are usually DFS.
I have been looking all over the internet and most results are just Dijkstra's algorithm, which is not recursive. Can someone please provide a pseudo code or point me to the right direction?
Thank you.
See Question&Answers more detail:os