August 2018
Beginner
334 pages
10h 19m
English
As you can see, the algorithm is very similar to that of the recursive version of DFS, but uses the principle of making decisions on top of a heuristic from A*. The main function is responsible for starting the recursion and building the resulting path. The recursive function is the one responsible for traversing the graph, looking for the destination node.
Read now
Unlock full access