PathFinder

A Android application (target=android-20) for comparing the difference among the various path finding algorithms, such as DFS, BFS, Dijkstra (not implement) and A*

• Implemented the DFS (Depth First Search) by using a Stack; BFS (Breadth First Search) by an Queue; and A* search by a Priority Queue
• Recode the paths (searching step) into a HashMap, and draw these steps by using Canvas

full video: https://youtu.be/Gl4tVw8jamY

Demo

• compare start:

• dfs:

• bfs:

• A* :

• total result: